Course Schedule

Current semester Spring 2026, and future semesters are now available to view.

View undergraduate course grid View graduate course grid

Number

Name

Professor(s)

Meet Time

Room

CSCI-GA.2110-001
(7419) Programming Languages Cory Plock M 4:55-6:55PM CIWW 109

Course Description:

Discusses the design, use, and implementation of imperative, object-oriented, and functional programming languages. The topics covered include scoping, type systems, control structures, functions, modules, object orientation, exception handling, and concurrency. A variety of languages are studied, including C++, Java, Ada, Lisp, and ML, and concepts are reinforced by programming exercises.

Prerequisites: Students taking this class should already have substantial programming experience.
CSCI-GA.2130-001
(7422) Compiler Construction Sam Westrick M 10:15-12:15PM GCASL 388

Course Description:
This is a capstone course based on compilers and modern programming languages. The topics covered include structure of one-pass and multiple-pass compilers; symbol table management; lexical analysis; traditional and automated parsing techniques, including recursive descent and LR parsing; syntax-directed translation and semantic analysis; run-time storage management; intermediate code generation; introduction to optimization; and code generation. The course includes a special compiler-related capstone project, which ties together concepts of algorithms, theory (formal languages), programming languages, software engineering, computer architecture, and other subjects covered in the MS curriculum. This project requires a substantial semester-long programming effort, such as construction of a language compilation or translation system that includes lexical and syntactic analyzers, a type checker, and a code generator.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2250-001
(7423) Operating Systems Hubertus Franke M 2:45-4:45PM GCASL 383

Course Description:

The topics covered include the high-level design of key operating systems concepts such OS structures; process scheduling and synchronization; deadlocks and their prevention; memory management, including (demand) paging; and I/O and file systems. The concepts will be shown in the context of Unix/Linux. The learning is facilitated with labs that implement some of these key design principles and algorithms in C/C++.

Prerequisites: None
CSCI-GA.2262-001
(7425) Data Communications and Networks Jean-Claude Franchitti M 7:10-9:10PM 60 Fifth Ave 150

Course Description:

This course teaches the design and implementation techniques essential for engineering robust networks. Topics include networking principles, Transmission Control Protocol/Internet Protocol, naming and addressing (Domain Name System), data encoding/decoding techniques, link layer protocols, routing protocols, transport layer services, congestion control, quality of service, network services, programmable routers and overlay networks.

Prerequisites: Students must have a working knowledge of fundamental data structures and associated algorithms. For some of the practical aspects of the course, a working knowledge of an object-oriented programming language (e.g., C++, C#, or preferably Java) is expected. An undergraduate course in data communication and networks is helpful but not required.
CSCI-GA.2421-001
MATH-GA 2020-001
(12950) Numerical Methods II Michael O'Neil MW 11:00-12:15PM CIWW 1302

Course Description:

This course will cover fundamental methods that are essential for the numerical solution of differential equations. It is intended for students familiar with ODE and PDE and interested in numerical computing; computer programming assignments form an essential part of the course. The course will introduce students to numerical methods for (1) nonlinear equations, Newton's method; (2) ordinary differential equations, Runge-Kutta and multistep methods, convergence and stability; (3) finite difference, finite element and integral equation methods for elliptic partial differential equations; (4) fast solvers, multigrid methods; and (5) parabolic and hyperbolic partial differential equations.

Text: LeVeque, R. (2007). Classics in Applied Mathematics [Series]. Finite Difference Methods for Ordinary and Partial Differential Equations. Philadelphia, PA: Society for Industrial and Applied Mathematics

Prerequisites: Numerical linear algebra, elements of ODE and PDE.
CSCI-GA.2572-001
DS-GA.1008-001
(23239) Deep Learning Alfredo Canziani
Yann LeCun M 4:55-6:55PM 60 Fifth Ave 150

Course Description:

This course concerns the latest techniques in deep learning and representation learning, focusing on supervised and unsupervised deep learning, embedding methods, metric learning, convolutional net and recurrent nets, with applications to computer vision, natural language understanding, and speech recognition.

Prerequisites: DS-GA 1001 Intro to Data Science or a graduate-level machine learning course.
CSCI-GA.3033-099
DS-GA 3001-009
(23398) Special Topics in DS: Introduction to Computer Vision Jean Ponce M 7:10-9:10PM 19W4 102

Course Description:

This course aims to cover broad topics in computer vision, and is not primarily a deep learning course. We will cover topics in traditional computer vision such as camera geometry, image formation, segmentation, object recognition, classification, and detection.
CSCI-GA.3033-107
(7455) Special Topics: Cryptography of Blockchains Benedikt Bünz M 12:30-2:30PM 60 Fifth Ave C10

Course Description:

Blockchains are distributed systems that are secured using consensus protocols, game theoretic incentives and cryptographic primitives. This course is a deep dive into the different cryptography that is used in blockchains. We will dive into different basic and advanced cryptographic primitives such as signatures, accumulators and merkle trees, threshold cryptography, zero-knowledge proofs, and others and explore how they are applied in the blockchain field.

Prerequisites: Strong mathematical background, Introductory cryptography (CSCI-GA.3210-001) or similar. No knowledge of blockchains is required. The course is mostly self-contained. Contact instructor if unsure.
CSCI-GA.3033-132
MATH-GA.2011-001
(22484) Special Topics: Iterative Methods for Systems of Equations Florian Schaefer M 4:55-6:55PM CIWW 317

Course Description:

This class covers a wide range of iterative methods for solving linear and nonlinear systems of equations. Among the topics covered are fixed-point iterations, splitting methods, Krylov subspace methods, (multigrid) preconditioners, and Newton-type methods. The class will present the mathematical underpinnings of these methods and use them, together with numerical experimentation, to study their properties.

Prerequisites: Numerical Methods I is preferred.
CSCI-GA.3140-001
(7469) Abstract Interpretation Patrick Cousot M 4:55-6:55PM 60 Fifth Ave 202

Course Description:

Many numerical or symbolic problems are very hard or even undecidable meaning that no computer algorithm can solve them exactly in reasonable time and memory space. This course introduces the latest techniques in abstract interpretation, a powerful framework for automatically calculating approximate solutions of such difficult problems. The main emphasis will be on software verification and automatic analysis with a wide range of applications from compilers to social networks.

Prerequisites: Some facility with logic, sets, linear algebra, graphs, formal languages, mathematical proofs, and programming languages is expected.

*

Indicates controlled enrollment (permission number required for registration). Contact your program advisor.
**

Indicates controlled enrollment (permission number required for registration). Contact Santiago Pizzini (pizzini@cs.nyu.edu).
***

Indicates controlled enrollment (permission number required for registration). Contact the instructor.

Classroom Locations

Notice: This webpage is subject to change and will be revised and updated as necessary.