Published on *Computer Science Department at Princeton University* (https://www.cs.princeton.edu)

If you are looking for current course information:

-View the Registrar's course offerings page [1] for courses offered this semester.

-Students and faculty can refer to the Undergraduate Announcement [2] for the academic year undergraduate course information.

Undergraduate courses are in the 100 - 400 listing. Graduate courses are in the 400 - 500 listing.

Computers are all around us. How does this affect the world we live in? This course is a broad introduction to computing technology for humanities and social science students. Topics will be drawn from current issues and events, and will include discussion of how computers work, what programming is and why it is hard, how the Internet and the Web work, security and privacy.

Cross-listed as EGR109.

Classes:
Two 90-minute lectures. Self-scheduled computer laboratory.

An introduction to computer science in the context of scientific, engineering, and commercial applications. The course will teach basic principles and practical issues, and will prepare students to use computers effectively for applications in computer science, physics, biology, chemistry, engineering, and other disciplines. Topics include: hardware and software systems; programming in Java; algorithms and data structures; fundamental principles of computation; and scientific computing, including simulation, optimization, and data analysis. No prior programming experience required. Video lectures, one or two classes, two preceptorials.

Cross-listed as EGR126.

Classes:
Video lectures, one or two classes and two precepts

Introduction to programming systems, including modular programming, advanced program design, programming style, test, debugging and performance tuning; machine languages and assembly language; and use of system call services.

Classes:
Two 60-minute lectures and two 60-minute preceptorials.

Prerequisite(s):
COS 126, ISC 231-234, or approval by the COS placement officer.

This course surveys the most important algorithms and data structures in use on computers today. Particular emphasis is given to algorithms for sorting, searching, and string processing. Fundamental algorithms in a number of other areas are covered as well, including geometric algorithms, graph algorithms, and some numerical algorithms. The course will concentrate on developing implementations, understanding their performance characteristics, and estimating their potential effectiveness in applications. Two online lectures, two class meetings, one precept.

Classes:
Two online lectures, two class meetings, one precept.

Prerequisite(s):
COS 126, ISC 231-234, or approval by the COS placement officer..

See ISC231-236.

See ELE206 Department of Electrical Engineering [3].

See MUS314 Department of Music [4].

See MUS 315 Department of Music [4].

Prerequisite(s):
Students wishing to take the class should email the professor stating their musical and computer-science experience, describing their interest in the course.

A study of the design and analysis of operating systems. Topics include: processes, mutual exclusion, synchronization, semaphores, monitors, deadlock prevention and detection, memory management, virtual memory, processor scheduling, disk management, file systems, security, protection, distributed systems.

Classes:
Two 90-minute lectures.

Prerequisite(s):
217 and 226 or instructor's permission.

Understand the design and construction of compilers. Concepts include syntax analysis, semantics, code generation, optimization and run-time systems. Translation of imperative languages (such as C), functional languages (such as ML), and object-oriented languages (such as Java) will be studied. Students will implement a complete compiler for a small language.

Classes:
Three lectures.

Prerequisite(s):
COS 217 and COS 226 or instructor's permission.

See ORF363 Department of Operations Research & Financial Engineering [5].

The course provides an introduction to machine learning. Topics covered: learning from examples and generalization. Empirical risk minimization and regularization. Introduction to convex analysis. Gradient-based learning. Implementation and analysis of learning algorithms for regression, binary classification, multiclass categorization, and ranking problems. Dimensionality reduction methods. Ensemble methods and boosting.

An introduction to the principles of typed functional programming. Programming recursive functions over structured data types and informal reasoning by induction about the correctness of those functions. Functional algorithms and data structures. Principles of modular programming, type abstraction, representation invariants and representation independence. Parallel functional programming, algorithms and applications.

Prerequisite(s):
COS 226 or with permission of the instructor.

This is a course about the practice of programming. Programming is more than just writing code. Programmers must also assess tradeoffs, choose among design alternatives, debug and test, improve performance, and maintain software written by themselves & others. At the same time, they must be concerned with compatibility, robustness, and reliability, while meeting specifications. Students will have the opportunity to develop these skills by working on their own code and in group projects.

Classes:
Two 90-minute lectures.

Prerequisite(s):
217 and 226 (as corequisite).

An introduction to mathematical topics relevant to computer science. Combinatorics, probability and graph theory will be covered in the context of computer science applications. The course will present a computer science approach to thinking and modeling. Students will be introduced to fundamental concepts such as NP-completeness and cryptography that arise from the world view of efficient computation.

Prerequisite(s):
COS 126 and 226 (or sufficient mathematical background), and MAT 202, 204 (students entering Princeton before fall 2015 may use MAT 175). COS 226 can be taken along with COS 340 in the same term. Please contact the professor directly with any questions.

See MAT375 Department of Mathematics [6].

See WWS351 Woodrow Wilson School of Public and International Affairs [7].

An introduction to computer architecture and organization. Instruction set design; basic processor implementation techniques; performance management; caches and virtual memory; pipelined processor design; design trade-offs among cost, performance, and complexity.

Cross-listed as ELE375 Department of Electrical Engineering [3].

Classes:
Two 90-minute classes, one self-scheduled hardware laboratory.

Prerequisite(s):
COS 217

See ELE381 Department of Electrical Engineering [3].

See 396 Department of Electrical Engineering [3].

**Links**

[1] https://registrar.princeton.edu/course-offerings/

[2] https://ua.princeton.edu/

[3] http://www.ee.princeton.edu/

[4] http://www.princeton.edu/music/

[5] http://orfe.princeton.edu/

[6] http://www.math.princeton.edu/

[7] http://wws.princeton.edu/

[8] https://www.cs.princeton.edu/courses/catalog?page=1

[9] https://www.cs.princeton.edu/courses/catalog?page=2

[10] https://www.cs.princeton.edu/courses/catalog?page=3