Course Schedule

Current semester Fall 2016, 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.1133-001
(1129) PAC I* Evan Korth
Office Hours T 6:30-9:00PM CIWW 201

Course Description:

An accelerated introduction to the fundamental concepts of computer science for students who lack a formal background in the field. Topics include algorithm design and program development; data types; control structures; subprograms and parameter passing; recursion; data structures; searching and sorting; dynamic storage allocation and pointers; abstract data types, such as stacks, queues, lists, and tree structures; generic packages; and an introduction to the principles of object-oriented programming. The primary programming language used in the course will be Java. Students should expect an average of 12-16 hours of programming and related course work per week.
CSCI-GA.1133-002
(1675) PAC I Recitation Jesse David Gumz W 7:10-8:00PM CIWW 201

Course Description:

An accelerated introduction to the fundamental concepts of computer science for students who lack a formal background in the field. Topics include algorithm design and program development; data types; control structures; subprograms and parameter passing; recursion; data structures; searching and sorting; dynamic storage allocation and pointers; abstract data types, such as stacks, queues, lists, and tree structures; generic packages; and an introduction to the principles of object-oriented programming. The primary programming language used in the course will be Java. Students should expect an average of 12-16 hours of programming and related course work per week.
CSCI-GA.1170-001
(1130) Fundamental Algorithms Alan Siegel
Office Hours T 5:10-7:00PM CIWW 109

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-002
(1131) Fundamental Algorithms Recitation Alan Siegel
Office Hours R 5:10-6:00PM CIWW 109

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-003
(23220) Fundamental Algorithms Yevgeniy Dodis
Office Hours W 5:10-7:00PM CIWW 517

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1170-004
(23221) Fundamental Algorithms Recitation Aleksandr Golovnev F 6:10-7:00PM CIWW 517

Course Description:

Reviews a number of important algorithms, with emphasis on correctness and efficiency. The topics covered include solution of recurrence equations, sorting algorithms, selection, binary search trees and balanced-tree strategies, tree traversal, partitioning, graphs, spanning trees, shortest paths, connectivity, depth-first and breadth-first search, dynamic programming, and divide-and-conquer techniques.

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
CSCI-GA.1180-001
(2132) Mathematical Techniques For CS Applications Margaret Wright
Office Hours M 5:10-7:00PM CIWW 512

Course Description:

An introduction to theory, computational techniques, and applications of linear algebra, probability and statistics. These three areas of continuous mathematics are critical in many parts of computer science, including machine learning, scientific computing, computer vision, computational biology, natural language processing, and computer graphics. The course teaches a specialized language for mathematical computation, such as Matlab, and discusses how the language can be used for computation and for graphical output. No prior knowledge of linear algebra, probability, or statistics is assumed.
CSCI-GA.2110-001
(1132) Programming Languages Benjamin Goldberg
Office Hours W 5:10-7:00PM 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.2110-002
(1133) Programming Languages Recitation Deepti Verma R 6:10-7:00PM 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.2110-003
(1916) Programming Languages Cory Plock
Office Hours M 5:10-7:00PM CIWW 201

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.2110-004
(1693) Programming Languages Recitation Daniel Wanghua Zhang F 5:10-6:00PM CIWW 517

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.2112-001
MATH-GA 2043-001
(1134) Scientific Computing Aaditya Rangan R 5:10-7:00PM CIWW 1302

Course Description:
Methods for numerical applications in the physical and biological sciences, engineering, and finance. Basic principles and algorithms; specific problems from various application areas; use of standard software packages.

Prerequisites: Multivariate calculus and linear algebra. Some programming experience recommended.
CSCI-GA.2130-001
(1135) Compiler Construction Eva Rose
Office Hours R 5:10-7:00PM CIWW 312

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.2180-001
(1918) Financial Software Projects Scott Burton
Office Hours M 7:10-9:00PM CIWW 512

Course Description:
The theme of this course is an "applied case study" and focuses on fixed income markets. Topics covered include an overview of the markets, the inner workings of an investment bank, the market players, and where software engineers fit in. Students will be grouped into small teams to build a financial application using practical software engineering principles. Each team will build a risk management framework, starting with basic components.

Prerequisites: It is assumed that the students can code in C++. No prior experience in the financial sector domain is required.
CSCI-GA.2246-001 Open Source Tools CANCELLED -

Course Description:
This course covers a brief history and philosophy of open source software, followed by an in-depth look at open source tools intended for developers. In particular, we will present an overview of the Linux operating system, command line tools (find, grep, sed), programming tools (GIT, Eclipse, DTrace), web and database tools (Apache, MySQL), and system administration tools. We will also cover scripting languages such as shell and Python.

Prerequisites: An understanding of modern operating systems and a working knowledge of a programming language, such as C, C++ or Java
CSCI-GA.2250-001
(1136) Operating Systems Hubertus Franke
Office Hours M 7:10-9:00PM CIWW 1302

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
(1710) Data Communications and Networks Jean-Claude Franchitti
Office Hours R 7:10-9:00PM CIWW 312

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.2270-001
(2055) Computer Graphics Daniele Panozzo
Office Hours M 7:10-9:00PM CIWW 312

Course Description:

Problems and objectives of computer graphics. Vector, curve, and character generation. Interactive display devices. Construction of hierarchical image list. Graphic data structures and graphics languages. Hidden-line problems; windowing, shading, and perspective projection. Curved surface generation display.

Prerequisites: CSCI-GA 1170 and CSCI-UA 140 (or an equivalent undergraduate course in linear algebra).
CSCI-GA.2271-001
(1920) Computer Vision Rob Fergus
Office Hours R 7:10-9:00PM CIWW 1302

Course Description:

Basic techniques of computer vision and image processing. General algorithms for image understanding problems. Study of binary image processing, edge detection, feature extraction, motion estimation, color processing, stereo vision, and elementary object recognition. Mathematical, signal processing, and image processing tools. Relation of computer vision algorithms to the human visual system.

Prerequisites: CSCI-GA 1170
CSCI-GA.2274-001
(18035) Advanced Computer Graphics Kenneth Perlin T 7:10-9:00PM 719BWY 1221

Course Description:

This is a capstone course based on computer graphics tools. The course covers a selection of topics that may include computer animation, gaming, geometric modeling, motion capture, computational photography, physically based simulation, scientific visualization, and user interfaces. Not all areas are available every semester; the choice of areas is determined by the instructor. The capstone project involves some or all of the following elements: formation of a small team, project proposal, literature review, interim report, project presentation, and final report.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, CSCI-GA 2250 and CSCI-GA 2270
CSCI-GA.2390-001
(18036) Logic In Computer Science CANCELLED -

Course Description:

Introduction to formal logic: mathematical and computational issues. Topics to be covered include: Propositional logic: Foundations. Axiomatization. Completeness of propositional resolution. Davis-Putnam algorithm. SAT-solving technology.

First-order logic: Axiomatization. Tarskian semantics. First-order resolution. Completeness of resolution. Semi-decidability of inference. First-order logic with equality. Sorted first-order logic. Horn-clause inference.

Modal logic. Dynamic logic. Applications of temporal logics to program language semantics and program verification. Possible-world (Kripkean) semantics. Axiomatizations of propositional modal logics and their completeness proofs.

History of modern (1840-present) formal logic and formalized mathematical proof.

Prerequisites:
Fundamental Algorithms or equivalent.
CSCI-GA.2420-001
MATH-GA 2010-001
(1137) Numerical Methods I Georg Stadler
Office Hours R 5:10-7:00PM CIWW 101

Course Description:
Numerical linear algebra. Approximation theory. Quadrature rules and numerical integration. Nonlinear equations and optimization. Ordinary differential equations. Elliptic equations. Iterative methods for large, sparse systems. Parabolic and hyperbolic equations.

Prerequisites: Corequisite: linear algebra.
CSCI-GA.2433-001
(1705) Database Systems Zvi Kedem
Office Hours T 7:10-9:00PM CIWW 109

Course Description:
Database system architecture. Modeling an application and logical database design. The relational model and relational data definition and data manipulation languages. Design of relational databases and normalization theory. Physical database design. Concurrency and recovery. Query processing and optimization.
CSCI-GA.2434-001
(1138) Advanced Database Systems Dennis Shasha
Office Hours T 5:10-7:00PM CIWW 101

Course Description:
This is a capstone course emphasizing large-scale database systems. This course studies the internals of database systems as an introduction to research and as a basis for rational performance tuning. Topics include concurrency control, fault tolerance, operating system interactions, query processing, and principles of tuning. Database capstone projects involve topics such as design, concurrency control, interactions, and tuning. These projects include some or all of the following elements: formation of a small team, project proposal, literature review, interim report, project presentation, and final report.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2560-001
(2053) Artificial Intelligence Ernest Davis
Office Hours R 5:10-7:00PM CIWW 202

Course Description:

There are many cognitive tasks that people do easily and almost unconsciously but that have proven extremely difficult to program on a computer. Artificial intelligence is the problem of developing computer systems that can carry out these tasks. This course covers problem solving and state space search; automated reasoning; probabilistic reasoning; planning; and knowledge representation.
CSCI-GA.2566-001
(1921) Foundations Of Machine Learning Mehryar Mohri
Office Hours T 5:10-7:00PM CIWW 102

Course Description:

This course introduces the fundamental concepts and methods of machine learning, including the description and analysis of several modern algorithms, their theoretical basis, and the illustration of their applications. Many of the algorithms described have been successfully used in text and speech processing, bioinformatics, and other areas in real-world products and services. The main topics covered are probability and general bounds; PAC model; VC dimension; perceptron, Winnow; support vector machines (SVMs); kernel methods; decision trees; boosting; regression problems and algorithms; ranking problems and algorithms; halving algorithm, weighted majority algorithm, mistake bounds; learning automata, Angluin-type algorithms; and reinforcement learning, Markov decision processes (MDPs).

Prerequisites: CSCI-GA 1180.
CSCI-GA.2569-001
DS-GA.1005-001
(23251) Inference and Representation David Sontag
Office Hours
Joan Bruna M 5:10-7:00PM CIWW 1302

Course Description:

This course covers graphical models, causal inference, and advanced topics in statistical machine learning.

Prerequisites: DS-GA 1004
CSCI-GA.2569-002
DS-GA.1005-002
(23252) Inference and Representation Lab Rahul Gopalkrishnan W 7:10-8:00PM 194M 306

Course Description:

This course covers graphical models, causal inference, and advanced topics in statistical machine learning.

Prerequisites: DS-GA 1004
CSCI-GA.2580-001
(18037) Web Search Engines Cong Yu
Office Hours
Fernando Diaz M 5:10-7:00PM CIWW 312

Course Description:

Discusses the design of general and specialized Web search engines and the extraction of information from the results of Web search engines. Topics include Web crawlers, database design, query language, relevance ranking, document similarity and clustering, the “invisible” Web, specialized search engines, evaluation, natural language processing, data mining applied to the Web, and multimedia retrieval.

Prerequisites: Recommend CSCI-GA 1180.
CSCI-GA.2930-002
MATH-GA 2830-002
(2347) Advanced Topics in Applied Math: Mathematics of Data Science Afonso Bandeira
Office Hours W 11:00-12:50PM CIWW 1302

Course Description:

A mostly self-contained research-oriented and fast-paced course designed for PhD students with an interest in doing research in theoretical aspects of algorithms that aim to extract information from data. These often lie in overlaps of (Applied) Mathematics with: Computer Science, Electrical Engineering, Statistics, and/or Operations Research. Each lecture will feature either one or two Mathematical Open Problem(s) with relevance in Data Science. The main mathematical tools used will be Probability and Linear Algebra, and a basic familiarity with these subjects is required. There will also be some (although knowledge of these tools is not assumed) Graph Theory, Representation Theory, Applied Harmonic Analysis, among others. The topics treated will include Dimension reduction, Manifold learning, Sparse recovery, Random Matrices, Approximation Algorithms, Community detection in graphs, and several others.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-001
MATH-GA.2011-001
(1139) Adv Topics Num. Analysis: Approximation Computational Fluid Dynamics Aleksandar Donev
Office Hours R 9:00-10:50AM CIWW 512

Course Description:
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-002
MATH-GA.2011-002
(21432) Adv Topics Num. Analysis: Numerical Optimization Margaret Wright
Office Hours T 5:10-7:00PM CIWW 202

Course Description:
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-003
MATH-GA.2011-003
(21433) Adv Topics Num. Analysis: Exploring ODEs Lloyd N. Trefethen TR 1:25-3:15PM CIWW 1302

Course Description:

The course is intended for Courant Institute graduate students who are either mathematics students on the applied half of the spectrum or computer science students with an interest in numerical computation. ODEs, the starting point of analysis and dynamics, are one of the two foundation stones of applied mathematics (the other is linear algebra). This course will deepen your appreciation of them fundamentally.

This course will be based on a new textbook that I am 2/3 of the way through writing, Exploring ODEs, with coauthors Toby Driscoll and Asgeir Birkisson. The book aims to be interesting and informative for every applied or numerical mathematician. Its unusual missions are to be numerically-enabled, but not a numerical book and mathematically mature, but not technically advanced. To get an idea, including the table of contents, take a look at the talk I gave about the book project posted here.

The course will be assessed by homework assignments. These will be computational (working in Chebfun), but will be about behavior of ODEs, not about algorithms or numerical analysis.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-004
MATH-GA.2011-004
(21434) Adv Topics Num. Analysis: Finite Elements Olof Widlund
Office Hours T 9:00-10:50AM CIWW 512

Course Description:

This course will provide an introduction to the finite element method and its theoretical foundation.

Self-adjoint elliptic problem and calculus of variation. Sobolev spaces, Poincare's and Friedrichs' inequalities. Triangulations of bounded domains in two and three dimensions. Lagrange and Hermite finite elements, which are conforming in H^1. The biharmonic problem and H^2 conforming elements.

Error bounds for basic finite element methods: Cea's lemma and the result of Aubin and Nitsche. Nonconforming finite elements: the lemmas due to Strang. Isoparametric elements and spectral elements. Compressible and almost incompressible elasticity. Mixed methods and the inf-sup condition due to Babuska and Brezzi. Incompressible Stokes. Raviart-Thomas elements and other elements conforming in H(div). Nedelec elements and other conforming elements in H(curl). Solving the large linear and non-linear systems of algebraic equations resulting from finite element approximations. An introduction to domain decomposition and multigrid algorithms.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2965-001
(1140) Heuristic Problem Solving Dennis Shasha
Office Hours T 7:10-9:00PM CIWW 101

Course Description:
This course revolves around several problems new to computer science (derived from games or puzzles in columns for Dr. Dobb’s Journal, Scientific American, and elsewhere). The idea is to train students to face a new problem, read relevant literature, and come up with a solution. The solution entails winning a contest against other solutions. The winner receives candy. The best solutions become part of an evolving “Omniheurist” Web site that is expected to get many visitors over the years. The course is for highly motivated, mathematically adept students. It is open to supported Ph.D. students and well-qualified master’s students. Class size has been around 10 in the past, and instructor and students have all gotten to know one another very well. Algorithmic and programming knowledge is the main prerequisite. It also helps to be familiar with a rapid prototyping language such as Matlab, Mathematica, K, or Python, or to be completely fluent in some other language.

Prerequisites: CSCI-GA 1170 and an ability to prototype algorithms rapidly.
CSCI-GA.3033-001
(1141) Special Topics: Production Quality Software Michael Schidlowsky
Office Hours W 5:10-7:00PM CIWW 317

Course Description:

In this course we study the craft of software engineering. The semester begins with a thorough review of the Java Language and Virtual Machine, emphasizing library components and language features most relevant to most development projects. Later lectures cover more sophisticated features in the language like concurrency and thread-safety, writing tests, properly designing classes and Object-Oriented programs, and design patterns. Certain non-technical topics are critical to successful software development and are reinforced throughout the semester. These include writing readable code, the long-term consequences of bugs, the psychology of human motivation, successfully developing and reinforcing habits, what science knows about human productivity and drive, and how to motivate ourselves and our team. Lessons are reinforced with weekly assignments that are meticulously graded. Some submissions are critiqued, line-by-line, in classroom code reviews. The end of the semester includes a lecture on how to best prepare for interviews and write an effective resume, incorporating techniques from world-class athletes and performers on how to optimally perform under extreme stress.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-002
(1142) Special Topics: Distributed Systems Jinyang Li
Office Hours W 7:10-9:00PM CIWW 317

Course Description:

Distributed systems help programmers aggregate the resource of many networked computers to construct highly available and scalable services, such as peta-byte storage, massively parallel computation. This class teaches the abstractions, design and implementation techniques that allow you to build fast, scalable, fault-tolerant distributed systems. Topics include concurrency and consistency, fault tolerance, distributed transactions, and several case studies of distributed systems. This class is a graduate-level course, but advanced undergraduate students are welcome! The course consists of lectures and a series of programming labs.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-003
(1143) Special Topics: Music Software Projects Scott Burton
Office Hours F 4:00-5:50PM CIWW 312

Course Description:

Did you ever wonder why there are 12 notes in the western music scale? Or how the intervals between notes came to be? When were the first musical scales developed or "discovered" and how (and why) have they been modified since? Who were the key innovators of western music theory over the last few centuries?

It is not uncommon for software developers to have an affinity for music. After all, the creation of both software and music is part art and part science. Further, music and computing are built upon fundamental mathematical principles. While it is not required to understand music theory to be a good player, understanding why we are constrained to a certain set of notes is an enlightening topic - for musicians and non-musicians alike.

This course is for students interested in both music and software construction!

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-004
(1144) Special Topics: Graphics Processing Units (GPUs): Architecture & Programming Mohamed Zahran
Office Hours T 5:10-7:00PM CIWW 317

Course Description:

In this course, we will cover architectural aspects and capabilities of modern GPUs (graphics processing unit) and will learn the architecture and the programming of GPUs to solve different type of problems. Many computations can be performed much faster on the GPU than on a traditional processor. This is why GPUs are present now in almost all computers; and the majority of Top 500 supercomputers in the world are built around GPUs. GPUs are no longer restricted to graphics applications but are now used for a diverse set of applications and domains. This introduces the concept of general-purpose GPUs or GPGPUs, which is the main subject of this course.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-005
(1145) Special Topics: Principles of Software Security Patrick Cousot
Office Hours M 7:10-9:00PM CIWW 201

Course Description:

Traditionally, computer security is enforced by the operating system, which uses special hardware support to ensure security properties at application boundaries. However, the proliferation of successful attacks, such as viruses, worms, SQL injection, and cross-site scripting, shows that traditional approaches to security are insufficient. Adversaries exploit weaknesses both in the operating system itself, bypassing any protection mechanisms, and more and more frequently at the application level, where the operating system provides very limited guarantees. In this class we consider how programming language techniques can be used to fill the security gap by defending against application-level attacks. The approach is based on the static analysis of the program source to certify security properties.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-006
(1146) Special Topics: Realtime and Big Data Analytics Suzanne McIntosh
Office Hours R 7:10-9:00PM CIWW 102

Course Description:

This course will introduce technologies at the foundation of the Big Data movement that have facilitated scalable management of vast quantities of data collected through realtime and near realtime sensing. We will also explore the tools enabling the acquisition of near realtime data in the social domain, the fusion of those data when in flight and at rest, and their meaningful representation in graphical visualizations. Students are required to complete weekly reading and/or programming assignments and demonstrate mastery of course topics by developing and demonstrating a software project of their choosing. Class time will be set aside for project proposal and final demo.

Prerequisites: CSCI-GA 2250 or equivalent Operating Systems course; programming experience in C/C++ or Java for assignments and final project; CSCI-GA 2262, CSCI-GA 2620, or undergraduate course in networks. A familiarity with databases and Linux will be useful.
CSCI-GA.3033-007
(1147) Special Topics: Social Multiplayer Games Yoav Zibin
Office Hours R 5:10-7:00PM CIWW 517

Course Description:

The course will teach how to develop online casual multiplayer games using open technologies such as HTML5, JavaScript, Typescript, AngularJS, Ionic, Bootstrap, PhoneGap, Grunt, and testing using Karma, Jasmine, Protractor. Students will build several turn based games and submit them to Google play store. There is no final exam, only assignments. The course will also teach about artificial-intelligence for games, ranking systems, physics-based engines, and integrating with social platforms. The course will not concern with 3D graphics.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-008
(2057) Special Topics: Statistical Natural Language Processing Slav Petrov
Office Hours T 5:10-7:00PM CIWW 512

Course Description:

In this course we will examine some of the core tasks in natural language processing, starting with simple word-based models for text classification and building up to rich, structured models for syntactic parsing and machine translation. In each case we will discuss recent research progress in the area and how to design efficient systems for practical user applications. There will be a focus on corpus-driven methods that make use of supervised and unsupervised machine learning methods and algorithms. We will explore statistical approaches based on graphical models and neural networks. In the course assignments, which will be updated this year to include more neural network modeling, you will construct basic systems and then improve them through a cycle of error analysis and model redesign. This course assumes a good background in basic probability and a strong ability and interest in building real systems. The class is open to graduate as well as undergraduate students.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-011
(2337) Special Topics: Predictive Analytics Anasse Bari
Office Hours W 7:10-9:00PM CIWW 102

Course Description:

Predictive analytics is the art and science of extracting useful information from historical data and present data for the purpose of predicting future trends. In this course, students will have an introduction to the phases of the analytics lifecycle and a basic understanding of a variety of tools and machine learning techniques to analyze data to discover forward insights. Several techniques will be introduced; including data pre-processing techniques, data clustering algorithms, data classification algorithms, association rules data mining algorithms, recommender systems, etc.

Applications from bio-informatics, social networks analytics, and text mining will be covered. Highlights from industrial use cases will be covered to demonstrate how Predictive Analytics relates to improving business performance and impacting better decisions. This is an introductory course that will provide students with basic skills of the new generation of data scientists that will allow them to structure, analyze and derive useful insights from data that could help make better decisions.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-012
(2335) Special Topics: Advanced Computer Vision Davi Geiger R 5:10-7:00PM CIWW 201

Course Description:

This is a hands-on course that goes over some basic aspects of computer vision and selected topics which students develop their own algorithms for. The topics that will be covered are feature representation and detection (wavelets), stereo vision (matching), symmetry, and recognition (learning). There is a final project where students present a computer vision system. Basic knowledge of linear algebra and algorithms is required.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-014
(18098) Special Topics: DevOps John Rofrano
Office Hours
Nikolai Joukov
Harigovind Ramasamy W 5:10-7:00PM CIWW 512

Course Description:

DevOps is more than just a fusion of development and operations. It is the cultural change that embraces Agile methodology, Social Coding, Test Drive Development, new tools to provide Continuous Integration, Testing, and Delivery, and a fundamental shift in what it means to “move into production”. Developers are empowered to “fail fast” and deploy early and often. Cloud Computing is at the heart of this movement. Cloud Native applications built from microservices require DevOps to manage the often complex production pipeline. DevOps allows businesses to move with increased agility and stability.

Upon completing this course students will be able to work as an Agile team and setup a DevOps pipeline to continuously integrate their code changes and deploy Cloud Native applications that they write. They will also gain an understanding of what it means for Enterprise IT to use DevOps to become Cloud Native and operate at scale. Topics covered will include: Social Coding, Creating RESTful Microservices, IBM Bluemix. Watson Services, Docker, Cloud Foundry, GitHub, ZenHub, Travis CI, Jenkins, Vagrant, Test Drive Development, Python Flask, Node.js, Redis, Cloudant, Ansible, Chef, Puppet. Students will be given access to IBM Bluemix and Watson Services for the duration of the course and will be deploying their homework there. This course is 50% lecture and 50% hand-on so come prepared to learn by doing.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-015
(18099) Special Topics: Rapid Prototyping, Lean Engineering & Agile Development Evan Korth
Office Hours W 7:10-9:00PM CIWW 202

Course Description:

Agile software development is a group of software development methods in which requirements and solutions evolve through collaboration between self-organizing, cross-functional teams. In this class, students learn agile practices in software product development, and build up a new leadership toolbox for driving innovation and change, and improve their ability to lead high-performing teams and organizations. Based on iterative and incremental development, students learn adaptive planning, evolutionary development and delivery, a time-boxed iterative approach, encouraging rapid and flexible response to change. Student teams will work on software projects proposed by members of the class.

Prerequisites: CSCI-GA 2110 Programming Languages
CSCI-GA.3033-016
(24637) Special Topics: Foundations of Networking and Mobile Systems Lakshminarayanan Subramanian T 7:10-9:00PM CIWW 517

Course Description:

This is an introductory course that would expose students to the fundamentals of computer networks and mobile systems. This class has no specific prerequisites. The class will begin with introductory concepts of network protocols across different layers of the network stack including routing, transport, naming, addressing and connect them to the core building blocks of the Internet. The second part of the class will focus on networking concepts in the evolution of Web-based systems, providing an introduction to data-center networks, clouds, middle boxes (proxies, firewalls) and next-generation networks. The third part of the class will focus on the fundamental concepts in wireless networks, cellular networks and mobile devices with a specific focus on mobile programming and applications, 802.11 evolution, mobile services and the evolution of cellular networks. The final part of the class will focus on current and trending developments in networks and mobile systems.

Students who have taken CSCI-GA 2620 Networks and Mobile Systems or Networks and Distributed Systems are not eligible to take this course for credit.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-017
(25139) Special Topics: Multicore Programming Christopher Mitchell
Office Hours R 7:10-9:00PM CIWW 512

Course Description:

Through the 1990s, processors got faster and faster, but around the turn of the millennium, CPUs started to reach physical limits. To drive innovation and produce more powerful computers, manufacturers began to pack multiple cores into each processor. However, most software is conceived by the programmer as a linear progression of instructions. Compilers can find some parallelization opportunities, but that’s not enough to take full advantage of multiple cores. Programmers must take much of the responsibility for making their programs exploit multiple cores, and this course discusses many modern techniques:

- aspects of the architecture of modern machines
- Classic and modern algorithms for coordination and synchronization
- Data structures that exploit and extract performance from multiple cores
- Current and future programming techniques and best practices for multiple cores

Students will be expected to have experience with a programming-intensive course, as well as some experience with C/C++. The course will include lectures, homework, labs, a final project, and a final exam.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3205-001
(2054) Applied Cryptography & Network Security Zvi Kedem
Office Hours W 5:10-7:00PM CIWW 101

Course Description:
This course first introduces the fundamental mathematical cryptographic algorithms, focusing on those that are used in current systems. To the extent feasible, the mathematical properties of the cryptographic algorithms are justified, using elementary mathematical tools. Second, actual security mechanisms and protocols, mainly those employed for network traffic that rely on the previously introduced cryptographic algorithms, are presented. The topics covered include introduction to basic number-theoretical properties, public/private and symmetric key systems, secure hash functions, digital signature standards, digital certificates, IP security, e-mail security, Web security, and stand-alone computer privacy and security tools.
CSCI-GA.3210-001
MATH-GA 2170-001
(1728) Introduction To Cryptography Oded Regev
Office Hours M 11:00-12:50PM CIWW 517

Course Description:
The primary focus of this course is on definitions and constructions of various cryptographic objects, such as pseudorandom generators, encryption schemes, digital signature schemes, message authentication codes, block ciphers, and others, time permitting. The class tries to understand what security properties are desirable in such objects, how to properly define these properties, and how to design objects that satisfy them. Once a good definition is established for a particular object, the emphasis will be on constructing examples that provably satisfy the definition. Thus, a main prerequisite of this course is mathematical maturity and a certain comfort level with proofs. Secondary topics, covered only briefly, are current cryptographic practice and the history of cryptography and cryptanalysis.

Prerequisites: Strong mathematical background
CSCI-GA.3250-001 Honors Operating Systems CANCELLED -

Course Description:
Operating-system structure. Processes. Process synchronization. Language mechanisms for concurrency. Deadlocks: modeling, prevention, avoidance, and recovery. Memory management. File-system interface. Secondary storage. Distributed systems: layered system design, managing distributed processes, distributed shared memory, fault-tolerance. CPU scheduling. Queuing and performance: analysis of single M/M/1 queue and others. Protection and security. Advanced security concepts: threat monitoring, encryption, and public keys.

Prerequisites: Permission of the instructor for master’s students
CSCI-GA.3520-001
(1148) Honors Analysis of Algorithms Subhash Khot
Office Hours TR 9:30-10:45AM CIWW 317

Course Description:
Design of algorithms and data structures. Review of searching, sorting, and fundamental graph algorithms. In-depth analysis of algorithmic complexity, including advanced topics on recurrence equations and NP-complete problems. Advanced topics on lower bounds, randomized algorithms, amortized algorithms, and data structure design as applied to union-find, pattern matching, polynomial arithmetic, network flow, and matching.

Prerequisites: Permission of the instructor for master’s students.
CSCI-GA.3812-001
(1149) Information Technology Projects * Jean-Claude Franchitti
Office Hours M 6:10-9:10PM CIWW 317

Course Description:

This is a capstone course that connects students directly with real-world information technology problems. The goal of this course is to teach the skills needed for success in real-world information technology via a combination of classroom lectures and practical experience with large projects that have been specified by local “clients.” The typical clients are primarily companies, but can also be government agencies or nonprofit organizations. Each project lasts for the entire semester and is designed to involve the full software project life cycle. Examples of such projects are development of software to solve a business problem, including specifying requirements, writing and testing prototype code, and writing a final report; and evaluation of commercial software to be purchased to address a business problem, including gathering requirements, designing an architecture to connect the new software with existing systems, and assessing the suitability of available software products.

Prerequisites: For MS in IS students: Successful completion of CSCI-GA 1170 Fundamental Algorithms and two of the following three courses: CSCI-GA 2262 Data Communications & Networks; CSCI-GA 2250 Operating Systems; CSCI-GA 2433 Database Systems. For MS in CS students: Successful completion of CSCI-GA 1170 Fundamental Algorithms, CSCI-GA 2110 Programming Languages, and CSCI-GA 2250 Operating Systems. PERMISSION OF THE DEPARTMENT REQUIRED.
CSCI-GA.3813-002
(1151) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-003
(1152) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-004
(1153) Adv Lab MS * STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-005
(1154) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-006
(1155) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-007
(1156) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3813-008
(1157) Adv Lab PhD ** STAFF -

Course Description:

Large-scale programming project or research in cooperation with a faculty member.

Prerequisites: Permission of the faculty project supervisor and the Director of Graduate Studies.
CSCI-GA.3840-001
(1158) Master's Thesis Research * STAFF -

Course Description:

Prerequisites: Approval of a faculty adviser and the Director of Graduate Studies for the M.S. programs.
CSCI-GA.3850-001
(1159) PhD Seminar: Cryptography** Yevgeniy Dodis
Office Hours T 12:30-3:15PM CIWW 412

Course Description:
Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.

Prerequisites: Permission of the instructor.
CSCI-GA.3850-004
(1160) PhD Seminar: Formal Methods** Thomas Wies
Office Hours W 11:00-12:30PM CIWW 412

Course Description:
Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.

Prerequisites: Permission of the instructor.
CSCI-GA.3850-006
(1924) PhD Seminar: Machine Learning** Mehryar Mohri
Office Hours T 3:45-5:00PM CIWW 1302

Course Description:
Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.

Prerequisites: Permission of the instructor.
CSCI-GA.3860-001
(1161) PhD Thesis Research ** STAFF -

Course Description:

Prerequisites: Permission of the thesis adviser or director of graduate studies for the Ph.D. program.
CSCI-GA.3870-001
(19709) Internship In Computer Science MS* Faculty -

Course Description:

Participation in a programming project or research project conducted outside of the classroom in a governmental, commercial, or academic setting. Open only to graduate students with permission of the Director of Graduate Studies (DGS). Students must submit a brief written description of their work to the DGS before starting the internship and submit a written summary of their work when it is completed. MS students may take this course a maximum of two times. PhD students who wish to take this course more than four times need to request a special permission and provide adequate academic justification.

Section 1 is for Master's students. Section 2 is for Ph.D. students.

Prerequisites: Permission of Director of Graduate Studies.
CSCI-GA.3870-002
(19710) Internship in Computer Science PhD* Faculty -

Course Description:

Participation in a programming project or research project conducted outside of the classroom in a governmental, commercial, or academic setting. Open only to graduate students with permission of the Director of Graduate Studies (DGS). Students must submit a brief written description of their work to the DGS before starting the internship and submit a written summary of their work when it is completed. MS students may take this course a maximum of two times. PhD students who wish to take this course more than four times need to request a special permission and provide adequate academic justification.

Section 1 is for Master's students. Section 2 is for Ph.D. students.

Prerequisites: Permission of Director of Graduate Studies.

*

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.