|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
4.00 Credits
Spring. Credits: 4. Degree Requirements: Natural Science. Coverage of the basic concepts of 2D and 3D graphics, including an overview of graphics hardware, use of a graphics application programming interface, user interface design, techniques for computer animation, and graphical algorithms such as geometric transformations, clipping, windowing, hidden surface removal, and raster graphics techniques for the representation of curves, surfaces, and solids. (Course offered in alternate years; scheduled for 2007-2008.) Corequisite: Math 223 or Math 261 (unless already taken). Prerequisites: Computer Science 241.
-
4.00 Credits
Fall, Spring. Credits: 4-4. Degree Requirements: Natural Science. Topics include the real and complex number systems, metric spaces, sequences and series, continuity, and differentiation, as well as topics selected from the Riemann and the Riemann-Stieltjes integrals, sequences and series of functions, functions of several real variables, and Lebesgue theory. Emphasis is on careful proof. (Courses offered in alternate years; scheduled for 2008-2009.) Prerequisites: For 321, Math 201 and Math 223. For 322, Math 321.
-
4.00 Credits
Fall. Credits: 4. Degree Requirements: Natural Science. An introduction to the fundamentals of operating systems design and implementation. Topics include the process model and implementation of processes, an overview of the major components of a modern operating system, mutual exclusion and interprocess synchronization, a survey of scheduling algorithms, memory management techniques, and file systems. Examples are drawn from contemporary operating systems such as UNIX and Windows 2000. (Course offered in alternate years; scheduled for 2009-2010.) Prerequisites: Computer Science 231.
-
4.00 Credits
Fall. Credits: 4. Degree Requirements: Natural Science. An advanced study of the fundamental concepts in the design and organization of modern computer systems, focusing on how hardware has developed to support software requirements. Topics include a review of basic computer organization, instruction set design, processor design, memory system design, timing issues, interrupts, microcoding, and various performance-enhancing parallel techniques such as pipelining. Studies of existing architectures will illustrate how these design principles have been implemented. Prerequisites: Computer Science 231.
-
4.00 Credits
Spring. Credits: 4. Degree Requirements: Natural Science. A study of theoretical models for computing. The hierarchy of finite state machines, pushdown machines, context free grammars, and Turing machines will be analyzed, along with their variations. The basic concepts of decidability, complexity theory, and NP-Complete problems will be introduced. Prerequisites: Computer Science 172.
-
4.00 Credits
Spring. Credits: 4. Degree Requirements: Natural Science. An in-depth study of the design and analysis of advanced algorithms, including the performance tradeoffs and resources required by various algorithmic implementations. Major classes of computational problems will be identified and explored. Advanced data structures and approximation heuristics are introduced as required for solution design. Topics vary depending on the specific problems covered but will include the Master Theorem, dynamic programming, divide-and-conquer and greedy algorithms. (Course offered in alternate years; scheduled for 2009-2010.) Prerequisites: Computer Science 241.
-
4.00 Credits
Spring. Credits: 4. A wide-ranging and in-depth coverage of fundamental programming language concepts, presenting design issues of the various language constructs, and examining the design choices for these constructs in a range of the most popular contemporary programming languages. Language design alternatives are examined and critiqued. Methods of syntax description, common approaches to describing the semantics of programming languages, and various implementation approaches are covered. (Course offered in alternate years; scheduled for 2009-2010.) Prerequisites: Computer Science 241.
-
4.00 Credits
Fall, Spring. Credits: 4-4. Degree Requirements: Natural Science. An introduction to axiomatic algebraic structures. Topics include groups, subgroups, permutation groups, cyclic groups, normal subgroups, quotient groups, homomorphisms, isomorphisms, rings, integral domains, polynomial rings, ideals, quotient rings, fields, and extension fields. Additional topics may include finite fields, Galois theory, and advanced topics from linear algebra. (Courses offered in alternate years; scheduled for 2009-2010.) Prerequisites: For 362, Math 201 and Math 261. For 363, Math 362.
-
4.00 Credits
Spring. Credits: 4. Degree Requirements: Natural Science. This course is an introduction to the theory of functions of a complex variable. Topics covered include complex numbers and their properties, analytic functions and the Cauchy-Riemann equations, complex logarithms, exponential and trigonometric functions, complex integration and the Cauchy integral formula, complex power series, the residue theorem, and applications to calculations of definite integrals. (Course offered every third year; scheduled for 2008-2009.) Prerequisites: Math 223.
-
1.00 Credits
Spring. Credits: 1. This course will prepare students for the Senior Seminar experience. Students will attend the Senior Seminar presentations, pursue independent readings, and prepare a Senior Seminar prospectus for approval by the faculty of the department.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|