Course Schedule

Current semester Fall 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.1133-001
(1201) PAC I Evan Korth T 6:30-9:00PM WWH 201

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

An accelerated introduction to the fundamental concepts of computer science for students who lack a formal background in the field. Topics include algorithm design and program development; data types; control structures; subprograms and parameter passing; recursion; data structures; searching and sorting; dynamic storage allocation and pointers; abstract data types, such as stacks, queues, lists, and tree structures; generic packages; and an introduction to the principles of object-oriented programming. The primary programming language used in the course will be Java. Students should expect an average of 12-16 hours of programming and related course work per week.
CSCI-GA.1170-001
(1202) Fundamental Algorithms Chee Yap T 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
(1204) Fundamental Algorithms Recitation Ziyao Wei R 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
(1203) Fundamental Algorithms Yevgeniy Dodis 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
(13780) Fundamental Algorithms Recitation Arka Bandyopadhyay W 7:10-8: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.1180-001
(1205) Mathematical Techniques For CS Applications Zvi Kedem M 5:00-6:50PM WWH 102

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

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

Prerequisites: Students taking this class should already have substantial programming experience.
CSCI-GA.2110-004
(18961) Programming Languages Recitation Liana Hadarean W 5:00-5:50PM WWH 201

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
(1208) Scientific Computing Michael Shelley R 5:10-7:00PM WWH 202
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
(1209) Compiler Construction Martin Hirzel W 5:00-6:50PM 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.2233-001
(20132) Computer Systems Design Hubertus Franke W 7:10-9:00PM WWH 201

This course gives students whose interest is in software an introduction to hardware and the logical design of digital computers. Topics include design of basic logic modules and arithmetic units; fixed and microprogrammable control structures; computer architecture; memory organization; and input-output organization. Nowadays programmers need to understand architectural features and how they can and will impact program efficiency. Examples of such features are caches, TLBs, microProcessor architecture (pipelined execution), branch prediction and multi-core design. After class completion the student should have learned the important organizational features of modern computer systems. He/she will also learned the interaction between software, compiled to assembler instrutions, and the underlying computer architecture.

Prerequisites: CSCI-GA.1170 Algorithms, proficiency in a high level programming language like C, C++, Java, some basic understanding of assembler programming.
CSCI-GA.2250-001
(1210) Operating Systems Mohamed Zahran T 7:10-9:00PM 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
(20409) Data Communications and Networks Arthur Goldberg F 5:00-6:50PM WWH 102

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.2271-001
(13750) Computer Vision Davi Geiger R 7:10-9:00PM 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.2390-001
(13751) Logic In Computer Science Bhubaneswar Mishra M 5:00-6:50PM WWH 312
A beginning graduate-level course in mathematical logic with motivation provided by applications in computer science. There are no formal prerequisites, but the pace of the class requires that students can cope with a significant level of mathematical sophistication. Topics include propositional and first-order logic; soundness, completeness, and compactness of first-order logic; first-order theories; undecidability and Godel’s incompleteness theorem; and an introduction to other logics such as second-order and temporal logic.

Prerequisites: Strong mathematical background and instructor permission for master’s students
CSCI-GA.2420-001
MATH-GA 2010-001
(1212) Numerical Methods I Olof Widlund R 5:10-7:00PM WWH 101
Numerical linear algebra. Approximation theory. Quadrature rules and numerical integration. Nonlinear equations and optimization. Ordinary differential equations. Elliptic equations. Iterative methods for large, sparse systems. Parabolic and hyperbolic equations.

Prerequisites: Corequisite: linear algebra.
CSCI-GA.2433-001
(20376) Database Systems Jean-Claude Franchitti F 3:00-4:50PM 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.2434-001
(1213) Advanced Database Systems Dennis Shasha T 5:00-6:50PM WWH 101
This is a capstone course emphasizing large-scale database systems. This course studies the internals of database systems as an introduction to research and as a basis for rational performance tuning. Topics include concurrency control, fault tolerance, operating system interactions, query processing, and principles of tuning. Database capstone projects involve topics such as design, concurrency control, interactions, and tuning. These projects include some or all of the following elements: formation of a small team, project proposal, literature review, interim report, project presentation, and final report.

Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
CSCI-GA.2565-001
(1214) Machine Learning Yann LeCun M 5:00-6:50PM WWH 109

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

Prerequisites: Undergraduate course in linear algebra and strong programming skills for implementation of algorithms studied in class. Strong knowledge of probability. Recommended: knowledge of vector calculus, elementary statistics.
CSCI-GA.2945-001
MATH-GA 2011-003 Advanced Topics in Numerical Analysis: Numerical PDE CANCELLED M 1:25-3:15PM WWH 517
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-002
MATH-GA 2011-001
(15945) Advanced Topics in Numerical Analysis: Fast Algorithms Mark Tygert T 1:25-3:15PM WWH 517
Topics vary each semester.

Prerequisites: Topics determine prerequisites.
CSCI-GA.2945-003
MATH-GA 2011-002
(1216) Advanced Topics in Numerical Analysis: Course-Grained Models of Materials Aleksandar Donev W 1:25-3:15PM WWH 517
Topics vary each semester.

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

Prerequisites: CSCI-GA 1170 and an ability to prototype algorithms rapidly.
CSCI-GA.3033-001
(1219) Special Topics: Statistical Natural Language Processing Slav Petrov T 5:00-6:50PM WWH 312

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-002
(1220) Special Topics: Computational Photography Robert Fergus R 5:00-6:50PM 719BWY 1221

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-003
(1221) Special Topics: Financial Software Projects Scott Burton T 7:10-9:00PM WWH 312

Topics vary each semester.

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

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-005
(1223) Special Topics: Open Source Tools Jeffrey Korn R 7:10-9:00PM WWH 102

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-006
(1224) Special Topics: Application Servers Jean-Claude Franchitti M 7:10-9:00PM Silv 515

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-007
(1225) Special Topics: Distributed Systems Lakshminarayanan Subramanian R 7:10-9:00PM WWH 1302

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-008 Special Topics: Social Multiplayer Games CANCELLED R 7:10-9:00PM WWH 202

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-009
(1227) Special Topics: Motion Capture for Gaming & Urban Sensing Christoph Bregler W 5:00-6:50PM WWH 101

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3033-011
(20399) Special Topics: Systems Projects Lakshminarayanan Subramanian W 5:00-6:50PM WWH 317

Topics vary each semester.

Prerequisites: Prerequisites vary according to topic.
CSCI-GA.3205-001
(1229) Applied Cryptography & Network Security Zvi Kedem M 7:10-9:00PM WWH 102
This course first introduces the fundamental mathematical cryptographic algorithms, focusing on those that are used in current systems. To the extent feasible, the mathematical properties of the cryptographic algorithms are justified, using elementary mathematical tools. Second, actual security mechanisms and protocols, mainly those employed for network traffic that rely on the previously introduced cryptographic algorithms, are presented. The topics covered include introduction to basic number-theoretical properties, public/private and symmetric key systems, secure hash functions, digital signature standards, digital certificates, IP security, e-mail security, Web security, and stand-alone computer privacy and security tools.
CSCI-GA.3520-001
(1230) Honors Analysis of Algorithms Alan Siegel MW 3:30-4:45PM WWH 201
Design of algorithms and data structures. Review of searching, sorting, and fundamental graph algorithms. In-depth analysis of algorithmic complexity, including advanced topics on recurrence equations and NP-complete problems. Advanced topics on lower bounds, randomized algorithms, amortized algorithms, and data structure design as applied to union-find, pattern matching, polynomial arithmetic, network flow, and matching.

Prerequisites: Permission of the instructor for master’s students.
CSCI-GA.3812-001
(1231) Information Technology Projects Jean-Claude Franchitti R 6:00-9:00PM WWH 317

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.3850-001
(1241) PhD Seminar: Cryptography Yevgeniy Dodis T 1:00-3:25PM WWH 512
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
(1242) PhD Seminar: Systems Lakshminarayanan Subramanian 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
(1243) PhD Seminar: Theory CANCELLED 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
(1244) 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-006
(1245) 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-UA.0002-001
(8265) Intro To Computer Programming Nathan Hull MW 3:30-4:45PM WWH 101

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
(8266) Intro To Computer Programming Craig Kapp MW 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-003
(8267) Intro To Computer Programming Samuel Marateck 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-004
(8268) Intro To Computer Programming Amos Bloomberg 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
(8269) Intro To Computer Programming Samuel Marateck TR 2:00-3:15PM WWH 101

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
(8270) Intro To Computer Programming Craig Kapp 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-007
(8271) Intro To Computer Programming Jack Shutzman TR 3:30-4: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.0004-001
(8272) Intro to Web Design & Computer Principles Nathan Hull MW 12:30-1: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.0004-002
(8273) Intro to Web Design & Computer Principles Deena Engel 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
(8274) 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
(8275) Intro to Web Design & Computer Principles Heather Dewey-Hagborg 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
(18970) Intro to Web Design & Computer Principles Joshua Clayton MW 3:30-4:45PM 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.0061-001
(8276) Web Development And Programming Deena Engel TR 11:00-12: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
(8277) Intro To Computer Science Victor Shoup 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
(8278) Intro To Computer Science Victor Shoup 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
(8279) Intro To Computer Science Kenneth Perlin MW 2:00-3: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-004
(8280) Intro To Computer Science Marsha Berger MW 9:30-10:45AM 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
(8281) Data Structures Ernest Davis 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
(8282) Data Structures Ernest Davis 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
(8283) Data Structures Azam Asl 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.0102-004
(8284) Data Structures Evan Korth MW 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
(8285) Data Structures Max Sklar T 3:30-4:45PM WWH 1302

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
(8286) Computer Systems Organization Benjamin Goldberg 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
(8287) Computer Systems Organization Benjamin Goldberg 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
(8288) Operating Systems Allan Gottlieb TR 2:00-3: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
(8289) Operating Systems Allan Gottlieb TR 2:00-3: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
(8290) Basic Algorithms Esther Ezra MW 2:00-3:15PM WWH 201

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
(8291) Basic Algorithms Esther Ezra MW 2:00-3:15PM WWH 201

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
(8292) Basic Algorithms Kalyan Pabbisetty R 9:30-10:45AM 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.0380-001
(8293) Topics of General Interest: Flash Programming Nathan Hull TR 2:00-3:15PM WWH 317
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.0436-001
(8294) Computer Architecture Allan Gottlieb TR 3:30-4:45PM WWH 317

The structure and design of computer systems. Basic logic modules and arithmetic circuits. Control unit design and structure of a simple processor; speed-up techniques. Storage technologies and structure of memory hierarchies; error detection and correction. Input/output structures, busses, programmed data transfer, interrupts, DMA, and microprocessors. Discussion of various computer architectures; stack, pipeline, and parallel machines; and multiple functional units. Not offered every academic year.

Prerequisites: <p>Computer Systems Organization (CSCI-UA 201) and Discrete Mathematics (MATH-UA 120).</p>
CSCI-UA.0453-001
(8295) Theory Of Computation Richard Cole MW 2:00-3:15PM WWH 317

A mathematical approach to studying topics in computer science, such as regular languages and some of their representations (deterministic finite automata, nondeterministic finite automata, regular expressions) and proof of nonregularity. Context-free languages and pushdown automata; proofs that languages are not context-free. Elements of computability theory. Brief introduction to NP-completeness.

Prerequisites: Basic Algorithms (CSCI-UA 310) and Computer Systems Organization (CSCI-UA.201).
CSCI-UA.0470-001
(8296) Object Oriented Programming Robert Grimm TR 11:00-12:15PM WWH 201

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

Prerequisites: Computer Systems Organization (CSCI-UA 201).
CSCI-UA.0480-001
(8297) Special Topics: Sp Tpcs: Computing With Large Data Sets Richard Bonneau 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
(8298) Special Topics In CS: Intro To Machine Learning Mehryar Mohri MW 3:30-4:45PM WWH 109
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.
FRSEM-UA.0385-001
(9494) Computational Thought Dennis Shasha T 3:30-4:45PM WWH 101

Computational technology and methods lie at the core of modern science, commerce, entertainment, and, regrettably, war. There are very powerful ideas underlying the field that have roots in mathematics, linguistics, engineering, and even philosophy. Some of its greatest inventions were born in cafés or as responses to a puzzle. Some recent algorithmic methods come from studying ants and evolution. This course introduces computational thinking as it builds on logic, linguistics, heuristics, artificial intelligence, and biological computing. The learning style combines straight lecture, interactive discussions of puzzles and games, and short computer programs (in the programming language Python which you will learn). Students make a few presentations during the semester about topics such as the solutions to computationally motivated puzzles, the relative power of linguistic descriptions, and their very own simulations of either an auction or a multi-bank elevator. The goal is for students to learn to think about computation from multiple perspectives and to synthesize those perspectives when faced with unsolved challenges.

Prerequisites: AP calculus, discrete mathematics, or programming experience.
FRSEM-UA.0385-002
(9494) Computational Thought Dennis Shasha R 3:30-4:45PM WWH 412

Computational technology and methods lie at the core of modern science, commerce, entertainment, and, regrettably, war. There are very powerful ideas underlying the field that have roots in mathematics, linguistics, engineering, and even philosophy. Some of its greatest inventions were born in cafés or as responses to a puzzle. Some recent algorithmic methods come from studying ants and evolution. This course introduces computational thinking as it builds on logic, linguistics, heuristics, artificial intelligence, and biological computing. The learning style combines straight lecture, interactive discussions of puzzles and games, and short computer programs (in the programming language Python which you will learn). Students make a few presentations during the semester about topics such as the solutions to computationally motivated puzzles, the relative power of linguistic descriptions, and their very own simulations of either an auction or a multi-bank elevator. The goal is for students to learn to think about computation from multiple perspectives and to synthesize those perspectives when faced with unsolved challenges.

Prerequisites: AP calculus, discrete mathematics, or programming experience.
MAP-UA.0109-001
(9726) 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
(9727) Quantitative Reasoning: Mathematics and Computing using Python Abhishek Saksena W 3:30-4:45PM 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.