Course Schedule

Current semester Spring 2012, 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
(1405) PAC II Benjamin Goldberg M 6:00-8:30PM WWH 512

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.1144-002
(16886) PAC II Recitation Prathyusha Nalla R 7:10-8: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
(1406) Fundamental Algorithms Esther Ezra M 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
(1407) Fundamental Algorithms Recitation Esther Ezra W 5:00-5: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-003
(19793) Fundamental Algorithms Ernest Davis M 7:10-9:00PM WWH 101

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
(19794) Fundamental Algorithms Recitation Rameez Loladia W 6: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.2110-001
(1408) Programming Languages Clark Barrett 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
(1409) Programming Languages Recitation Liana Hadarean T 8:10-9:00PM WWH 102

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
(1410) Programming Languages Recitation CANCELLED T 8:10-9:00PM WWH 202

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
(1410) Scientific Computing Aleksandar Donev R 5:10-7:00PM WWH 101
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
(1411) Compiler Construction Mohamed Zahran W 7:10-9:00PM WWH 312
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
(1412) 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
(1413) Data Communications and Networks Jean-Claude Franchitti T 7:10-9:00PM WWH 109

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
(1414) Computer Graphics Kenneth Perlin R 5:00-6:50PM WWH 109

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.2421-001
MATH-GA 2020-001
(1416) Numerical Methods II Jonathan Goodman 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
(1417) Database Systems Jean-Claude Franchitti 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
(1418) Software Engineering Jean-Claude Franchitti T 5:00-6:50PM WWH 202
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
BIOL-GA 1127-001
(1419) Bioinformatics and Genomes Richard Bonneau F 1:00-3:45PM WWH 102
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.2560-001
(16890) Artificial Intelligence Ernest Davis W 5:00-6:50PM WWH 102

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

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.2590-001
(16891) Natural Language Processing Adam Meyers M 7:10-9:00PM WWH 202

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.2631-001
(1424) Distributed Computing Alberto Lerner M 5:00-6:50PM WWH 412

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.2945-001
MATH-GA 2012-001
(1426) Adv. Top. In Num. Analysis: Computational Electromagnetics Leslie Greengard T 9:30-11:20AM WWH 512
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-002
MATH-GA 2012-002
(1427) Adv. Top. In Num. Analysis: Computational Neuroscience Aaditya Rangan W 1:25-3:15PM WWH 517
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.3033-001
(1428) Special Topics: Financial Computing Eran Fishler W 7:10-9:00PM WWH 101

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-002
(1429) Special Topics: Robotics Yann LeCun T 5:00-6:50PM 719BWY 1221

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-003
(17022) Special Topics: Algorithmic & Economic Aspects of the Internet Vahab Mirrokni R 5:10-7:00PM WWH 1302

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-004
(1430) Special Topics: Bioniformatics CANCELLED W 5:00-6:50PM 719BWY 1221

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-005
(1431) Special Topics: Production Quality Software Michael Schidlowsky R 7:10-9:00PM WWH 317

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-006
(1432) Special Topics in Machine Learning: Probabilistic Graphical Models David Sontag R 5:00-6:50PM WWH 312

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-007
MATH-GA 2932-002
(1433) Special Topics: Random Graphs Joel Spencer T 5:00-6:50PM WWH 317

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-008
(1434) Special Topics: Social Multiplayer Games Yoav Zibin T 5:00-6:50PM WWH 102

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-009
(17023) Special Topics in Computer Animation Christoph Bregler M 7:10-9:00PM 719BWY 1221

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-010
(19151) Special Topics: Computer Games Hubertus Franke W 7:10-9:00PM WWH 1302

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-011
(19241) Special Topics: Rigorous Software Development Thomas Wies M 5:00-6:50PM WWH 317

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-012
(19427) Special Topics: Graphics Processing Units (GPUs): Architecture and Programming Mohamed Zahran R 7:10-9:00PM WWH 1302

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-013
(19790) Special Topics: Social Networks Bhubaneswar Mishra W 5:00-6:50PM WWH 202

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-014
(19791) Special Topics: Object Oriented Programming Benjamin Goldberg
Robert Grimm M 1:20-3:10PM WWH 1302

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3110-001
(1435) 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
MATH-GA 2170-001
(16898) Introduction To Cryptography Yevgeniy Dodis W 5:00-6:50PM WWH 201
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
(1436) Honors Operating Systems CANCELLED 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.3700-001
MCC-GE 2295-001
(19147) Values Embodied in Information and Communication Technologies (4 credits) Helen Nissenbaum T 2:00-4:10PM WWH 1302

Studies social, political & ethical values embodied in computer & information systems, & new media. Students examine work in the philosophy & social study of technology to understand the rich & sometimes troubling relationship between values & technical design. Course will ask: Is technology neutral? Who should make key decisions? What is the role of scientists & engineers? The course examines specific cases, such as, the Internet, search engines, web- cookies, & data mining from philosophical, empirical, & technical perspectives.

Cross-listing for MCC-GE 2295.

Prerequisites: TBA
CSCI-GA.3812-001
(1437) Information Technology Projects Evan Korth W 6:00-9:00PM WWH 517

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
(1438) Adv Lab MS Faculty -

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
(1439) Adv Lab MS Faculty -

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
(1440) Adv Lab MS Faculty -

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
(1441) Adv Lab MS Faculty -

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
(1442) Adv Lab PhD Faculty -

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
(1443) Adv Lab PhD Faculty -

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
(1444) Adv Lab PhD Faculty -

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
(1445) Adv Lab PhD Faculty -

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
(1446) Master's Thesis Research Faculty -

Prerequisites: Approval of a faculty adviser and the Director of Graduate Studies for the M.S. programs.
CSCI-GA.3850-001
(1428) PhD Seminar: Cryptography Yevgeniy Dodis T 1:00-3:25PM WWH 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-002
(1429) PhD Seminar: Systems Robert Grimm T 12:30-1:45PM 719BWY 1221
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
(17022) PhD Seminar: Theory Richard Cole R 2:00-3:25PM WWH 312
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
(1430) PhD Seminar: Formal Methods Clark Barrett R 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-006
(1431) PhD Seminar: Machine Learning Mehryar Mohri T 3:45-5:00PM 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
(1451) Phd Thesis Research Faculty -

Prerequisites: Permission of the thesis adviser or director of graduate studies for the Ph.D. program.
CSCI-UA.0001-001 Computers And Society CANCELLED -

Addresses the impact of the digital computer on individuals, organizations, and modern society as a whole, and the social, political, and ethical issues involved in the computer industry. Topics change to reflect changes in technology and current events. Features guest lecturers from various fields. Not offered every academic year.

Prerequisites: No prior computing experience is assumed. Not intended for computer science majors.
CSCI-UA.0002-001
(6580) Intro To Computer Programming Deena Engel 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-002
(6581) Intro To Computer Programming Samuel Marateck TR 2:00-3:15PM WWH 102

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
(6582) Intro To Computer Programming Craig Kapp MW 12:30-1:45PM 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-004
(6583) Intro To Computer Programming Craig Kapp 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-005
(6584) Intro To Computer Programming Joel Kemp MW 9:30-10:45AM WWH 102

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
(6585) Intro To Computer Programming Amos Bloomberg MW 3:30-4:45PM 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
(6586) Intro To Computer Programming Jerry Waxman TR 3:30-4:45PM 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.0004-001
(6587) Intro to Web Design & Computer Principles Nathan Hull MW 12:30-1:45PM WWH 109
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
(6588) Intro to Web Design & Computer Principles Craig Kapp MW 11:00-12:15PM WWH 109
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
(6589) Intro to Web Design & Computer Principles Amos Bloomberg MW 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
(6590) Intro to Web Design & Computer Principles Joshua Clayton TR 3:30-4: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-005
(14404) Intro to Web Design & Computer Principles Joshua Clayton MW 3:30-4:45PM 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.0060-001
(6591) Database Design And Web Implementation Deena Engel TR 11:00-12:15PM WWH 109

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-003
(13446) Web Development And Programming Nathan Hull TR 2:00-3:15PM WWH 109

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
(6592) Intro To Computer Science Allan Gottlieb TR 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-002
(6593) Intro To Computer Science Allan Gottlieb TR 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-003
(6594) Intro To Computer Science Samuel Marateck TR 11:00-12: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
(6595) 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.0102-001
(6596) Data Structures Marsha Berger MW 11:00-12: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
(6597) Data Structures Marsha Berger MW 11:00-12: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
(6598) Data Structures Recitation Kshitij Bansal R 11:00-12: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-004
(6599) Data Structures Chee Yap MW 3:30-4:45PM WWH 109

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
(6600) Data Structures Recitation Chang Peng R 3:30-4:45PM WWH 101

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
(6601) Computer Systems Organization Jinyang Li MW 11:00-12:15PM WWH 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-002
(6602) Computer Systems Organization Jinyang Li MW 11:00-12:15PM WWH 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.0202-001
(6603) Operating Systems Lakshminarayanan Subramanian TR 11:00-12:15PM WWH 202
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
(6604) Operating Systems Lakshminarayanan Subramanian TR 11:00-12:15PM WWH 202
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
(6605) Basic Algorithms Alan Siegel MW 2:00-3:15PM WWH 202

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
(6606) Basic Algorithms Alan Siegel MW 2:00-3:15PM WWH 202

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
(6607) Basic Algorithms Recitation Alan Siegel R 2:00-3:15PM WWH 202

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.0421-001
(6609) Numerical Computing Margaret Wright TR 2:00-3:15PM WWH 201

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.0472-001
(13469) Artificial Intelligence Davi Geiger TR 3:30-4:45PM 719BWY 1221
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.0480-001
(6610) Special Topics: Spec Topics:Computer Vision Robert Fergus MW 11:00-12: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.0480-002
(6611) Special Topics: Sp Tpcs: 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
(6612) Special Topics: Spec Topics In Comp Sci: Computer Graphics Denis Zorin 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.
MAP-UA.0109-001
(8091) Quantitative Reasoning: Mathematics and Computing using Python Samuel Marateck MW 12:30-1:45PM WWH 102

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
(8092) Quantitative Reasoning: Mathematics and Computing using Python Venkatesh Iyer R 9:30-10:45AM Tisch LC19

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.