Course Schedule

Current semester Spring 2011, 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.1144-001
(30185) PAC II Evan Gallagher TR 7:10-9:00PM WWH 201

This course builds directly on the foundation developed in PAC I, covering the essentials of computer organization through the study of assembly language programming and C, as well as introducing the students to the analysis of algorithms. Topics include: (1) Assembly language programming for the Intel chip family, emphasizing computer organization, the Intel x86 instruction set, the logic of machine addressing, registers and the system stack. (2) Programming in the C language, a general-purpose programming language which also has low-level features for systems programming. (3) An introduction to algorithms, including searching, sorting, graph algorithms and asymptotic complexity. Examples and assignments reinforce and refine those first seen in PAC I and often connect directly to topics in the core computer science graduate courses, such as Programming Languages, Fundamental Algorithms, and Operating Systems

Prerequisites: CSCI-GA 1133 or departmental permission.
CSCI-GA.1170-001
(30186) Fundamental Algorithms Chee Yap R 5:00-6:50PM WWH 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-002
(30187) Fundamental Algorithms Recitation Esther Ezra T 7:10-8:00PM WWH 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.2110-001
(30188) Programming Languages Jean-Claude Franchitti R 7:10-9:00PM WWH 109

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
(30189) Programming Languages Recitation Anh Hoang Le T 8:10-9:00PM WWH 109

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
(30190) Scientific Computing Aleksandar Donev R 5:10-7:00PM WWH 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.2130-001
(30191) Compiler Construction Mohamed Zahran R 7:10-9:00PM WWH 512
This is a capstone course based on compilers and modern programming languages. The topics covered include structure of one-pass and multiple-pass compilers; symbol table management; lexical analysis; traditional and automated parsing techniques, including recursive descent and LR parsing; syntax-directed translation and semantic analysis; run-time storage management; intermediate code generation; introduction to optimization; and code generation. The course includes a special compiler-related capstone project, which ties together concepts of algorithms, theory (formal languages), programming languages, software engineering, computer architecture, and other subjects covered in the MS curriculum. This project requires a substantial semester-long programming effort, such as construction of a language compilation or translation system that includes lexical and syntactic analyzers, a type checker, and a code generator.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2250-001
(30192) Operating Systems Allan Gottlieb T 5:00-6:50PM WWH 109
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
(30193) Data Communications and Networks Jean-Claude Franchitti R 5:00-6:50PM WWH 101

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
(30194) Computer Graphics Denis Zorin W 5:00-6:50PM 719BWY 1221

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
(30195) Computer Vision Robert Fergus R 5:00-6:50PM 719BWY 1221

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.2421-001
G63.2020
(30196) Numerical Methods II Weiqing Ren R 7:10-9:00PM WWH 312
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
(30197) Database Systems Zvi Kedem M 7:10-9:00PM WWH 102
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.2440-001
(30198) Software Engineering Jean-Claude Franchitti M 7:10-9:00PM WWH 512
This is a capstone course focusing on large-scale software development. This course presents modern software engineering techniques and examines the software life cycle, including software specification, design, implementation, testing, and maintenance. Object-oriented design methods are also considered. Software engineering projects involve creation of a large-scale software system and require 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.2520-001
G23.1127.001
(30199) Bioinformatics and Genomes Richard Bonneau F 1:00-3:45PM WWH 317
The recent explosion in the availability of genome-wide data such as whole genome sequences and microarray data led to a vast increase in bioinformatics research and tool development. Bioinformatics is becoming a cornerstone for modern biology, especially in fields such as genomics. It is thus crucial to understand the basic ideas and to learn fundamental bioinformatics techniques. The emphasis of this course is on developing not only an understanding of existing tools but also the programming and statistics skills that allow students to solve new problems in a creative way.
CSCI-GA.2566-001
(30201) Foundations Of Machine Learning Mehryar Mohri M 5:00-6:50PM WWH 109

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.2580-001
(31331) Web Search Engines Ernest Davis W 5:00-6:50PM WWH 102

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

Prerequisites: Recommend CSCI-GA 1180.
CSCI-GA.2591-001
(31334) Advanced Topics in Natural Language Processing Ralph Grishman T 5:00-6:50PM WWH 709

The design of systems that can learn by reading. Ontology and knowledge base. Principal processing components: text segmentation, lexical analysis, name recognition and classification, parsing and syntactic regularization, word sense disambiguation, predicate-argument analysis, reference resolution, discourse structure. Joint inference methods. Knowledge acquisition strategies.

This is a project-oriented, team-organized course in which students will take responsibility for one or two processing components: selecting methods, making class presentations, creating and maintaining code. A good working knowledge of corpus-trained methods for these components is required (using log-linear or deep models). Implementation will be in Java, so good programming skills in Java are needed, along with a commitment to meeting javadoc documentation standards.

The tentative target is to read articles from Wikipedia.

Prerequisites: Students should have solid programming skills in Java and should have successfully completed a graduate level course in natural language processing.
CSCI-GA.2620-001
(30203) Networks and Distributed Systems Lakshminarayanan Subramanian W 5:00-6:50PM WWH 201

This is a capstone course. A course in computer networks and large-scale distributed systems. Teaches the design and implementation techniques essential for engineering both robust networks and Internet-scale distributed systems. The goal is to guide students so they can initiate and critique research ideas in networks and distributed systems and implement and evaluate a working system that can handle a real-world workload. Topics include routing protocols, network congestion control, wireless networking, peer-to-peer systems, overlay networks and applications, distributed storage systems, and network security.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2631-001
(30204) Distributed Computing Alberto Lerner M 5:00-6:50PM WWH 312

Concepts underlying distributed systems: synchronization, communication, fault tolerance, and performance. Examined from three points of view: (1) problems, appropriate assumptions, and algorithmic solutions; (2) linguistic constructs; and (3) some typical systems.

Prerequisites: CSCI-GA 1170 and CSCI-GA 2250
CSCI-GA.2750-001
G63.2012-002
(31297) Adv Tpcs In Num Analysis Nonlinear Optimization Margaret Wright T 5:10-7:00PM WWH 312

Topics vary each semester.

Cross-listing for MATH-GA 2012.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-001
G63.2012.001
(30205) Advanced Topics in Numerical Analysis: Finite Element Methods Olof Widlund M 1:25-3:15PM WWH 517
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-002
G63.2012.003
(30206) Advanced Topics in Numerical Analysis: Immersed Boundary Methods Charles Peskin W 1:25-3:15PM WWH 512
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.3033-001
(30207) Special Topics: Abstract Interpretation Patrick Cousot R 5:00-6:50PM WWH 317

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-002
(30208) Special Topics: Financial Computing I Eran Fishler W 7:10-9:00PM WWH 101

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-004
(30210) Special Topics: Data Mining: Concepts and Techniques Zvi Kedem M 5:00-6:50PM WWH 102

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-005
(30211) Special Topics in Algorithms Subhash Khot W 7:10-9:00PM WWH 312

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-006
(30212) Special Topics: Computational Systems Biology Bhubaneswar Mishra M 5:00-6:50PM 719BWY 1221

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-007
(31333) Special Topics: Web Development with Ruby on Rails Michael Schidlowsky T 7:10-9:00PM WWH 102

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-008
(30213) Special Topics: Software Management Systems CANCELLED R 7:10-9:00PM WWH 1302

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3110-001
(30219) Honors Programming Languages Patrick Cousot TR 3:30-4:45PM WWH 312
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.3210-001
G63.2170-001 Introduction To Cryptography CANCELLED T 5:00-6:50PM WWH 317
The primary focus of this course is on definitions and constructions of various cryptographic objects, such as pseudorandom generators, encryption schemes, digital signature schemes, message authentication codes, block ciphers, and others, time permitting. The class tries to understand what security properties are desirable in such objects, how to properly define these properties, and how to design objects that satisfy them. Once a good definition is established for a particular object, the emphasis will be on constructing examples that provably satisfy the definition. Thus, a main prerequisite of this course is mathematical maturity and a certain comfort level with proofs. Secondary topics, covered only briefly, are current cryptographic practice and the history of cryptography and cryptanalysis.

Prerequisites: Strong mathematical background
CSCI-GA.3250-001
(31332) Honors Operating Systems Robert Grimm MW 3:30-4:45PM WWH 312
Operating-system structure. Processes. Process synchronization. Language mechanisms for concurrency. Deadlocks: modeling, prevention, avoidance, and recovery. Memory management. File-system interface. Secondary storage. Distributed systems: layered system design, managing distributed processes, distributed shared memory, fault-tolerance. CPU scheduling. Queuing and performance: analysis of single M/M/1 queue and others. Protection and security. Advanced security concepts: threat monitoring, encryption, and public keys.

Prerequisites: Permission of the instructor for master’s students
CSCI-GA.3812-001
(30222) Information Technology Projects Evan Korth R 6:00-9:00PM WWH 412

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
(30223) Advanced Laboratory 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
(30224) Advanced Laboratory 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
(30225) Advanced Laboratory 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
(30226) Advanced Laboratory 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
(30227) Advanced Laboratory 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
(30228) Advanced Laboratory 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
(30229) Advanced Laboratory 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
(30230) Advanced Laboratory 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
(30231) 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 PhD Seminar: Cryptography CANCELLED T 1:00-3:30PM WWH 1302
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-002
(30233) PhD Seminar: Systems Robert Grimm T 12:30-1:45PM 719BWY 709
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-003
(30234) PhD Seminar: Theory Subhash Khot R 2:00-3:30PM WWH 1314
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
(30235) PhD Seminar: Formal Methods Clark Barrett W 11:00-12:30PM WWH 412
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-005
(30236) PhD Seminar: Machine Learning Mehryar Mohri T 1:45-3:45PM WWH 1314
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
(30237) Phd Thesis Research STAFF -

Prerequisites: Permission of the thesis adviser or director of graduate studies for the Ph.D. program.
CSCI-UA.0002-001
(72898) Intro To Computer Programming Deena Engel TR 9:30-10:45AM WWH 109

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
(72899) Intro To Computer Programming Samuel Marateck MW 12:30-1:45PM WWH 109

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
(72900) Intro To Computer Programming Adam Meyers MW 11:00-12:15PM WWH 109

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
(72901) Intro To Computer Programming Adam Meyers MW 2:00-3:15PM WWH 109

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
(72902) Intro To Computer Programming Adam Meyers TR 2:00-3:15PM WWH 109

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
(75360) Intro To Computer Programming Amos Bloomberg MW 9:30-10:45AM WWH 202

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
(75361) Intro To Computer Programming Andrew Case TR 11:00-12:15PM WWH 109

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.0004-001
(72903) Intro to Web Design & Computer Principles Nathan Hull TR 2:00-3:15PM WWH 101
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
(72904) Intro to Web Design & Computer Principles Nathan Hull MW 12:30-1:45PM WWH 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-003
(72905) Intro to Web Design & Computer Principles Craig Kapp TR 9:30-10:45AM WWH 101
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
(75385) Intro to Web Design & Computer Principles Heather Dewey-Hagborg MW 2:00-3:15PM WWH 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.0060-001
(72906) Database Design And Web Implementation Deena Engel TR 11:00-12:15PM WWH 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.0101-001
(72907) Intro To Computer Science Kenneth Perlin TR 11:00-12:15PM WWH 102

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
(72908) Intro To Computer Science Kenneth Perlin TR 11:00-12:15PM WWH 102

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
(72909) Intro To Computer Science Evan Korth MW 2:00-3:15PM WWH 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-004
(75998) Intro To Computer Science Samuel Marateck MW 9:30-10:45AM WWH 109

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
(72910) Data Structures Evan Korth TR 2:00-3:15PM WWH 102

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
(72911) Data Structures Evan Korth TR 2:00-3:15PM WWH 102

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
(72912) Data Structures Max Sklar R 9:30-10:45AM WWH 102

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
(75386) Data Structures Allan Gottlieb TR 3:30-4:45PM WWH 202

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
(75387) Data Structures Chanseok Oh T 9:30-10:45AM WWH 202

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
(72913) Computer Systems Organization Jinyang Li MW 3:30-4:45PM WWH 109
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
(72914) Computer Systems Organization Jinyang Li MW 3:30-4:45PM WWH 109
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
(72915) Operating Systems Benjamin Goldberg MW 12:30-1:45PM WWH 101
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
(72916) Operating Systems Benjamin Goldberg MW 12:30-1:45PM WWH 101
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
(72917) Basic Algorithms Alan Siegel TR 2:00-3:15PM WWH 1302

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
(72918) Basic Algorithms Alan Siegel TR 2:00-3:15PM WWH 1302

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
(72919) Basic Algorithms Vasileios Gkatzelis T 9:30-10:45AM WWH 102

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
(75388) Topics of General Computing Interest: Computing in the Humanities and Arts Deena Engel MW 11:00-12:15PM WWH 101
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.0421-001
(72920) Numerical Computing Marsha Berger TR 11:00-12:15PM WWH 317

The need for floating-point arithmetic, the IEEE floating-point standard, and the importance of numerical computing in a wide variety of scientific applications. Fundamental types of numerical algorithms: direct methods (e.g., for systems of linear equations), iterative methods (e.g., for a nonlinear equation), and discretization methods (e.g., for a differential equation). Numerical errors: can you trust your answers? Uses graphics and software packages such as Matlab. Programming assignments.

Prerequisites: Computer Systems Organization (CSCI-UA 201), either Calculus I (MATH-UA 121) or both of Mathematics for Economics I and II (MATH-UA 211 and 212), and Linear Algebra (MATH-UA 140), or permission of instructor.
CSCI-UA.0480-001
(75390) Special Topics: Introduction to Computer Vision Davi Geiger MW 11:00-12:15PM WWH 317
Detailed course descriptions are available when advanced topics are announced each semester. Typical offerings include, but are not limited to, Bioinformatics, Building Robots, Computer Graphics, Machine Learning, Network Programming, Computer Vision, and Multimedia for Majors.

Prerequisites: Topics determine prerequisites.
CSCI-UA.0480-002
(75392) Special Topics: iPhone Programming Nathan Hull MW 3:30-4:45PM WWH 102
Detailed course descriptions are available when advanced topics are announced each semester. Typical offerings include, but are not limited to, Bioinformatics, Building Robots, Computer Graphics, Machine Learning, Network Programming, Computer Vision, and Multimedia for Majors.

Prerequisites: Topics determine prerequisites.
CSCI-UA.0480-003 Special Topics: Introduction to Computer Graphics CANCELLED - WWH
Detailed course descriptions are available when advanced topics are announced each semester. Typical offerings include, but are not limited to, Bioinformatics, Building Robots, Computer Graphics, Machine Learning, Network Programming, Computer Vision, and Multimedia for Majors.

Prerequisites: Topics determine prerequisites.
CSCI-UA.0480-004
(76235) Special Topics: Introduction to Motion Capture Christoph Bregler MW 2:00-3:15PM 719BWY 1221
Detailed course descriptions are available when advanced topics are announced each semester. Typical offerings include, but are not limited to, Bioinformatics, Building Robots, Computer Graphics, Machine Learning, Network Programming, Computer Vision, and Multimedia for Majors.

Prerequisites: Topics determine prerequisites.
CSCI-UA.0521-001
(72924) Undergraduate Research STAFF -
The student is supervised by a faculty member actively engaged in research, possibly leading to results publishable in the computer science literature. A substantial commitment to this work is expected. The research project may be one or two semesters, to be determined in consultation with the faculty supervisor. Students taking this course for honors in computer science are required to write an honors thesis. All other students need to submit a write-up of the research results at the conclusion of the project.

Prerequisites: Permission of the department.
CSCI-UA.0998-001
(72925) Independent Study STAFF -

Students majoring in the department are permitted to work on an individual basis under the supervision of a full-time faculty member in the department if they have maintained an overall GPA of 3.0 and a GPA of 3.5 in computer science and have a study proposal that is approved by the director of undergraduate studies. Students are expected to spend about three to six hours a week on their project.

Prerequisites: Permission of the department. Does not satisfy the major elective requirement.
MAP-UA.0109-001
(77360) Quantitative Reasoning: Mathematics and Computing using Python Samuel Marateck MW 11:00-12:15PM WWH 512

Teaches mathematical concepts using the Python programming language. Introduces students to use the basic features of Python operations with numbers and strings, variables, Boolean logic, control structures, loops, and functions. These operations are then applied to the mathematical principles of growth and decay, geometric progressions, compound interest, exponentials, permutations, and probability.
MAP-UA.0109-002
(77593) Quantitative Reasoning: Mathematics and Computing using Python Venkatesh Iyer R 9:30-10:45AM 194M 304

Teaches mathematical concepts using the Python programming language. Introduces students to use the basic features of Python operations with numbers and strings, variables, Boolean logic, control structures, loops, and functions. These operations are then applied to the mathematical principles of growth and decay, geometric progressions, compound interest, exponentials, permutations, and probability.

*

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.