Course Schedule

Current semester Fall 2022, 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.1170-001
DS-GA.1170-001
(2459) Fundamental Algorithms Chee Yap T 4:55-6:55PM 12WV G08

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
DS-GA.1170-002
(2460) Fundamental Algorithms Recitation Daniel Feldan R 5:55-6:45PM Cant 102 Additional information: Recitation for Section 001

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
DS-GA.1170-001
(3033) Fundamental Algorithms Richard Cole W 4:55-6:55PM CIWW 109

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
DS-GA.1170-002
(3034) Fundamental Algorithms Recitation Zachary DeStefano F 4:55-5:45PM 60 Fifth Ave 150 Additional information: Recitation for Section 003

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-005
DS-GA.1170-002
(3326) Fundamental Algorithms Recitation Zeming Lin R 5:55-6:45PM Online Additional information: Recitation for Section 001

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-007
DS-GA.1170-002
(3668) Fundamental Algorithms Recitation Nick Lourie F 4:55-5:45PM Online Additional information: Recitation for Section 003

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
(3109) Mathematical Techniques For CS Applications Parijat Dube M 7:10-9:10PM CIWW 102

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
(2461) Programming Languages Cory Plock M 4:55-6:55PM Meyr 122

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
(2462) Programming Languages Recitation Yashaswi Shah R 4:55-5:45PM Silv 405 Additional information: Recitation for Section 001

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
(2928) Programming Languages Thomas Wies T 4:55-6:55PM Silv 408

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-005
(3667) Programming Languages Recitation Elaine Li F 5:55-6:45PM 60 Fifth Ave 150 Additional information: Recitation for Section 003

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-006
(3327) Programming Languages Recitation Jahnvi Arya R 4:55-5:45PM Online Additional information: Recitation for Section 001

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-007
(3328) Programming Languages Recitation Nisarg Patel F 5:55-6:45PM Online Additional information: Recitation for Section 003

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
(2463) Scientific Computing Jonathan Goodman R 5:10-7:00PM CIWW 1302
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.2250-001
(2464) Operating Systems Hubertus Franke M 7:10-9:10PM Silv 411
The topics covered include a review of linkers and loaders and the high-level design of key operating systems concepts such as process scheduling and synchronization; deadlocks and their prevention; memory management, including (demand) paging and segmentation; and I/O and file systems, with examples from Unix/Linux and Windows. Programming assignments may require C, C++, Java, or C#.
CSCI-GA.2262-001
(2848) Data Communications and Networks Jean-Claude Franchitti R 7:10-9:10PM Silv 208

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
(2966) Computer Graphics Gizem Kayar W 7:10-9:10PM Silv 520

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
(2929) Computer Vision Rob Fergus R 7:10-9:10PM 19UP 102

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.2420-001
MATH-GA 2010-001
(2465) Numerical Methods I Benjamin Peherstorfer M 5:10-7:00PM CIWW 101
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
DS-GA.2433-001
(2845) Database Systems Jean-Claude Franchitti R 4:55-6:55PM Silv 408
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
(2466) Advanced Database Systems Dennis Shasha R 4:55-6:55PM CIWW 109
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.2436-001
(3263) Realtime and Big Data Analytics Yang Tang W 7:10-9:10PM CIWW 102

This course introduces architectures and technologies at the foundation of the Big Data movement. These technologies facilitate scalable management and processing of vast quantities of data collected through realtime and near realtime sensing. We explore tools enabling the acquisition of data in the social domain and the fusion of those data when in flight and at rest using Hadoop and Hadoop-related tools.

The material covered in this course aligns with the prevailing state of the art in Big Data technologies, which continues to be a rapidly evolving landscape as new technologies emerge and existing ones evolve and mature.

Students are required to complete weekly reading and/or programming assignments and demonstrate mastery of course topics by designing, developing, and demonstrating an analytics project of their choosing. Class time will be set aside for project proposal and final demo.

This is an introductory Hadoop course intended for students who have no experience with the Apache Hadoop ecosystem of tools and frameworks.
CSCI-GA.2437-001
(23021) Big Data Application Development Yang Tang M 7:10-9:10PM CIWW 109

This is an introductory course on Spark programming, Spark architecture, Spark SQL, Spark Streaming, and integration of Spark with the Hadoop ecosystem for developing Big Data analytics applications. The course project can be completed with Scala or Python, and Spark. This course covers technologies that integrate well with Spark in the creation of Big Data analytics applications.

Students are required to complete weekly reading and programming assignments and demonstrate mastery of course topics by developing a final project using Spark.

Prerequisites: Prerequisites include experience with Hadoop, which commonly comes from having completed the Realtime and Big Data Analytics course. There will be a review of Apache Hadoop, but students should have experience with Hadoop MapReduce and HDFS.
CSCI-GA.2560-001
(3612) Artificial Intelligence Paul Bethe M 4:55-6:55PM Bobst LL150

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.2565-001
(23114) Machine Learning Rajesh Ranganath T 4:55-6:55PM CIWW 102

This course covers a wide variety of topics in machine learning, pattern recognition, statistical modeling, and neural computation. The course covers the mathematical methods and theoretical aspects but primarily focuses on algorithmic and practical issues.

Prerequisites: Undergraduate course in linear algebra and strong programming skills for implementation of algorithms studied in class. Strong knowledge of probability. Recommended: knowledge of vector calculus, elementary statistics.
CSCI-GA.2566-001
(23115) Foundations Of Machine Learning* CANCELLED -

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
(23934) Inference and Representation Joan Bruna R 12:00-1:40PM 60 Fifth Ave 150

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
(23935) Inference and Representation Lab Lei Chen M 11:15-12:05PM 60 Fifth Ave 150

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

Prerequisites: DS-GA 1004
CSCI-GA.2572-001
(24859) Deep Learning Alfredo Canziani W 4:55-6:55PM Online

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.2572-002
(24922) Deep Learning Lab Alfredo Canziani R 4:55-5:45PM Online

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.2590-001
(3288) Natural Language Processing Adam Meyers W 10:15-12:15PM Online

Natural Language Processing applies computational and linguistic knowledge to the processing of natural languages (English, Chinese, Spanish, Japanese). Applications include: machine translation, information extraction, information retrieval, and others. On the one hand, the class will include the modeling and representation of linguistic phenomena. On the other, It will cover methods for applying this knowledge using both manual rules and machine learning. Sample topics include: formal languages, hmm, part of speech tagging, vector-based methods, shallow and full parsing, semantic role labeling, information extraction and machine translation. Students will complete shared tasks (POS-tagging, Information Extraction, etc.) and group final projects. There will also be a midterm exam and several small written assignments.

Prerequisites: Some facility with Java and Python and a knowledge of the elements of probability and statistics is expected.

Prerequisites: Some facility with Java and Python and a knowledge of the elements of probability and statistics is expected.
CSCI-GA.2621-001
(3169) Distributed Systems Aurojit Panda W 4:55-6:55PM 60 Fifth Ave 150

Large-scale distributed systems lie at the core of application domains such as cloud computing, internet of things, large multiplayer games, etc. These application domains make use of systems such as distributed databases (e.g., Google's Spanner, Amazon's Dynamo, etc.), large scale analytics frameworks (e.g., Hadoop, Spark and TensorFlow), distributed locking systems (e.g., Paxos, etcd, etc.), and others. In this class we will look at how to construct these distributed systems, in particular looking at why this is more complex than building applications running on a single machine, and present abstraction and design techniques for building distributed systems. We will focus on a solving a variety of common problems in these systems including consensus, consistency, naming, fault tolerance, etc.

This is a graduate-level course, but undergraduates are welcome! The course itself will consist of a series of lectures and will require reading research papers.

This class satisfies the Ph.D. breadth requirement in Systems and also serves as a M.S. capstone course.

Prerequisites: 1. Undergraduate Operating Systems or Computer Systems Organization; 2. programming experience; 3. mathematical maturity or the willingness to work through simple proofs.
CSCI-GA.2630-001
(3626) Foundations of Networks and Mobile Systems* Lakshminarayanan Subramanian T 10:00-11:50AM KMEC 2-60 Additional information: Open only to students in the TechMBA program

Only open to MS students in the Computing, Entrepreneurship, and Innovation program

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 Webbased systems, providing an introduction to datacenter 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.
CSCI-GA.2630-002
(3627) Foundations of Networks and Mobile Systems Lab* Lakshminarayanan Subramanian T 9:00-9:50AM KMEC 2-60 Additional information: Open only to students in the TechMBA program

Only open to MS students in the Computing, Entrepreneurship, and Innovation program

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 Webbased systems, providing an introduction to datacenter 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.
CSCI-GA.2630-003
(23698) Foundations of Networks and Mobile Systems* Lakshminarayanan Subramanian M 12:30-2:30PM 60 Fifth Ave C15

Only open to MS students in the Computing, Entrepreneurship, and Innovation program

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 Webbased systems, providing an introduction to datacenter 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.
CSCI-GA.2630-004
(23699) Foundations of Networks and Mobile Systems Lab* Lakshminarayanan Subramanian W 1:30-2:20PM 60 Fifth Ave C15

Only open to MS students in the Computing, Entrepreneurship, and Innovation program

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 Webbased systems, providing an introduction to datacenter 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.
CSCI-GA.2810-001
(22430) Design and Innovation* Gary Zamchick F 10:15-12:15PM 60 Fifth Ave C15 Additional information: Open only to students in the MS-CEI program

Only open to MS students in the Computing, Entrepreneurship, and Innovation program.

This is an intensive idea-incubation, computing-centric design class where students will be exposed to a spectrum of tech challenges, latest and future technology trends (using case studies) and will need to iteratively propose and refine bold computing centric ideas for real problems. Students will also initiate the process of translating their ideas to initial prototypes. Right from the beginning, students in the class will form small teams where each team will work on a single project idea that solves an important real world problem. Students will be provided exposure to basic tools and platforms that can be leveraged by individual teams in their project design and implementation. In addition to idea incubation, the class will provide a beginner's background to tech startups including: product development cycle, how to pitch your idea, product market fit, fundraising and venture capital, customer discovery. Teams are expected to constantly interact with other teams to discuss and exchange ideas.

Prerequisites: None
CSCI-GA.2810-002
(22431) Design and Innovation Lab* Gary Zamchick F 12:30-1:20PM 60 Fifth Ave C15 Additional information: Open only to students in the MS-CEI program

Only open to MS students in the Computing, Entrepreneurship, and Innovation program.

This is an intensive idea-incubation, computing-centric design class where students will be exposed to a spectrum of tech challenges, latest and future technology trends (using case studies) and will need to iteratively propose and refine bold computing centric ideas for real problems. Students will also initiate the process of translating their ideas to initial prototypes. Right from the beginning, students in the class will form small teams where each team will work on a single project idea that solves an important real world problem. Students will be provided exposure to basic tools and platforms that can be leveraged by individual teams in their project design and implementation. In addition to idea incubation, the class will provide a beginner's background to tech startups including: product development cycle, how to pitch your idea, product market fit, fundraising and venture capital, customer discovery. Teams are expected to constantly interact with other teams to discuss and exchange ideas.

Prerequisites: None
CSCI-GA.2820-001
(3108) DevOps and Agile Methodologies John Rofrano T 4:55-6:55PM Online

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2820-002
(3128) DevOps and Agile Methodologies Lab John Rofrano T 7:10-8:00PM Online

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2820-003
(3678) DevOps and Agile Methodologies John Rofrano W 4:55-6:55PM Online

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2820-004
(3679) DevOps and Agile Methodologies Lab John Rofrano W 7:10-8:00PM Online

This course uses a project based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.
CSCI-GA.2945-002
MATH-GA.2011-002
(3624) Adv Topics Num Analysis: Computational Electromagnetics Michael O'Neil R 1:25-3:15PM CIWW 1302
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-003
MATH-GA.2011-003
(3663) Adv Topics Num Analysis: Monte Carlo Methods Jonathan Weare W 11:00-12:50PM CIWW 1302
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2965-001
(3264) Heuristic Problem Solving Dennis Shasha R 7:10-9:10PM CIWW 102
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-025
(2469) Special Topics: Graphics Processing Units (GPUs): Architecture & Programming Mohamed Zahran W 4:55-6:55PM CIWW 102

This course serves as a capstone for the MSCS program.

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.
CSCI-GA.3033-061
(3005) Special Topics: Predictive Analytics Anasse Bari W 4:55-6:55PM GCASL 379

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.
CSCI-GA.3033-078
(25585) Special Topics: Cryptocurrencies and Decentralized Ledgers Joseph Bonneau T 7:10-9:10PM Silv 207

Bitcoin, Ethereum, and other systems using decentralized ledgers (blockchains) have quickly grown to valuations of hundreds of billions of dollars. Their future potential has captured the imagination of researchers working on applications as diverse as banking and finance, voting, law, corporate governance, gambling and online gaming. This course will cover the technical concepts underlying these systems: append-only ledgers, decentralized consensus, smart contracts and zero-knowledge proof systems. Students will gain working knowledge of both Bitcoin and Ethereum through practical assignments. The course will also survey the wide variety of potential future applications.

Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java. An undergraduate course in cryptography or successful completion of CSCI-GA.3205 or CSCI-GA.3210 strongly recommended.
CSCI-GA.3033-083
(3599) Special Topics: Machine Learning for Healthcare Sumit Chopra W 7:10-9:10PM 194M 204

The course covers machine learning methods important for healthcare including causal inference, k-shot learning, time series models, and fairness. We will learn about important clinical questions and the data (such as from ICU monitors and imaging) that along with machine learning can help answer these questions. We will focus on recent work in machine learning for healthcare.
CSCI-GA.3033-085
(2468) Special Topics: Cloud and Machine Learning I-Hsin Chung
Hao Yu R 4:55-6:55PM CIWW 201

This is a capstone course for the MSCS program.

This course exposes students to the practical aspects of the state of art in cloud computing with an emphasis on employing cloud for machine learning problems. The course material introduces students to various cloud technologies such as virtualization and container. Students will learn how to build machine learning systems using cloud computing, the application performance characteristics, and develop hands-on experience with programming machine learning applications on the cloud platforms.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250. Python programming. Students are expected to know basic Linux commands and configurations. Software communication and development tools such as Slack and Github will be used.
CSCI-GA.3033-087
DS-GA.3001-013
(3642) Special Topics in Data Science: Bayesian Machine Learning Tim Rudner T 4:55-6:35PM 60 Fifth Ave 150

This course aims to provide students with a strong grasp of the fundamental principles underlying Bayesian model construction and inference. We will go into particular depth on Gaussian process and probabilistic deep learning models. The course will be comprised of three units, alongside a major research project component. 1. Model Construction and Inference: Parametric models, support, inductive biases, gradient descent, sum and product rules, graphical models, exact inference, approximate inference (Laplace approximation, variational methods, MCMC), model selection and hypothesis testing, Occam's razor, non-parametric models. 2. Gaussian Processes: From finite basis expansions to infinite bases, kernels, function-space modelling, marginal likelihood, non-Gaussian likelihoods, Bayesian optimization. 3. Bayesian Deep Learning: Fully connected, convolutional, and recurrent networks, generative models, normalizing flows, loss surfaces, deep kernel learning, subspace inference. Prerequisites: A strong foundation in basic linear algebra, probability, statistics, multivariable calculus, and programming. A careful reading of the first three chapters of Christopher Bishop's Pattern Recognition and Machine Learning (2006) before class starts. Prior courses on machine learning are strongly recommended.

Students must enroll into Lab section 187 with Lecture section 087.
CSCI-GA.3033-088
(19634) Special Topics: Blockchain and Its Applications CANCELLED -

Blockchain has the potential to fundamentally shift how businesses and other organizations collaborate, enabling increased trust between participants and substantial efficiency gains in terms of time and labor. This course provides a hands-on introduction to the rapidly evolving field of Blockchain for applications centered around inter-organization collaboration. The emphasis is on creating and programming Blockchain applications and off-chain interactions with them, The course will also cover setting up Blockchain networks, the underlying distributed systems architecture, the role of encryption and consensus algorithms, model-driven application development, governance and security. The course will cover several existing blockchain platforms, although the programming assignments and case studies will be based on the open-source Hyperledger Fabric, one of the leading platforms for inter-organization collaboration applications.

Prerequisites: An undergraduate algorithms course.
CSCI-GA.3033-091
(3341) Special Topics: Introduction to Deep Learning Systems Parijat Dube T 7:10-9:10PM Silv 411

The course will cover several topics related to Deep Learning (DL) systems and their performance.

Both algorithmic and system related building blocks of DL systems will be covered including DL training algorithms, network architectures, and best practices for performance optimization. We will study hyperparameter choices, scalable distributed DL training, Kubernetes based DL system stack on cloud, tools and benchmarks for performance evaluation of DL systems, transfer learning etc. Emphasis will be on getting working knowledge of tools and techniques for performance evaluation of DL systems. The students will gain practical experience working on different stages of DL life cycle, including model development, testing, and deployment. The assignments will be mostly hands-on involving standard DL frameworks (Tensorflow, Pytorch) and open source technologies.

Prerequisites: An introductory machine learning course. Knowledge of python is preferred but not necessary.
CSCI-GA.3033-096
(19635) Special Topics: Data Analytics and Visualization in Healthcare Maria Lorena Carlo Unda T 7:10-9:10PM Online

This course provides foundational knowledge of data analytics and visualization applied to healthcare settings. Some topics include Health Information Technology (HIT) systems and components, use of R and Python programming languages for data analytics and visualization, best practices in data visualization, design of dashboards using Tableau, and descriptive and predictive analytics methods for healthcare.
CSCI-GA.3033-183
DS-GA.3001-007
(3604) Special Topics in Data Science: Machine Learning for Healthcare Lab Divyam Madaan F 1:30-2:20PM 12WV L120

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-187
DS-GA.3001-014
(3643) Special Topics in Data Science: Bayesian Machine Learning Lab Nate Gruver W 8:10-9:00PM 60 Fifth Ave 150

This course aims to provide students with a strong grasp of the fundamental principles underlying Bayesian model construction and inference. We will go into particular depth on Gaussian process and probabilistic deep learning models. The course will be comprised of three units, alongside a major research project component. 1. Model Construction and Inference: Parametric models, support, inductive biases, gradient descent, sum and product rules, graphical models, exact inference, approximate inference (Laplace approximation, variational methods, MCMC), model selection and hypothesis testing, Occam's razor, non-parametric models. 2. Gaussian Processes: From finite basis expansions to infinite bases, kernels, function-space modelling, marginal likelihood, non-Gaussian likelihoods, Bayesian optimization. 3. Bayesian Deep Learning: Fully connected, convolutional, and recurrent networks, generative models, normalizing flows, loss surfaces, deep kernel learning, subspace inference. Prerequisites: A strong foundation in basic linear algebra, probability, statistics, multivariable calculus, and programming. A careful reading of the first three chapters of Christopher Bishop's Pattern Recognition and Machine Learning (2006) before class starts. Prior courses on machine learning are strongly recommended.

Students must enroll into Lecture section 087 with Lab section 187.
CSCI-GA.3110-001
(3265) Honors Programming Languages Patrick Cousot TR 3:30-4:45PM 60 Fifth Ave C15
The course will introduce a panorama of programming languages concepts underlying the main programming language paradigms (such as imperative, functional, object-oriented, logic, concurrent, and scripting languages) and present in detail the formal methods (code semantics, specification, and verification) used in modern high quality assurance tools for software safety and security. A programming project (design and implementation of an interpreter/compiler for an dynamic object-oriented mini-language) will be programmed in OCaml, a multiparadigm language introduced at the beginning of the course.

Prerequisites: Permission of the instructor for master’s students
CSCI-GA.3205-001
(3110) Applied Cryptography & Network Security Mazdak Zamani T 7:10-9:10PM CIWW 101
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.3520-001
(2470) Honors Analysis of Algorithms Subhash Khot TR 9:30-10:45AM CIWW 102
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
(2471) Information Technology Projects * Jean-Claude Franchitti M 6:10-9:10PM GCASL 261

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-001
(2472) Adv Lab MS * STAFF -

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-002
(2473) Adv Lab MS * STAFF -

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
(2474) Adv Lab MS * STAFF -

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
(2475) Adv Lab MS * STAFF -

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
(2476) Adv Lab PhD ** STAFF -

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
(2477) Adv Lab PhD ** STAFF -

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
(2478) Adv Lab PhD ** STAFF -

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
(2479) Adv Lab PhD ** STAFF -

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
(2480) Master's Thesis Research * STAFF -

Prerequisites: Approval of a faculty adviser and the Director of Graduate Studies for the M.S. programs.
CSCI-GA.3850-001
(3177) PhD Seminar: Cryptography ** Marshall Ball W 1:00-3:00PM CIWW 317
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
(2481) PhD Seminar: Formal Methods ** Thomas Wies R 11:00-12:30PM 60 Fifth Ave 527
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
(2482) PhD Thesis Research ** STAFF -

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

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
(3025) Internship in Computer Science PhD* STAFF -

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-UA.0002-001
(7441) Intro To Computer Programming (No Prior Experience) Amanda Steigman MW 8:00-9:15AM 12WP L120

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-002
(7442) Intro To Computer Programming (No Prior Experience) Susan Liao TR 8:00-9:15AM 12WP L120

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-003
(7443) Intro To Computer Programming (No Prior Experience) Craig Kapp MW 9:30-10:45AM Meyr 121

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-004
(9116) Intro To Computer Programming (No Prior Experience) Julie Lizardo TR 9:30-10:45AM Bobst LL138

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-005
(7444) Intro To Computer Programming (No Prior Experience) Zoe Robert MW 11:00-12:15PM 25W 4th C-20

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-006
(7445) Intro To Computer Programming (No Prior Experience) David Prager MW 12:30-1:45PM Kimmel 803

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-007
(7446) Intro To Computer Programming (No Prior Experience) Julie Lizardo TR 12:30-1:45PM Bobst LL138

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-008
(8556) Intro To Computer Programming (No Prior Experience) Matthew Zeidenberg TR 2:00-3:15PM Online

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-009
(8558) Intro To Computer Programming (No Prior Experience) Joshua Clayton MW 3:30-4:45PM Online

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-010
(8730) Intro To Computer Programming (No Prior Experience) Khye Borg Liew TR 3:30-4:45PM Online

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-011
(9559) Intro To Computer Programming (No Prior Experience) Emily Zhao TR 4:55-6:10PM GCASL 361

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-012
(8882) Intro To Computer Programming (No Prior Experience) Michell Cardona TR 6:20-7:35PM Tisch LC11

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0002-013
(25468) Intro To Computer Programming (No Prior Experience) Mihir Patil MW 9:30-10:45AM CIWW 317

An introduction to the fundamentals of computer programming, which is the foundation of computer science. Students design, write, and debug computer programs. No knowledge of programming is assumed.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0003-001
(9289) Intro to Computer Programming (Limited Prior Experience) Mauricio Arias Hernandez TR 11:00-12:15PM Online

Introduces object-oriented programming, recursion, and other important concepts to students who already have had some exposure to programming in the context of building applications using Python. Students will design and implement Python programs in a variety of applied areas.

Prerequisites: Limited programming experience, or any score on the AP Computer Science examination (students will forfeit the AP credit for scores of 4 or 5), or Data Science for Everyone (DS-UA 111). Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with some previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
CSCI-UA.0004-001
(8659) Intro to Web Design & Computer Principles Alvaro Olsen MW 8:00-9:15AM Bobst LL150
Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
CSCI-UA.0004-002
(7447) Intro to Web Design & Computer Principles Adam Scher TR 8:00-9:15AM Online
Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
CSCI-UA.0004-003
(7448) Intro to Web Design & Computer Principles Mark Ramos MW 11:00-12:15PM CIWW 102
Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
CSCI-UA.0004-004
(7449) Intro to Web Design & Computer Principles Joshua Clayton TR 11:00-12:15PM CIWW 317
Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
CSCI-UA.0004-005
(8436) Intro to Web Design & Computer Principles Julie Lizardo MW 12:30-1:45PM GCASL 279
Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
CSCI-UA.0004-006
(8557) Intro to Web Design & Computer Principles Alvaro Olsen MW 3:30-4:45PM Silv 208
Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.

Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
CSCI-UA.0060-001
(8576) Database Design And Implementation Amos Bloomberg TR 11:00-12:15PM 5WP 101

Introduces principles and applications of database design and working with data. Students use Python as they prepare, analyze, and work with data and use SQL to study the principles and implementations of relational databases. Also covers other database paradigms, such as NoSQL. Students apply these principles to computer systems and their respective fields of interest.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3). Students that have successfully completed Data Management and Analysis (CSCI-UA 479) are NOT eligible to take this course.
CSCI-UA.0061-001
(7450) Web Development And Programming Sana Odeh MW 3:30-4:45PM Silv 408

Provides a practical approach to web technologies and programming. Students build interactive, secure, and powerful web programs. Covers client and server side technologies for the web.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), and Introduction to Web Design and Computer Principles (CSCI-UA 4). Students that have successfully completed Applied Internet Technology (CSCI-UA 467) are NOT eligible to take this course.
CSCI-UA.0101-001
(7451) Intro To Computer Science Nader Nassar MW 8:00-9:15AM Silv 208

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-002
(9887) Intro To Computer Science Gizem Kayar TR 9:30-10:45AM Online

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-003
(19940) Intro To Computer Science Hilbert Gene Locklear MW 12:30-1:45PM 25W 4th C-20

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-004
(7452) Intro To Computer Science Candido Cabo TR 12:30-1:45PM Tisch LC11

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-005
(8460) Intro To Computer Science Duygu Ataman MW 2:00-3:15PM ONLINE

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-006
(9886) Intro To Computer Science Sana Odeh TR 2:00-3:15PM Kimmel 803

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-007
(8661) Intro To Computer Science Hilbert Gene Locklear MW 3:30-4:45PM Silv 401

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-008
(8958) Intro To Computer Science Anasse Bari TR 3:30-4:45PM Cant 101

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0101-009
(23231) Intro To Computer Science Sana Odeh MW 4:55-6:10PM Online

How to design algorithms to solve problems and how to translate these algorithms into working computer programs. Experience is acquired through projects in a high-level programming language. Intended primarily for computer science majors but also suitable for students of other scientific disciplines. Programming assignments.

Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
CSCI-UA.0102-001
(7454) Data Structures Evan Korth TR 12:30-1:45PM Tisch UC 50

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-002
(7455) Data Structures - Recitation Adithya Viswanathan F 4:55-6:10PM Silv 207 Additional information: In-person recitation for Section 1

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-003
(7456) Data Structures Anasse Bari TR 11:00-12:15PM Online

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-004
(8709) Data Structures - Recitation Chris Davidson W 3:30-4:45PM CIWW 101 Additional information: In-person recitation for Section 3

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-005
(9133) Data Structures Joanna Klukowska MW 8:00-9:15AM Cant 200

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-006
(9134) Data Structures - Recitation Joseph Cappadona R 11:00-12:15PM 19UP 102 Additional information: In-person recitation for Section 5

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-021
(9551) Data Structures - Recitation Vaibhav Mavi F 4:55-6:10PM Online Additional information: Online Recitation for Section 1

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-041
(9576) Data Structures - Recitation Siyi Sun W 11:00-12:15PM Online Additional information: Online Recitation for Section 3

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-061
(9143) Data Structures - Recitation Harshitha Raghavan Devarajan R 11:00-12:15PM Online Additional information: Online Recitation for Section 5

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-062
(9144) Data Structures - Recitation Swarna Swapna Ilamathy T 9:30-10:45AM CIWW 202 Additional information: In-person recitation for Section 5

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-063
(9312) Data Structures - Recitation Joseph Cappadona R 12:30-1:45PM CIWW 202 Additional information: In-person recitation for Section 5

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-064
(9389) Data Structures - Recitation Xujin He R 9:30-10:45AM CIWW 202 Additional information: In-person recitation for Section 5

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0102-065
(7453) Data Structures - Recitation Lauren DiGiovanni F 4:55-6:10PM CIWW 202 Additional information: In-person recitation for Section 5

Use and design of data structures, which organize information in computer memory. Stacks, queues, linked lists, binary trees: how to implement them in a high-level language, how to analyze their effect on algorithm efficiency, and how to modify them. Programming assignments.

Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
CSCI-UA.0201-001
(7457) Computer Systems Organization Douglas Moody MW 9:30-10:45AM Online
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-002
(7458) Computer Systems Organization - Recitation Harshitha Raghavan Devarajan T 9:30-10:45AM GCASL 279 Additional information: In-person recitation for Section 1
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-003
(8575) Computer Systems Organization Jinyang Li TR 9:30-10:45AM Online
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-004
(8901) Computer Systems Organization - Recitation Shantanu Dahiya M 8:00-9:15AM Silv 408 Additional information: In-person recitation for Section 3
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-005
(8902) Computer Systems Organization Hasan Aljabbouli MW 3:30-4:45PM Cant 101
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-006
(8903) Computer Systems Organization - Recitation Anish Mahishi T 4:55-6:10PM Silv 405 Additional information: In-person recitation for Section 5
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-007
(23230) Computer Systems Organization Gizem Kayar TR 3:30-4:45PM Online
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-008
(23232) Computer Systems Organization - Recitation Fakhruddin Pattan R 8:00-9:15AM CIWW 109 Additional information: In-person recitation for Section 7
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-021
(9549) Computer Systems Organization - Recitation Jaya Amit Sai Gurrala T 9:30-10:45AM Online Additional information: In-person recitation for Section 1
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-041
(9548) Computer Systems Organization - Recitation Shraddha Thyagarajan Iyer M 8:00-9:15AM Online Additional information: Online Recitation for Section 3
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-061
(9550) Computer Systems Organization - Recitation Samvid Zare T 4:55-6:10PM Online Additional information: Online Recitation for Section 5
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0201-081
(23233) Computer Systems Organization - Recitation Fakhruddin Pattan F 8:00-9:15AM Online Additional information: Online Recitation for Section 7
Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

Prerequisites: Data Structures (CSCI-UA 102).
CSCI-UA.0202-001
(7459) Operating Systems Yang Tang MW 4:55-6:10PM Online
Covers the principles and design of operating systems. Topics include process scheduling and synchronization, deadlocks, memory management (including virtual memory), input/output, and file systems. Programming assignments.

Prerequisites: Computer Systems Organization (CSCI-UA 201).
CSCI-UA.0202-002
(9053) Operating Systems Mohamed Zahran TR 11:00-12:15PM Online
Covers the principles and design of operating systems. Topics include process scheduling and synchronization, deadlocks, memory management (including virtual memory), input/output, and file systems. Programming assignments.

Prerequisites: Computer Systems Organization (CSCI-UA 201).
CSCI-UA.0310-001
(7460) Basic Algorithms Marshall Ball TR 12:30-1:45PM Cant 101

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0310-002
(7461) Basic Algorithms - Recitation Vladimir Podolskii W 8:00-9:15AM CIWW 109 Additional information: In-person recitation for Section 1

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0310-003
(9052) Basic Algorithms Oded Regev MW 2:00-3:15PM Cant 101

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0310-004
(9390) Basic Algorithms - Recitation Peter Fenteany R 2:00-3:15PM Silv 405 Additional information: In-person recitation for Section 3

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0310-005
(25048) Basic Algorithms Seyed Hossein Nassajianmojarrad TR 12:30-1:45PM Online

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0310-021
(9889) Basic Algorithms - Recitation Vladimir Podolskii W 12:30-1:45PM Online Additional information: Online Recitation for Section 1

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0310-041
(9890) Basic Algorithms - Recitation Eli Goldin R 2:00-3:15PM Online Additional information: Online Recitation for Section 3

Introduction to the study of algorithms. Presents two main themes: designing appropriate data structures and analyzing the efficiency of the algorithms that use them. Algorithms studied include sorting, searching, graph algorithms, and maintaining dynamic data structures. Homework assignments, not necessarily involving programming.

Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
CSCI-UA.0380-001
(7462) Topics of General Interest: Interactive Computing Craig Kapp MW 3:30-4:45PM CIWW 102
Detailed descriptions available when topics are announced. Typical offerings include Computing in the Humanities and Arts and Introduction to Flash Programming. Does not count toward the computer science major.

Prerequisites: Topics determine prerequisites.
CSCI-UA.0381-001
(9893) Programming Tools for the Data Scientist Hasan Aljabbouli TR 12:30-1:45PM Silv 208

Lecture and laboratory. Building applications in Python using a project-based learning approach. Students use Python packages in a variety of applied areas, such as textual analysis and data visualization. Does not count toward the computer science major.

Prerequisites: Data Science for Everyone (DS-UA 111) or equivalent proficiency in Python, and either Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3).
CSCI-UA.0467-001
(9894) Applied Internet Technology Joseph Versoza TR 9:30-10:45AM Online

Applied Internet Technology is a practical introduction to creating modern web applications. It covers full-stack (that is, every aspect of building a database driven web application: server programming, database implementation, frontend markup, styling and interactivity) web development. It includes topics such as database and data model design, web application architecture, separation of logic and presentation, handling user input and processing form data, managing asynchronous processes, strategies for creating real-time web applications, and handling client-side interactivity. Students will use current server and client-side web frameworks and libraries to build dynamic, data-driven sites. Various applications to support development will also be introduced, such as version control, static analysis tools, and build systems.

Prerequisites: C or better in Computer Systems Organization (CSCI-UA 201). Students who complete Applied Internet Technology (CSCI-UA 467) with a C or better are not eligible to take Web Development and Programming (CSCI-UA 61).
CSCI-UA.0467-002
(19941) Applied Internet Technology Joseph Versoza MW 12:30-1:45PM Silv 208

Applied Internet Technology is a practical introduction to creating modern web applications. It covers full-stack (that is, every aspect of building a database driven web application: server programming, database implementation, frontend markup, styling and interactivity) web development. It includes topics such as database and data model design, web application architecture, separation of logic and presentation, handling user input and processing form data, managing asynchronous processes, strategies for creating real-time web applications, and handling client-side interactivity. Students will use current server and client-side web frameworks and libraries to build dynamic, data-driven sites. Various applications to support development will also be introduced, such as version control, static analysis tools, and build systems.

Prerequisites: C or better in Computer Systems Organization (CSCI-UA 201). Students who complete Applied Internet Technology (CSCI-UA 467) with a C or better are not eligible to take Web Development and Programming (CSCI-UA 61).
CSCI-UA.0470-001
(9891) Object Oriented Programming Hasan Aljabbouli MW 9:30-10:45AM Silv 206

Introduces the important concepts of object-oriented design and languages, including code reuse, data abstraction, inheritance, and dynamic overloading. Covers in depth those features of Java and C++ that support object-oriented programming and gives an overview of other object-oriented languages of interest. Significant programming assignments stressing object-oriented design. Not offered every academic year.

Prerequisites: Computer Systems Organization (CSCI-UA 201).
CSCI-UA.0472-001
(22829) Artificial Intelligence Ernest Davis TR 11:00-12:15PM CIWW 102
Many cognitive tasks that people can do easily and almost unconsciously have proven extremely difficult to program on a computer. Artificial intelligence tackles the problem of developing computer systems that can carry out these tasks. Focus is on three central areas in AI: representation and reasoning, machine learning, and natural language processing.

Prerequisites: Computer Systems Organization (CSCI-UA 201) and Basic Algorithms (CSCI-UA 310).
CSCI-UA.0473-001
(10346) Fundamentals of Machine Learning Lerrel Pinto TR 2:00-3:15PM Online

This exciting and fast-evolving field of computer science has many recent consumer applications (e.g., Microsoft Kinect, Google Translate, IPhone's Siri, digital camera face detection, Netflix recommendations, Google news) and applications within the sciences and medicine (e.g., predicting protein-protein interactions, species modeling, detecting tumors, personalized medicine). Students learn the theoretical foundations and how to apply machine learning to solve new problems.

Prerequisites: Data Structures (CSCI-UA.102), Linear Algebra (MATH-UA.140) and Probability and Statistics (MATH-UA.235). Students may take any of the following courses in place of MATH-UA.235: Theory of Probability (MATH-UA 233), Mathematical Statistics (MATH-UA 234), Honors Theory of Probability (MATH-UA 238) OR Data Analysis (MA-UY 2224).
CSCI-UA.0473-002
(23613) Fundamentals of Machine Learning - Recitation Lerrel Pinto M 8:00-9:15AM CIWW 109

This exciting and fast-evolving field of computer science has many recent consumer applications (e.g., Microsoft Kinect, Google Translate, IPhone's Siri, digital camera face detection, Netflix recommendations, Google news) and applications within the sciences and medicine (e.g., predicting protein-protein interactions, species modeling, detecting tumors, personalized medicine). Students learn the theoretical foundations and how to apply machine learning to solve new problems.

Prerequisites: Data Structures (CSCI-UA.102), Linear Algebra (MATH-UA.140) and Probability and Statistics (MATH-UA.235). Students may take any of the following courses in place of MATH-UA.235: Theory of Probability (MATH-UA 233), Mathematical Statistics (MATH-UA 234), Honors Theory of Probability (MATH-UA 238) OR Data Analysis (MA-UY 2224).
CSCI-UA.0473-021
(23499) Fundamentals of Machine Learning - Recitation Lerrel Pinto W 8:00-9:15AM Online

This exciting and fast-evolving field of computer science has many recent consumer applications (e.g., Microsoft Kinect, Google Translate, IPhone's Siri, digital camera face detection, Netflix recommendations, Google news) and applications within the sciences and medicine (e.g., predicting protein-protein interactions, species modeling, detecting tumors, personalized medicine). Students learn the theoretical foundations and how to apply machine learning to solve new problems.

Prerequisites: Data Structures (CSCI-UA.102), Linear Algebra (MATH-UA.140) and Probability and Statistics (MATH-UA.235). Students may take any of the following courses in place of MATH-UA.235: Theory of Probability (MATH-UA 233), Mathematical Statistics (MATH-UA 234), Honors Theory of Probability (MATH-UA 238) OR Data Analysis (MA-UY 2224).
CSCI-UA.0474-001
(9892) Software Engineering Amos Bloomberg MW 2:00-3:15PM Silv 411

An intense hands-on study of practical techniques and methods of software engineering. Topics include advanced object-oriented design, design patterns, refactoring, code optimization, universal modeling language, threading, user interface design, enterprise application development, and development tools. All topics are integrated and applied during the semester long group project. The aim of the project is to prepare students for dynamics in a real workplace. Members of the group meet on a regular basis to discuss the project and to assign individual tasks. Students are judged primarily on the final project presentations. Not offered every academic year.

Prerequisites: Computer Systems Organization (CSCI-UA 201)
CSCI-UA.0476-001
(9507) Processing Big Data for Analytics Applications Ann Malavet TR 8:00-9:15AM GCASL 383

Introduces platforms, tools, and architectures that facilitate scalable management and processing of vast quantities of data. Explores open source tools enabling the efficient acquisition, distributed storage, and processing of big data. Provides hands-on experience with distributed processing Apache solutions such as Hadoop MapReduce, HBase, Hive, Impala, Pig, core Spark, Spark SQL, and Spark Streaming. Other Apache big data tools covered are Oozie, Zookeeper, Flume, and Kafka.

Prerequisites: (CSCI-UA 201) Computer Systems Organization and (CSCI-UA 310) Basic Algorithms. Familiarity with Linux commands and SQL will be helpful but is not required.
CSCI-UA.0479-001
(9895) Data Management and Analysis Joseph Versoza MW 11:00-12:15PM Online

Extracting, transforming and analyzing data in myriad formats. Using traditional relational
databases as well as non-relational databases as well as non-relational databases to store, manipulate, and query data. Students write custom programs, create queries, and use data analysis tools and libraries on a wide array of data sets. Additional topics: data modeling, cloud databases and AP programming.

Prerequisites: Data Structures (CSCI-UA 102). Students that complete Data Management and Analysis (CSCI-UA 479) with a C or better are not eligible to take Database Design and Implementation (CSCI-UA 60).
CSCI-UA.0479-002
(19942) Data Management and Analysis Matthew Zeidenberg MW 3:30-4:45PM Silv 411

Extracting, transforming and analyzing data in myriad formats. Using traditional relational
databases as well as non-relational databases as well as non-relational databases to store, manipulate, and query data. Students write custom programs, create queries, and use data analysis tools and libraries on a wide array of data sets. Additional topics: data modeling, cloud databases and AP programming.

Prerequisites: Data Structures (CSCI-UA 102). Students that complete Data Management and Analysis (CSCI-UA 479) with a C or better are not eligible to take Database Design and Implementation (CSCI-UA 60).
CSCI-UA.0479-003
(23721) Data Management and Analysis Matthew Zeidenberg MW 11:00-12:15PM Online

Extracting, transforming and analyzing data in myriad formats. Using traditional relational
databases as well as non-relational databases as well as non-relational databases to store, manipulate, and query data. Students write custom programs, create queries, and use data analysis tools and libraries on a wide array of data sets. Additional topics: data modeling, cloud databases and AP programming.

Prerequisites: Data Structures (CSCI-UA 102). Students that complete Data Management and Analysis (CSCI-UA 479) with a C or better are not eligible to take Database Design and Implementation (CSCI-UA 60).
CSCI-UA.0480-041
(8977) Special Topics: Computer Graphics Kenneth Perlin TR 8:00-9:15AM CIWW 101

There are many courses that can teach you how to use commercial computer graphics packages and APIs. This course, in contrast, will teach you how to build 3D computer graphics from the ground up. This will include 3D modeling, animation, and rendering. At the end of the semester you will have built your own complete working real-time 3D computer graphics systems that run in web browsers.

Prerequisites: CSCI-UA 201 Computer Systems Organization, CSCI-UA-310 (Basic Algorithms) and MATH-UA-140 (Linear Algebra), or departmental consent
CSCI-UA.0480-042
(10208) Special Topics: Computer Vision Davi Geiger TR 4:55-6:10PM Silv 401

An introduction to the field of computer vision. Basic concepts will be covered such as edge detection, stereo vision, motion, color, texture and recognition.

Prerequisites: Computer System Organization (CSCI-UA.201) and Linear Algebra (MATH-UA.140)
CSCI-UA.0480-046
(8710) Special Topics: Intro to Social Networking Bhubaneswar Mishra TR 12:30-1:45PM GCASL 383

Social Networks is a specific example of many forms of networks that have become ubiquitous in our modern society. Their utilities have been enhanced by their ability to generate massive amount of personal data that need to be analyzed and disseminated quickly. The World Wide Web enables information flows among vast number of humans; Facebook, LinkedIn, etc. connect small groups of friends; amazon, eBay, etc. provide opportunities for trading, etc. These networks determine our information, influence our opinions, and shape our political attitudes. They also link us, often through important but weak ties, to other humans. Their origin is biological: going back to quorum-sensing, swarming, flocking, social grooming, gossip, etc. Yet, as we have connected our social networks to traditional human institutions (markets, justice systems, education, etc.) through new technologies, the underlying biology has become obscured, but not dormant. This course will introduce the tools, analytics and algorithms for the study of networks and their data. It will show how certain common principles permeate the functioning of these diverse networks: e.g., issues related to robustness, fragility, and interlinkages etc.

Prerequisites: CSCI-UA 201 Computer Systems Organization
CSCI-UA.0480-052
(22800) Special Topics: Algorithmic Problem Solving Joanna Klukowska MW 12:30-1:45PM CIWW 101

Many of the top firms in the technological and financial sectors are using algorithmic problems as interview questions for assessing candidate skill. In this course we take this idea one step further and use algorithmic problem solving as way to hone programming skills. Students will use the material covered in the data structures and algorithms courses and learn new algorithmic techniques to solve challenging problems quickly. Each week will be devoted to a particular type of algorithm. Weekly problem sets will reinforce the lecture, and require students to implement their solutions in Java or C++. Students completing this course will be well prepared to participate in programming competitions such as the ACM Inter-Collegiate Programming Contest, TopCoder, and Google's Code Jam.

Prerequisites: CSCI-UA.0201 Computer Systems Organization, CSCI-UA.0310 Basic Algorithms
CSCI-UA.0480-057
(8877) Special Topics: Natural Language Processing Adam Meyers TR 2:00-3:15PM Online

Natural Language Processing (aka Computational Linguistics) is an inter-disciplinary field applying methodology of computer science and linguistics to the processing of natural languages (English, Chinese, Spanish, Japanese, etc.). Typical applications include: information extraction (automatically finding information from text); information retrieval (web searches and other applications involving the automatic selection of "relevant" documents); sentiment analysis (automatic extraction of opinions about a set of issues); and machine translation (automatically translating one natural language to another). Much of the best work in the field combines two methodologies: (1) automatically acquiring statistical information from one set of "training" documents to use as the basis for probabilistically predicting the distribution of similar information in new documents; and (2) using manually encoded linguistic knowledge. For example, many supervised methods of machine learning require: a corpus of text with manually encoded linguistic knowledge, a set of procedures for acquiring statistical patterns from this data and a transducer for predicting these same distinctions in new text. This class will cover linguistic, statistical and computational aspects of this exciting field.

Prerequisites: CSCI-UA 201 Computer Systems Organization
CSCI-UA.0480-069
(9515) Special Topics: Agile Software Development and DevOps Amos Bloomberg TR 12:30-1:45PM Silv 405

Agile software development has come to describe a specific approach and toolset that allow for the requirements of a software project to change as a project progresses without disrupting schedules, budgets, and responsibilities. The field of DevOps, a portmanteau of development and operations has introduced further processes and infrastructure to automate many of the tasks required in such development. Together, Agile's methodology and DevOps' automation have increased the speed, robustness, and scalability with which software is developed today. Upon completion of this course, students will understand the core methodologies, technologies, and tools used for software engineering.

Prerequisites: CSCI-UA 201 Computer Systems Organization
CSCI-UA.0480-071
(8876) Special Topics: Collaborating Remotely: Build Software from Anywhere Evan Korth TR 3:30-4:45PM Silv 411

In this course students will build software using modern software collaboration tools and methodologies widely used in industry. The first part (approximately 1/3rd) of the course will include a survey of some of the best software development collaboration tools and how to use them. Teams of students will explore the tools by building a sample project in Java. The rest of the course will be software development in teams using Agile methodologies. Students will choose their project from an assortment selected by the professor and their own proposals. Upon completion, students should have a portfolio piece.

Prerequisites: CSCI-UA 201 Computer Systems Organization

*

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.