Courses

• CAS CS 332: Elements of the Theory of Computation
  The basic concepts of the theory of computation are studied. Topics include models of computation, polynomial time, Church's thesis; universal algorithms, undecidability and intractability; time and space complexity, nondeterminism, probabilistic computation and reductions of computational problems.
• CAS CS 350: Fundamentals of Computing Systems
  Rigorous treatment of invariant concepts, algorithms, and performance evaluation methods underlying computing systems design. Topics include modeling and analysis of concurrent processing, computational resource scheduling and consumption, and performance evaluation techniques.
• CAS CS 401: Senior Independent Work
  
• CAS CS 402: Senior Independent Work
  
• CAS CS 410: Advanced Software Systems
  Systems programming including such topics as project management, tools, I/O networking, multiprocessing, exception handling, and system services. Other topics are explored using C and Perl under the UNIX operating system. Requires a working knowledge of the C programming language and experience with UNIX as a user, or equivalent.
• CAS CS 411: Software Engineering
  Introduction to the construction of reliable software. Topics may include software tools, software testing methodologies, retrofitting, regression testing, structured design and structured programming, software characteristics and quality, complexity, entropy, deadlock, fault tolerance, formal proofs of program correctness, chief program teams, and structured walk-throughs.
• CAS CS 440: Introduction to Artificial Intelligence
  Introduction to computer systems that exhibit intelligent behavior, in particular, perceptual and robotic systems. Topics include human computer interfaces, computer vision, robotics, game playing, pattern recognition, knowledge representation, planning.
• CAS CS 450: Computer Architecture I
  Overview of computer architecture. Topics include representation of information, combinational and sequential circuits, design and analysis; techniques of implementing algorithms in hardware: parallelism, pipelining; Von Neumann and data flow models of computation, and hardware implementations of both models.
• CAS CS 455: Computer Networks
  Concepts underlying the design of high-performance computer networks and scalable protocols. Topics include Internet design principles and methodology, TCP/IP implementation, packet switching and routing algorithms, multicast, quality of service considerations, error detection and correction, and performance evaluation.
• CAS CS 460: Introduction to Database Systems
  Introduction to database management systems. Examines entity-relationship, relational, and object-oriented data models; commercial query languages: SQL, relational algebra, relational calculus, and QBE; file organization, indexing and hashing, query optimization, transaction processing, concurrency control and recovery,integrity, and security.
• CAS CS 470: Performance Analysis
  Introduction to measurement, modeling, and simulation of computer systems. Applications of probability and stochastic processes to computer systems modeling; queues and queuing networks; discrete event simulation. Applications in client/server systems and networking are emphasized.
• CAS CS 480: Introduction to Computer Graphics
  Introduction to computer graphics algorithms, programming methods, and applications. Focus on fundamentals of two- and three-dimensional raster graphics: scan-conversion, clipping, geometric transformations, and camera modeling. Introduces concepts in computational geometry, computer-human interfaces, animation, and visual realism.
• CAS CS 491: Directed Study
  
• CAS CS 492: Directed Study
  
• CAS CS 511: Object-Oriented Software Principles
  Specification, programming, and analysis of large-scale, reliable, and reusable Java software using object-oriented design principles. Topics may include object-oriented programming, object models, memory models, inheritance, exceptions, namespaces, data abstraction, design against failure, design patterns, reasoning about objects.
• CAS CS 520: Programming Languages
  Concepts of programming languages: data, storage, control, and definition structures; concurrent and distributed programming; functional and logic programming.
• CAS CS 525: Compiler Design Theory
  Covers the basic mathematical theory underlying the design of compilers and other language processors and shows how to use that theory in practical design situations. Topics may include lexical analysis, parsing, syntax-directed translation, code optimization, and code generation.
• CAS CS 530: Analysis of Algorithms
  Studies the design and efficiency of algorithms in several areas of computer science. Topics are chosen from graph algorithms, sorting and searching, NP-complete problems, pattern matching, parallel algorithms, and dynamic programming.
• CAS CS 532: Computational Geometry
  Studies the design, analysis, and implementtion of algorithms and data structures for solving geometric problems that arise in such diverse settings as computer graphics, robotics, databases, data mining, parallel computing, statistics, and pure mathematics.
• CAS CS 535: Complexity Theory
  Covers topics of current interest in the theory of computation chosen from computational models, games and hierarchies of problems, abstract complexity theory, informational complexity theory, time-space trade-offs, probabilistic computation, and recent work on particular combinatorial problems.

Note that this information may change at any time.

Back to full list of College of Arts & Sciences