|
|
Course Criteria
Add courses to your favorites to save, share, and find your best transfer school.
-
3.00 Credits
A survey of the theoretical bases of computation: computational complexity (including the classes P and NP) and formal models of the semantics of programming languages. Three lecture hours a week for one semester. Prerequisite: Computer Science 341 or 341H with a grade of at least C-.
-
3.00 Credits
Introduction to techniques for human-machine communication through imagery. Topics include display hardware, transformations, interactive techniques, geometric modeling, two- and three-dimensional display algorithms, graphics software systems architecture, and hiddenline and surface elimination. Projects are assigned and in-depth exploration is encouraged. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and 340L or 341.
-
3.00 Credits
Introduction to computer networks, including common terminology, basic design issues, and types of networks and protocols. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and credit with a grade of at least C- or registration for Computer Science 352 or 352H.
-
3.00 Credits
Algorithmic paradigms: divide and conquer, greedy algorithms, dynamic programming, branch and bound. NP-completeness and topics selected from the following: cryptography algorithms, approximation algorithms, randomized algorithms, parallel algorithms, lower bounds. Three lecture hours a week for one semester. Computer Science 357 and 357H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; and Mathematics 408D, 408M, or 427L.
-
3.00 Credits
Algorithmic paradigms: divide and conquer, greedy algorithms, dynamic programming, branch and bound. NP-completeness and topics selected from the following: cryptography algorithms, approximation algorithms, randomized algorithms, parallel algorithms, lower bounds. Three lecture hours a week for one semester. Computer Science 357 and 357H may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; 337 or 337H; Mathematics 408D, 408M, or 427L; and consent of the honors director.
-
3.00 Credits
Computer security, both in the abstract and in the context of real systems, including recognizing potential threats to confidentiality, integrity and availability, and developing familiarity with current security-related issues in computer science. Three lecture hours a week for one semester. Computer Science 361 and 378 (Topic: Introduction to Security) may not both be counted. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 408D, 408M, or 427L.
-
3.00 Credits
Topics include systems of linear equations, numerical integration, ordinary differential equations, and nonlinear equations. Construction and use of large numerical systems. Influence of data representation and computer architecture on algorithm choice and development. Three lecture hours a week for one semester. Only one of the following may be counted: Computer Science 367, Mathematics 368K, Physics 329. Prerequisite: The following coursework with a grade of at least Cin each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and 340L or 341.
-
3.00 Credits
Introduction to performance modeling, with emphasis on computer systems. Modeling methodology, queueing network models, simulation, analysis of results. Three lecture hours a week for one semester. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, or 429H; 336 or 336H; and Mathematics 362K.
-
3.00 Credits
Supervised study of selected problems in computer science, by individual arrangement with supervising instructor. The equivalent of three lecture hours a week for one semester. No more than three semester hours may be counted toward a degree in computer science. Prerequisite: The following coursework with a grade of at least C- in each course: Computer Science 310, 310H, 429, 429H; 336 or 336H; Mathematics 408D, 408M, or 427L; and consent of the undergraduate adviser.
-
3.00 Credits
Models, principles, and fundamental protocols, including event ordering and global predicate detection, atomic commit, statemachine replication, rollback recovery, primary backup, consensus for synchronous and asynchronous systems, and byzantine faulttolerance. Three lecture hours a week for one semester. Prerequisite: Computer Science 372 or 372H with a grade of at least C-, or consent of instructor.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|