This course teaches students the design, implementation, and evaluation of computer systems, including operating systems, networking, and distributed systems.The course will teach students to evaluate the performance and study the design choices of existing systems. Students will also learn general systems concepts that support design goals of modularity, performance, and security. Students will apply materials learned in lectures and readings to design and build new systems components. A. Levy, R. Netravali

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. Two 90-minute lectures.

An introduction to computer architecture and organization. Instruction set design; basic processor implementation techniques; performance measurement; caches and virtual memory; pipelined processor design; design trade-offs among cost, performance, and complexity. Two 90-minute classes, one self-scheduled hardware laboratory.

This course covers the design and implementation of distributed systems. Students will gain an understanding of the principles and techniques behind the design of modern, reliable, and high-performance distributed systems. Topics include server design, network programming, naming, concurrency and locking, consistency models and techniques, security, and fault tolerance. Modern techniques and systems employed at some of the largest Internet sites (e.g., Google, Facebook, Amazon) will also be covered. Through programming assignments, students will gain practical experience designing, implementing, and debugging real distributed systems.

This course studies computer networks and the services built on top of them. Topics include packet-switch and multi-access networks, routing and flow control, congestion control and quality-of-service, Internet protocols (IP, TCP, BGP), the client-server model and RPC, elements of distributed systems (naming, security, caching) and the design of network services (multimedia, peer-to-peer networks, file and Web servers, content distribution networks).

This course is a broad introduction to different machine learning paradigms and algorithms and provides a foundation for further study or independent work in machine learning and data science. Topics include linear models for classification and regression, support vector machines, clustering, dimensionality reduction, deep neural networks, Markov decision processes, planning, and reinforcement learning. The goals of this course are three-fold: to understand the landscape of machine learning, how to compute the math behind techniques, and how to use Python and relevant libraries to implement and use various methods.

An introduction to the concepts of 2D and 3D computer vision. Topics include low-level image processing methods such as filtering and edge detection; segmentation and clustering; optical flow and tracking; shape reconstruction from stereo, motion, texture, and shading. Throughout the course, there will also be examination of aspects of human vision and perception that guide and inspire computer vision techniques.

Recent advances have ushered in exciting developments in natural language processing (NLP), resulting in systems that can translate text, answer questions and even hold spoken conversations with us. This course will introduce students to the basics of NLP, covering standard frameworks for dealing with natural language as well as algorithms and techniques to solve various NLP problems, including recent deep learning approaches. Topics covered include language modeling, rep. learning, text classification, sequence tagging, syntactic parsing, and machine translation. The course will have programming assignments, a mid-term and a final project.

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.

The practice of programming. Emphasis is on the development of real programs, writing code but also assessing tradeoffs, choosing among design alternatives, debugging and testing, and improving performance. Issues include compatibility, robustness, and reliability, while meeting specifications. Students will have the opportunity to develop skills in these areas by working on their own code and in group projects. Two 90-minute lectures.

This course introduces algorithms for analyzing DNA, RNA, and protein, the three fundamental molecules in the cell. Students will learn algorithms on strings, trees, and graphs and their applications in: sequence comparison and alignment; molecular evolution and comparative genomics; DNA sequencing and assembly; recognition of genes and regulatory elements; and RNA structure and protein interaction networks. Students will also implement algorithms and apply them to biological data.

The principles underlying the generation and display of graphical pictures by computer. Hardware and software systems for graphics. Topics include: hidden surface and hidden line elimination, line drawing, shading, half-toning, user interfaces for graphical input, and graphic system organization.

Security issues in computing, communications, and electronic commerce. Goals and vulnerabilities; legal and ethical issues; basic cryptology; private and authenticated communication; electronic commerce; software security; viruses and other malicious code; operating system protection; trusted systems design; network security; firewalls; policy, administration and procedures; auditing; physical security; disaster recovery; reliability; content protection; privacy.

How do we create interactive technology centered around people and society at large? This course is a survey of the field of Human-Computer Interaction (HCI). Lectures, readings, and precept discussions cover foundational theories as well as topics in HCI. We focus on two core areas of interactive computing (e.g., input/output, ubiquitous computing) and social computing (e.g., collaboration, social media), and span a breadth of domains, such as AI+HCI, AR/VR, design tools, and accessibility. Put your learnings into practice, with a semester-long group project, by either studying how people think or by designing a novel technological system.

This course introduces computer science and technology-oriented students to issues tackled by Chief Technology Officers: the technical visionaries and managers innovating at the boundaries of technology and business. These individuals are partners to the business leaders of the organization, not merely implementers of business goals. The course covers companies from ideation and early-stage startup, to growth-stage startup, to mature company, covering the most relevant topics at each stage, including ideation, financing, product-market fit, go-to-market approaches, strategy, execution, and management. Exciting industry leaders guest lecture.

B.S.E candidates only

B.S.E. candidates only

Seniors are provided with an opportunity to concentrate on a 'state-of-the-art' project in computer science. Topics may be selected from suggestions by faculty members or proposed by the student. B.S.E. candidates only.

Seniors are provided with an opportunity to concentrate on a 'state-of-the-art' project in computer science. Topics may be selected from suggestions by faculty members or proposed by the student. B.S.E. candidates only.

Design and analysis of efficient data structures and algorithms. General techniques for building and analyzing algorithms. Introduction to NP-completeness.

An introduction to modern cryptography with an emphasis on fundamental ideas. The course will survey both the basic information and complexity-theoretic concepts as well as their (often surprising and counter-intuitive) applications.

Computation and other aspects of our lives are becoming increasingly intertwined. In this course we will study a variety of topics on the cusp between economics and computation. Topics to be covered include: games on networks, auctions, mechanism and market design, reputation, computational social choice. The aim of the course is two-fold: (1) to understand the game-theoretic issues behind systems involving computation such as online networks, and (2) to learn how algorithms and algorithmic thinking can help with designing better decision and allocation mechanisms in the offline world.

Studies the limits of computation by identifying tasks that are either inherently impossible to compute, or impossible to compute within the resources available. Introduces students to computability and decidability, Godel's incompleteness theorem, computational complexity, NP-completeness, and other notions of intractability. This course also surveys the status of the P versus NP question. Additional topics may include: interactive proofs, hardness of computing approximate solutions, cryptography, and quantum computation.

Vectors in the plane and in space, vector functions and motion, surfaces, coordinate systems, functions of two or three variables and their derivatives, maxima and minima and applications, double and triple integrals, vector fields, and Stokes's theorem.

Vector spaces, limits, derivatives of vector-valued functions, Taylor's formula, Lagrange multipliers, double and triple integrals, change of coordinates, surface and line integrals, generalizations of the fundamental theorem of calculus to higher dimensions. More abstract than 201 but more concrete than 216/218. Recommended for prospective physics majors and others with a strong interest in applied mathematics.

Continuation of Multivariable Analysis and Linear Algebra I (MAT 216) from the fall. A rigorous course in analysis with an emphasis on proof rather than applications. Topics include metric spaces, completeness, compactness, total derivatives, partial derivatives, inverse function theorem, implicit function theorem, Riemann integrals in several variables, Fubini.

Companion course to MAT201. Matrices, linear transformations, linear independence and dimension, bases and coordinates, determinants, orthogonal projection, least squares, eigenvectors and their applications to quadratic forms and dynamical systems.

Companion course to MAT203. Linear systems of equations, linear independence and dimension, linear transforms, determinants, (real and complex) eigenvectors and eigenvalues, orthogonality, spectral theorem, singular value decomposition, Jordan forms, other topics as time permits. More abstract than MAT202 but more concrete than MAT217. Recommended for prospective physics majors and others with a strong interest in applied mathematics.

A rigorous course in linear algebra with an emphasis on proof rather than applications. Topics include vector spaces, linear transformations, inner product spaces, determinants, eigenvalues, the Cayley-Hamilton theorem, Jordan form, the spectral theorem for normal transformations, bilinear and quadratic forms.

This course covers the basics of algebra with linear systems, vectors, matrices, matrix multiplication, systems of equations, matrix inversion, diagonalization, eigenvalues and eigenvectors, determinants, and some basic probability/Markov chains. These topics will be taught in the context of engineering problems that are centered around grand challenges facing society today, including information and security, bioengineering and health, structures and circuits, machine learning and the like.

An introductory course. Principles of chemistry; understanding the world around us; structure and reactions of atoms and molecules; laboratory manipulations, preparations, and analysis. Fulfills medical school entrance requirements in general chemistry and qualitative analysis.

Introduction to the basic concepts of chemistry: stoichiometry, types of reactions, thermodynamics, quantum mechanics, and chemical bonding. Introduction to the structure, chemistry, and properties of technologically important materials: metals, semiconductors, ceramics, and polymers. Fulfills medical school requirements in general chemistry and qualitative analysis.

The physical laws that govern the motion of objects, forces, and forms of energy in mechanical systems are studied at an introductory level. Calculus-based, primarily for engineering and science students, meets premedical requirements. Some preparation in physics and calculus is desirable; calculus may be taken concurrently. One demonstration lecture, three classes, one three-hour laboratory.

PHY105 is an advanced first year course in classical mechanics, taught at a more sophisticated level than PHY103. Care is taken to make the course mathematically self contained, and accessible to the motivated physics student who may not have had exposure to an introductory college level physics course. The approach of PHY105 is that of an upper-division physics course, with more emphasis on the underlying formal structure of physics than PHY103, including an introduction to modern variational methods (Lagrangian dynamics), with challenging problem sets due each week and a mini-course in Special Relativity held over reading period.

Continuation of 103. Electromagnetism from electrostatics, DC and AC circuits to optics, and topics of modern physics are treated at an introductory level. Some preparation in physics and calculus is desirable; calculus may be taken concurrently. Calculus-based, primarily for engineering and science students, meets premedical requirements. One demonstration lecture, three classes, one three-hour laboratory.

Parallels 104 at a more sophisticated level, emphasizing the unification of electric and magnetic forces and electromagnetic radiation. To enter this course, students must have done well in 103 or 105. 103 students must attend the lectures on special relativity given in reading period as part of 105. Three lectures, one class, one three-hour laboratory.