Course Schedule

Current semester Spring 2016, and future semesters are now available to view.

View undergraduate course grid View graduate course grid

• CSCI-GA.1144-​001
  (2506) PAC II*  Mohamed Zahran
  Office Hours T 6:00-8:30PM CIWW 312
  

  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: <p>CSCI-GA 1133 or departmental permission.</p>
• CSCI-GA.1144-​002
  (3077) PAC II Recitation  Scott Buckfelder
  Office Hours R 7:10-8:00PM CIWW 312
  

  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: <p>CSCI-GA 1133 or departmental permission.</p>
• CSCI-GA.1170-​001
  (2507) Fundamental Algorithms  Yevgeniy Dodis
  Office Hours M 5:10-7:00PM CIWW 109
  

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

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

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

  
  
  Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
• CSCI-GA.2110-​001
  (2509) Programming Languages  Benjamin Goldberg
  Office Hours W 7:10-9:00PM CIWW 101
  

  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
  (2510) Programming Languages Recitation  Paul Fisher R 6:10-7:00PM CIWW 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.2130-​001
  (2511) Compiler Construction  Kristoffer Rose
  Office Hours
  Eva Rose M 7:10-9:00PM CIWW 202
  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
  (2512) Operating Systems  Hubertus Franke
  Office Hours M 7:10-9:00PM CIWW 109
  

  The topics covered include the high-level design of key operating systems concepts such OS structures; process scheduling and synchronization; deadlocks and their prevention; memory management, including (demand) paging; and I/O and file systems. The concepts will be shown in the context of Unix/Linux. The learning is facilitated with labs that implement some of these key design principles and algorithms in C/C++.

  
  
  Prerequisites: None
• CSCI-GA.2250-​002
  (18717) Operating Systems  Allan Gottlieb
  Office Hours T 5:10-7:00PM CIWW 517
  

  The topics covered include the high-level design of key operating systems concepts such OS structures; process scheduling and synchronization; deadlocks and their prevention; memory management, including (demand) paging; and I/O and file systems. The concepts will be shown in the context of Unix/Linux. The learning is facilitated with labs that implement some of these key design principles and algorithms in C/C++.

  
  
  Prerequisites: None
• CSCI-GA.2262-​001
  (2513) Data Communications and Networks  Jean-Claude Franchitti
  Office Hours R 5:10-7:00PM CIWW 101
  

  This course teaches the design and implementation techniques essential for engineering robust networks. Topics include networking principles, Transmission Control Protocol/Internet Protocol, naming and addressing (Domain Name System), data encoding/decoding techniques, link layer protocols, routing protocols, transport layer services, congestion control, quality of service, network services, programmable routers and overlay networks.

  
  
  Prerequisites: Students must have a working knowledge of fundamental data structures and associated algorithms. For some of the practical aspects of the course, a working knowledge of an object-oriented programming language (e.g., C++, C#, or preferably Java) is expected. An undergraduate course in data communication and networks is helpful but not required.
• CSCI-GA.2421-​001
  MATH-GA 2020-001
  (2514) Numerical Methods II  Jonathan Goodman T 5:10-7:00PM CIWW 202
  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
  (2515) Database Systems  Jean-Claude Franchitti
  Office Hours R 7:10-9:00PM CIWW 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
  (2516) Software Engineering   Jean-Claude Franchitti
  Office Hours M 7:10-9:00PM CIWW 312
  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
  (2517) Bioinformatics and Genomes  Richard Bonneau F 1:00-3:45PM CIWW 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.2580-​001
  (3454) Web Search Engines  Ernest Davis
  Office Hours M 5:10-7:00PM CIWW 102
  

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

  
  
  Prerequisites: Recommend CSCI-GA 1180.
• CSCI-GA.2590-​001
  (3078) Natural Language Processing  Ralph Grishman
  Office Hours T 5:10-7:00PM CIWW 109
  

  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.2620-​001
  (3162) Networks and Mobile Systems  Lakshminarayanan Subramanian
  Office Hours R 7:10-9:00PM CIWW 201
  

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

  
  
  Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250.
• CSCI-GA.2945-​001
  MATH-GA 2012-001
  (2518) Variational Inverse Problems  Georg Stadler R 9:00-10:50AM CIWW 517
  Topics vary each semester.
  
  Prerequisites: Topics determine prerequisites.
• CSCI-GA.2945-​002
  MATH-GA 2012-002
  (2519) Convex and Non-Smooth Optimization  Michael Overton
  Office Hours M 5:10-7:00PM CIWW 317
  Topics vary each semester.
  
  Prerequisites: Topics determine prerequisites.
• CSCI-GA.3033-​001
  (2520) Special Topics: Big Data Science  Anasse Bari
  Office Hours W 7:10-9:00PM CIWW 312
  Data Science has recently gained a substantial interest in a variety of industries including healthcare, finance, manufacturing and marketing. It is positioned at the intersection point of computer science, data mining, machine learning, predictive analytics, business, statistics and domain expertise. It aims at finding hidden knowledge (patterns, models, associations) for the purpose of making better decisions. This course will introduce the basic fundamental concepts of the algorithms and the tools of extracting valuable insights from data with the ability to formulating and solving problems with it. Topics of this course include, but are not limited to: Basics of Data Analytics Project Lifecycle, Developing an Analytics Roadmap, Data Preprocessing, Data Analytics Use cases, Data Cleaning Algorithms, Feature Selection Algorithms, Introduction to Hadoop in Theory and in Practice, Algorithms for Finding Similar Data Items, Dimensionality Reduction techniques, Clustering Algorithms, Classification Algorithms, Introduction to Sentiment Analysis in short text (e.g Tweets), Mining Association Rules, Performance Measures, Ensemble Methods, Information retrieval systems and Recommendation Systems with applications in Bio-informatics, Text Mining and Social Network Analytics. This course will be complemented with hands-on experience of using data analytics tools that are widely used in the industry such as R, Weka, RapidMiner and others.
• CSCI-GA.3033-​002
  (3267) Special Topics: Social Networks  Bhubaneswar Mishra
  Office Hours M 5:10-7:00PM CIWW 202
  Social Networks is a specific example of many forms of networks that have become ubiquitous in our modern society. The World Wide Web enables information flows among vast number of humans; Facebook, Orkut, Friendster, diaspora, etc. connect small groups of friends; amazon, eBay, etc. provide opportunities for trading, etc. These networks determine our information, influence our opinions, and shape our political attitudes. They also link us, often through important but weak ties, to other humans. Their origin is biological: going back to quorumsensing, swarming, flocking, social grooming, gossip, etc. Yet, as we have connected our social networks to traditional human institutions (markets, justice systems, education, etc.) through new technologies, the underlying biology has become obscured, but not dormant. Economic markets also look much more like networks than anonymous marketplaces. Firms interact with the suppliers and customers in a Web-like supply chains. Systemic risk in financial markets often results from the counterparty risks created within this financial network. This course will introduce the tools for the study of networks. It will show how certain common principles permeate the functioning of these diverse networks: e.g., issues related to robustness, fragility, and interlinkages etc.
• CSCI-GA.3033-​003
  (2521) Special Topics: Production Quality Software  Michael Schidlowsky
  Office Hours W 5:10-7:00PM CIWW 512
  In this course, students learn to develop production quality software. Lectures present real-world development practices that maximize software correctness and minimize development time. A special emphasis is placed on increasing proficiency in a particular programming language by doing weekly development projects and participating in code reviews. Assignments become more sophisticated as the semester progresses, eventually incorporating unit tests, build scripts, design patterns, and other techniques. The course culminates with an assignment that requires students to contribute to an open-source project of their choice.
• CSCI-GA.3033-​004
  (2522) Special Topics: Social Multiplayer Games  Yoav Zibin
  Office Hours T 5:10-7:00PM CIWW 317
  The course will teach how to develop online casual multiplayer games using open technologies such as HTML5, JavaScript, Typescript, AngularJS, Ionic, Bootstrap, PhoneGap, Grunt, and testing using Karma, Jasmine, Protractor. Students will build several turn based games and submit them to Google play store. There is no final exam, only assignments. The course will also teach about artificial-intelligence for games, ranking systems, physics-based engines, and integrating with social platforms. The course will not concern with 3D graphics.
• CSCI-GA.3033-​005
  (2523) Special Topics: Realtime and Big Data Analytics  Suzanne McIntosh
  Office Hours R 7:10-9:00PM CIWW 101
  This course will introduce technologies at the foundation of the Big Data movement that have facilitated scalable management of vast quantities of data collected through realtime and near realtime sensing. We will also explore the tools enabling the acquisition of near realtime data in the social domain, the fusion of those data when in flight and at rest, and their meaningful representation in graphical visualizations. Students are required to complete weekly reading and/or programming assignments and demonstrate mastery of course topics by developing and demonstrating a software project of their choosing. Class time will be set aside for project proposal and final demo.
  
  Prerequisites: CSCI-GA 2250 or equivalent Operating Systems course; programming experience in C/C++ or Java for assignments and final project; CSCI-GA 2262, CSCI-GA 2620, or undergraduate course in networks. A familiarity with databases and Linux will be useful.
• CSCI-GA.3033-​006
  (3458) Special Topics: Search Engine Architecture  CANCELLED -
  CANCELLED
• CSCI-GA.3033-​007
  (3456) Special Topics: Advanced Machine Learning  Mehryar Mohri
  Office Hours T 5:10-7:00PM CIWW 101
  This course introduces and discusses advanced topics in machine learning. The objective is both to present some key topics not covered by basic graduate ML classes such as Foundations of Machine Learning, and to bring up advanced learning problems that can serve as an initiation to research or to the development of new techniques relevant to applications.
• CSCI-GA.3033-​008
  (3311) Special Topics: .Net Web Applications Development  Cory Plock
  Office Hours M 5:10-7:00PM CIWW 101
  This course introduces the concepts and tools necessary for building robust web applications using the Microsoft .NET Framework. Among the topics explored will be the multi-language .NET architecture, build and deployment process, the C# programming language, Entity Framework, Model-View-Controller (MVC) design pattern, web services, Git version control, and the Azure cloud platform. This is a hands-on project-based course where students will collaborate to build a fully functional web solution.
  
  Prerequisites: Skills: programming languages, object-oriented programming, relational databases, and data structures.
• CSCI-GA.3033-​009
  (18718) Special Topics: Multicore Processors: Architecture and Programming  Mohamed Zahran
  Office Hours W 5:10-7:00PM CIWW 1302
  The tremendous advances in process technology have created a revolution both in hardware and in software. On the hardware side, we moved from single core processors to multicore/manycore processors. Multicore chips are now everywhere. You can find them in smartphones, playstations, notebooks, all the way up to supercomputers. To benefit from these chips, software must be parallelized, which starts another revolution in software. The purpose of this course is to introduce you to both the hardware advances and parallel programming techniques targeting multicore and manycore processors. You will learn how to make the best use of the underlying hardware to build applications that are faster, more powerefficient, and more reliable.
• CSCI-GA.3033-​011
  (3732) Special Topics: Rigorous Software Development  Thomas Wies
  Office Hours M 7:10-9:00PM CIWW 317
  Software is increasingly pervading our lives and is now routinely deployed in safety and security critical systems. While this technological progress benefits society greatly, it also creates a new threat: software errors with severe consequences including health hazards, financial repercussions, and security vulnerabilities. How can one ensure that software works reliably? Program Verification studies mathematical methods to answer this question. In the last decade, sophisticated verification tools have been developed that assist software engineers in building reliable software. In this course, we will explore these tools. We will learn how they are used to enable rigorous software development, and we will study the algorithms that work under their hoods. The course will be accompanied by programming projects making use of these tools and that implement some of their core algorithms.
• CSCI-GA.3033-​014
  (20053) Special Topics: Security and Privacy  Lakshminarayanan Subramanian
  Office Hours W 7:10-9:00PM CIWW 512
  This is a graduate level course on security and privacy. This class will cover the fundamentals of how to build secure and privacy aware systems as well as expose students to common vulnerabilities and threats to existing large-scale networks and systems. The course will also place an emphasis on papers that cover the latest advances in security and privacy. Some of the topic areas covered in the area of security include: network security, web security, byzantine fault tolerance, enterprise security, trust and reputation systems, distributed systems security, cryptocurrency, worms and viruses. Topics covered in the area of privacy include: privacy and logic, anonymity, privacy-aware information flow, cryptographic file systems, mobile security and application privacy.
• CSCI-GA.3033-​015
  (20443) Special Topics: Information and Communication Technology for Developing Regions  Jay Chen
  Office Hours T 7:10-9:00PM CIWW 101
  Computer science research has traditionally focused on technical challenges that are relatively agnostic to the contexts in which technology is eventually used. Recently, however, global challenges such as those found in international development and climate change have begun to shift our collective attention toward applying technology for the greater social good. In this course, we will explore how Information and Communication Technologies (ICTs) can be leveraged toward addressing large-scale societal problems in agriculture, healthcare, education, finance, and sustainability. Applying ICTs to solve problems in this space is a challenging and increasingly inter-disciplinary task involving several areas within computer science including: networking, systems, databases, security, and human-computer interaction. In this course, we will review some of the past and very recent efforts in this space, examine in detail the specific contextual challenges, and explore potential solutions to these important problems. The course is accessible to students from a variety of backgrounds including computer science students, ITP students, MSIS students and students in specific application domains (healthcare, finance, education). It is important that any student taking this class have basic exposure to IT courses. In any project group, it is very important that at least a few if not all the students have some coding experience in languages such as C/C++/Java. Most of the projects do not require hacking skills but definitely require reasonable amount of coding. Application specific exposure/expertise is a huge plus in any project.
• CSCI-GA.3110-​001
  (3268) Honors Programming Languages  Patrick Cousot
  Office Hours TR 3:30-4:45PM CIWW 412
  

  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: CSCI-GA.2110 Programming Languages, CSCI-GA.3110 Honors Programming Languages
• CSCI-GA.3230-​001
  MATH-GA.2932-001
  (18721) Random Graphs  Joel Spencer
  Office Hours T 5:10-7:00PM CIWW 102
  This course covers numerous topics related to random graphs, including generalized randomized structures, random processes, probabilistic methods and Erdös Magic. Also covered are branching processes, phase transitions for large random evolutions, derandomization via conditional expectations and semidefinite programming derandomization techniques. Algorithms, probability and discrete mathematics all appear, but concepts will be defined from scratch. Emphasis will be on methods of asymptotic calculation.
• CSCI-GA.3812-​001
  (2524) Information Technology Projects *  Evan Korth
  Office Hours W 6:00-9:00PM CIWW 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.3813-​001
  (2525) 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
  (2526) 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
  (2527) 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
  (2528) 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
  (2529) 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
  (2530) 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
  (2531) 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
  (2532) 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
  (2533) 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
  (2534) PhD Seminar: Cryptography**  Yevgeniy Dodis
  Office Hours T 12:30-3:15PM CIWW 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-​004
  (2535) PhD Seminar: Formal Methods**  Thomas Wies
  Office Hours R 11:00-12:30PM CIWW 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
  (3081) PhD Seminar: Machine Learning**  Mehryar Mohri
  Office Hours T 3:45-5:00PM CIWW 1302
  Graduate seminars serve as loosely structured forums for exploring research topics from broad areas of computer science. They are designed to foster dialogue by bringing together faculty and students from a given area and to encourage the exchange of ideas. As such, they bridge the gap between more structured course offerings and informal research meetings. Subject matter varies by section.
  
  Prerequisites: Permission of the instructor.
• CSCI-GA.3860-​001
  (2536) PhD Thesis Research **  Faculty -
  
  
  Prerequisites: Permission of the thesis adviser or director of graduate studies for the Ph.D. program.
• CSCI-UA.0002-​001
  (7570) Intro To Computer Programming  Deena Engel MW 2:00-3:15PM CIWW 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
  (7571) Intro To Computer Programming  CANCELLED -
  

  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
  (7572) Intro To Computer Programming  Craig Kapp
  Office Hours MW 9:30-10:45AM CIWW 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
  (7573) Intro To Computer Programming  Adam Meyers
  Office Hours MW 8:00-9:15AM CIWW 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-​005
  (18142) Intro To Computer Programming  Craig Kapp
  Office Hours MW 12:30-1:45PM CIWW 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
  (7574) Intro To Computer Programming  Jerry Waxman
  Office Hours TR 3:30-4:45PM CIWW 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-​007
  (7575) Intro To Computer Programming  Abraham Rubenstein
  Office Hours MW 3:30-4:45PM CIWW 517
  

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

  
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
• CSCI-UA.0002-​008
  (9106) Intro To Computer Programming  Michell Cardona
  Office Hours TR 9:30-10:45AM CIWW 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-​009
  (18143) Intro To Computer Programming  Adam Meyers
  Office Hours TR 8:00-9:15AM CIWW 312
  

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

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

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

  
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with any programming experience should consult with the department before registering. Students with any reported score on the Computer Science AP examination cannot enroll in this course; Albert will block them from registering for it. Students who have taken or are taking Introduction to Computer Science (CSCI-UA 101) will not receive credit for this course. Does not count toward the computer science major; serves as the prerequisite for students with no previous programming experience who want to continue into CSCI-UA 101 and pursue the major. Students may not receive credit for both CSCI-UA 2 and CSCI-UA 3.
• CSCI-UA.0002-​011
  (9833) Intro To Computer Programming  Syed Salahuddin
  Office Hours TR 12:30-1:45PM CIWW 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.0004-​001
  (7576) Intro to Web Design & Computer Principles  Joshua Clayton
  Office Hours TR 11:00-12:15PM CIWW 102
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0004-​002
  (7577) Intro to Web Design & Computer Principles  Alvaro Olsen
  Office Hours MW 8:00-9:15AM CIWW 312
  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
  (7578) Intro to Web Design & Computer Principles  Nathan Hull
  Office Hours MW 12:30-1:45PM CIWW 102
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0004-​004
  (7579) Intro to Web Design & Computer Principles  CANCELLED -
  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
  (8967) Intro to Web Design & Computer Principles  Craig Kapp
  Office Hours TR 2:00-3:15PM CIWW 202
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0004-​006
  (9107) Intro to Web Design & Computer Principles  Zevensuy Rodriguez
  Office Hours MW 11:00-12:15PM CIWW 202
  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-​007
  (9358) Intro to Web Design & Computer Principles  Adam Scher
  Office Hours TR 8:00-9:15AM CIWW 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-​008
  (24061) Intro to Web Design & Computer Principles  Lee-Sean Huang
  Office Hours MW 3:30-4:45PM CIWW 202
  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
  (7580) Database Design And Web Implementation  Amos Bloomberg
  Office Hours TR 9:30-10:45AM CIWW 102
  

  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.0060-​002
  (9834) Database Design And Web Implementation  Amos Bloomberg
  Office Hours MW 3:30-4:45PM CIWW 101
  

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

  
  
  Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3). Students that have successfully completed Data Management and Analysis (CSCI-UA 479) are NOT eligible to take this course.
• CSCI-UA.0061-​001
  (8962) Web Development And Programming  Nathan Hull
  Office Hours TR 3:30-4:45PM CIWW 512
  

  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.0061-​002
  (9835) Web Development And Programming  Joshua Clayton
  Office Hours MW 3:30-4:45PM CIWW 201
  

  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
  (7581) Intro To Computer Science  Randy Shepherd
  Office Hours MW 3:30-4:45PM CIWW 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
  (7582) Intro To Computer Science  Randy Shepherd
  Office Hours TR 9:30-10:45AM CIWW 109
  

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

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

  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
  (7584) Intro To Computer Science  Joseph Versoza
  Office Hours TR 2:00-3:15PM CIWW 317
  

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

  
  
  Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
• CSCI-UA.0101-​005
  (9109) Intro To Computer Science  Aftab Ahmad
  Office Hours MW 11:00-12:15PM CIWW 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-​006
  (18144) Intro To Computer Science  Joanna Klukowska
  Office Hours MW 9:30-10:45AM CIWW 317
  

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

  
  
  Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
• CSCI-UA.0101-​007
  (9701) Intro To Computer Science  Douglas Moody
  Office Hours WF 8:00-9:15AM CIWW 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-​008
  (22218) Intro To Computer Science  Brett Peterson
  Office Hours TR 8:00-9:15AM CIWW 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.0102-​001
  (7585) Data Structures  Igor Shinkar
  Office Hours MW 9:30-10:45AM CIWW 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
  (7586) Data Structures - Recitation  Shravas Rao T 12:30-1:45PM CIWW 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-​003
  (7587) Data Structures  Joanna Klukowska
  Office Hours MW 11:00-12:15PM CIWW 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-​004
  (7588) Data Structures - Recitation  Sebastian Herscher M 3:30-4:45PM CIWW 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
  (7589) Data Structures  Anasse Bari
  Office Hours TR 8:00-9:15AM CIWW 201
  

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

  
  
  Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
• CSCI-UA.0102-​006
  (9836) Data Structures - Recitation  Marcelo Cicconet W 8:00-9:15AM CIWW 201
  

  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-​007
  (9837) Data Structures  Anasse Bari
  Office Hours TR 2:00-3:15PM CIWW 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-​008
  (18145) Data Structures - Recitation  Siddharth Krishna W 3:30-4:45PM CIWW 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.0201-​001
  (7590) Computer Systems Organization  Randy Shepherd
  Office Hours MW 2:00-3:15PM CIWW 102
  

  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
  (7591) Computer Systems Organization  Joanna Klukowska
  Office Hours TR 11:00-12:15PM CIWW 109
  

  Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​003
  (21127) Computer Systems Organization - Recitation  Hassan Mujtaba Zaidi T 8:00-9:15AM CIWW 109
  

  Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​004
  (21128) Computer Systems Organization - Recitation  Francisca Gil Ureta
  Office Hours R 8:00-9:15AM CIWW 109
  

  Covers the internal structure of computers, machine (assembly) language programming, and the use of pointers in high-level languages. Topics include the logical design of computers, computer architecture, the internal representation of data, instruction sets, and addressing logic, as well as pointers, structures, and other features of high-level languages that relate to assembly language. Programming assignments are in both assembly language and other languages.

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0202-​001
  (7592) Operating Systems  Allan Gottlieb
  Office Hours TR 3:30-4:45PM CIWW 109
  

  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
  (7594) Basic Algorithms  Alan Siegel
  Office Hours TR 2:00-3:15PM CIWW 109
  

  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
  (7595) Basic Algorithms - Recitation  Alan Siegel
  Office Hours W 12:30-1:45PM CIWW 109
  

  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
  (7596) Basic Algorithms  Victor Shoup
  Office Hours MW 2:00-3:15PM CIWW 101
  

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
• CSCI-UA.0310-​004
  (9838) Basic Algorithms - Recitation  Abhinav Tamaskar M 12:30-1:45PM CIWW 109
  

  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.0330-​001
  MATH-UA.0144
  (10138) Introduction to Computer Simulation  Charles Peskin TR 11:00-12:15PM CIWW 512
  

  In this course, students will learn how to do computer simulations of such phenomena as orbits (Kepler problem and N-body problem), epidemic and endemic disease (including evolution in response to the selective pressure of a malaria), musical stringed instruments (piano, guitar, and violin), and traffic flow in a city (with lights, breakdowns, and gridlock at corners). The simulations are based on mathematical models, numerical methods, and Matlab programming techniques that will be taught in class. The use of animations (and sound where appropriate) to present the results of simulations will be emphasized.

  
  
  Prerequisites: Calculus I (MATH-UA 121) or Math for Economics II (MATH-UA 212) and General Physics (PHYS-UA 11).
• CSCI-UA.0330-​002
  (10139) Introduction to Computer Simulation  Guanyu Wang F 11:00-12:15PM CIWW 101
  

  In this course, students will learn how to do computer simulations of such phenomena as orbits (Kepler problem and N-body problem), epidemic and endemic disease (including evolution in response to the selective pressure of a malaria), musical stringed instruments (piano, guitar, and violin), and traffic flow in a city (with lights, breakdowns, and gridlock at corners). The simulations are based on mathematical models, numerical methods, and Matlab programming techniques that will be taught in class. The use of animations (and sound where appropriate) to present the results of simulations will be emphasized.

  
  
  Prerequisites: Calculus I (MATH-UA 121) or Math for Economics II (MATH-UA 212) and General Physics (PHYS-UA 11).
• CSCI-UA.0380-​001
  (9108) Topics of General Interest: Physical Computing  Amos Bloomberg
  Office Hours MW 12:30-1:45PM CIWW 202
  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.0380-​002
  (9498) Topics of General Interest: Drawing on the Web  Joshua Clayton
  Office Hours TR 3:30-4:45PM CIWW 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.0380-​003
  ECON-UA.0290-003 Topics of General Interest: Technology and Economic Development  CANCELLED -
  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.0380-​004
  (18146) Topics of General Interest: Python for Applications  Joseph Versoza
  Office Hours MW 9:30-10:45AM CIWW 312
  Detailed descriptions available when topics are announced. Typical offerings include Computing in the Humanities and Arts and Introduction to Flash Programming. Does not count toward the computer science major.
  
  Prerequisites: Topics determine prerequisites.
• CSCI-UA.0421-​001
  (7597) Numerical Computing   Margaret Wright
  Office Hours TR 11:00-12:15PM CIWW 517
  

  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.0453-​001
  (18152) Theory Of Computation   Richard Cole
  Office Hours MW 11:00-12:15PM CIWW 512
  

  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.0480-​001
  (7598) Special Topics: Computer Vision  Davi Geiger
  Office Hours TR 2:00-3:15PM 719BWY 1221
  An introduction to the field of computer vision. Basic concepts will be covered such as edge detection, stereo vision, motion, color, texture and recognition.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0480-​002
  (7599) Special Topics: iOS Programming  Nathan Hull
  Office Hours MW 3:30-4:45PM CIWW 317
  In this course, students will learn to create applications for Apple's iPhone 3G using Objective-C and the iPhone SDK. Since its introduction this past summer, the Apple SDK has been revealed to be a powerful platform upon which to build sophisticated applications for the iPhone. Without actually having to own an iPhone, students will be able to build and test their applications on Intel Apple Macs using the freely available compiler and simulator. In addition to the development tools, students will become proficient in the object-oriented language Objective-C, the Apple iPhone Framework, and the principles of Cocoa development. This is a new, dynamic, constantly-evolving topic, and students will be at the forefront of a new technological advancement.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0480-​003
  (7600) Special Topics: Parallel Computing  Mohamed Zahran
  Office Hours MW 2:00-3:15PM Kimmel 803
  Most of us have learned to program a single microprocessor using a high-level programming language like C/C++, Java, ... This is called sequential programming, because we think in sequential way and give the machine statements to be executed in sequence. However, this has to change. A single microprocessor (or single core) no longer exists in almost all computers we are using today (including your tablets and smart phones). Most of our devices are now multicore processors. This means it contains several processors on-chip. To make the best use of these chips we need to program them "in-parallel". Sequential programming, for all platforms from smart phones to supercomputers, is falling out of fashion and taking back-seat to parallel programming. How to think in parallel? How to write code in parallel to make the best use of the underlying hardware? How is that new hardware different from the traditional one? What will the future be for the software and hardware? This is the topic of this course.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0480-​004
  (9110) Special Topics: Algorithmic Problem Solving  John Zhang
  Office Hours TR 3:30-4:45PM CIWW 101
  Many of the top firms in the technological and financial sectors are using algorithmic problems as interview questions for assessing candidate skill. In this course we take this idea one step further and use algorithmic problem solving as way to hone programming skills. Students will use the material covered in the data structures and algorithms courses and learn new algorithmic techniques to solve challenging problems quickly. Each week will be devoted to a particular type of algorithm. Weekly problem sets will reinforce the lecture, and require students to implement their solutions in Java or C++. Students completing this course will be well prepared to participate in programming competitions such as the ACM Inter-Collegiate Programming Contest, TopCoder, and Google's Code Jam. Requirements: Basic Algorithms(prereq or coreq with permission).
  
  Prerequisites: CSCI-UA.0310
• CSCI-UA.0480-​005
  (9841) Special Topics: Algorithmic Problem Solving - RECITATION  Bowen Yu F 5:10-7:10PM CIWW 101
  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-​006
  (9842) Special Topics: Computer Graphics  Kenneth Perlin
  Office Hours TR 11:00-12:15PM 719BWY 1221
  The course will cover: 2D and 3D shape modeling, 2D and 3D coordinate transformations, splines, user interaction, designing and implementing motion scripts, viewing perspective rendering, clipping, painter's and Z-buffer algorithms, shading and lighting, textures, fractals, and ray tracing. There will be a lot of programming in this course as well as a midterm and final.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0480-​007
  (10276) Special Topics: Intro To Machine Learning  David Sontag
  Office Hours TR 2:00-3:15PM CIWW 312
  

  Machine learning is an exciting and fast-moving field of computer science with many recent consumer applications (e.g., Microsoft Kinect, Google Translate, Iphone's Siri, digital camera face detection, Netflix recommendations, Google news) and applications within the sciences and medicine (e.g., predicting protein-protein interactions, species modeling, detecting tumors, personalized medicine). In this undergraduate-level class, students will learn about the theoretical foundations of machine learning and how to apply machine learning to solve new problems.

  
  
  Prerequisites: Students must either have taken Basic Algorithms (CSCI-UA.0310) or be taking it concurrently. Linear algebra (MATH-UA 140) is strongly recommended as a pre-requisite, and knowledge of multivariable calculus will be helpful. Students should also have good programming skills.
• CSCI-UA.0480-​008
  (18148) Special Topics: Advanced Computer Systems  Michael Walfish
  Office Hours TR 3:30-4:45PM CIWW 312
  This course will deepen students' understanding of complex computer systems: how these systems work, how to approach a given system or proposal critically, and how to design and build systems. Topics will include the interface between computer hardware and software, concurrency and parallelism, performance analysis, virtual machines, sandboxing, distributed systems, networking and the Internet, and security. The work will include substantial implementation exercises, critical reading and in-class discussion of research papers, and a final project. Because of the close relationship among critical reading, critical thinking, and clear communication, there may also be exercises to build writing skill.
  
  Prerequisites: CSCI-UA.0202 with a B or better and INSTRUCTOR APPROVAL. Please email Professor Walfish at mwalfish@cs.nyu.edu for approval.
• CSCI-UA.0480-​009
  (18149) Special Topics: Robotics  Chee Yap
  Office Hours TR 9:30-10:45AM CIWW 317
  Robots are computers with sensors and actuators that can interact directly with the physical world. The course will be rely on hands-on sessions in which students will write software for a variety of robot platforms for tasks such as maze solving, grasping, obstacle avoidance, and target tracking using vision. Class projects will include various challenges and robot races. Topics will include sensors and actuators, micro-controler programming and real-time embedded systems, simple kinematics, trajectory planning, simple vision and pattern recognition methods.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0480-​010
  (23823) Special Topics: Applied Internet Technology  Joseph Versoza
  Office Hours TR 11:00-12:15PM CIWW 312
  A practical introduction to creating modern web applications. Covers full stack web development - including topics such as database / data model design, MVC architecture, templating, handling user input, asynchronous processing, and client side interactivity. Students will use current server and client side web frameworks to build dynamic, data-driven sites. Various tools to support development will also be introduced, such as version control and build systems. Basic knowledge of HTML and CSS and familiarity with command line tools are recommended.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0480-​011
  (23943) Special Topics: Natural Language Processing  Adam Meyers
  Office Hours MW 11:00-12:15PM CIWW 102
  Natural Language Processing (aka Computational Linguistics) is an inter-disciplinary field applying methodology of computer science and linguistics to the processing of natural languages (English, Chinese, Spanish, Japanese, etc.). Typical applications include: information extraction (automatically finding information from text); information retrieval (web searches and other applications involving the automatic selection of "relevant" documents); sentiment analysis (automatic extraction of opinions about a set of issues); and machine translation (automatically translating one natural language to another). Much of the best work in the field combines two methodologies: (1) automatically acquiring statistical information from one set of "training" documents to use as the basis for probabilistically predicting the distribution of similar information in new documents; and (2) using manually encoded linguistic knowledge. For example, many supervised methods of machine learning require: a corpus of text with manually encoded linguistic knowledge, a set of procedures for acquiring statistical patterns from this data and a transducer for predicting these same distinctions in new text. This class will cover linguistic, statistical and computational aspects of this exciting field.
  
  Prerequisites: CSCI-UA.0201
• CSCI-UA.0521-​001
  (7601) Undergraduate Research   TBA - CIWW 323
  The student is supervised by a faculty member actively engaged in research, possibly leading to results publishable in the computer science literature. A substantial commitment to this work is expected. The research project may be one or two semesters, to be determined in consultation with the faculty supervisor. Students taking this course for honors in computer science are required to write an honors thesis. All other students need to submit a write-up of the research results at the conclusion of the project.
  
  Prerequisites: Permission of the department.
• CSCI-UA.0898-​001
  (20609) Internship  TBA - CIWW 323
  An internship in computer science is an excellent complement to formal course work. We strongly recommend that students have some practical training along with their classroom experience, so they can explore different career options and gain hands-on experience. An internship is for majors only, and students must have maintained an overall GPA of 3.0 and a computer science GPA of 3.5. The internship will be graded.
  
  Prerequisites: Restricted to declared computer science majors. Internship credit does not count toward major requirements, but does apply toward completion of the CAS degree.
• CSCI-UA.0998-​001
  (7602) Independent Study   TBA - CIWW 323
  

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

  
  
  Prerequisites: Permission of the department. Does not satisfy the major elective requirement.

• *
  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

---