Course Schedule

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

View undergraduate course grid View graduate course grid

• CSCI-GA.1122-​001
  (3537) Web Development****  Joshua Clayton
  Office Hours T 6:20-9:00PM 60 Fifth Ave C03 Additional information: Not open to graduate Computer Science, Information Systems, CEI (Computing, Entrepreneurship, and Innovation)
  

  Course Description:

  This course uses a project-based learning approach towards the study of web technologies and web programming. Students study the principles of web design and each student builds one or more interactive websites based on content relevant to their scholarly interest in the humanities or social sciences. Not open to graduate Computer Science, Information Systems, Mathematics or Scientific Computing students. For registration, please contact dhss@nyu.edu.

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

  Course Description:

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

  
  
  Prerequisites:

  CSCI-GA 1133 or departmental permission.

• CSCI-GA.1144-​002
  (3039) PAC II Recitation  Richik Jaiswal
  Office Hours R 7:10-8:00PM CIWW 312
  

  Course Description:

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

  
  
  Prerequisites:

  CSCI-GA 1133 or departmental permission.

• CSCI-GA.1170-​001
  DS-GA.1170
  (2633) Fundamental Algorithms  Alexander Alekseyev
  Office Hours M 5:10-7:00PM Silv 405
  

  Course Description:

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

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

  Course Description:

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

  
  
  Prerequisites: At least one year of experience with a high-level language such as Pascal, C, C++, or Java; and familiarity with recursive programming methods and with data structures (arrays, pointers, stacks, queues, linked lists, binary trees).
• CSCI-GA.1170-​003
  DS-GA.1170
  (3425) Fundamental Algorithms  Yevgeniy Dodis
  Office Hours T 7:10-9:00PM CIWW 109
  

  Course Description:

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

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

  Course Description:

  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
  (20913) Mathematical Techniques For CS Applications  Remi Imbach
  Office Hours T 5:10-7:00PM CIWW 317
  

  Course Description:

  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
  (2635) Programming Languages  Thomas Wies
  Office Hours W 7:10-9:00PM CIWW 109
  

  Course Description:

  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
  (2636) Programming Languages Recitation  Thomas Wies
  Office Hours R 7:10-8:00PM CIWW 109
  

  Course Description:

  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
  (2637) Compiler Construction  Eva Rose
  Office Hours M 7:10-9:00PM CIWW 202
  

  Course Description:

  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
  (2638) Operating Systems  Hubertus Franke
  Office Hours M 7:10-9:00PM CIWW 109
  

  Course Description:

  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
  (3268) Operating Systems  Shameem Akhter
  Office Hours W 7:10-9:00PM CIWW 102
  

  Course Description:

  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
  (2639) Data Communications and Networks  Jean-Claude Franchitti
  Office Hours R 5:10-7:00PM CIWW 101
  

  Course Description:

  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
  (2640) Numerical Methods II  Aleksandar Donev T 5:10-7:00PM CIWW 202
  

  Course Description:

  Numerical linear algebra. Approximation theory. Quadrature rules and numerical integration. Nonlinear equations and optimization. Ordinary differential equations. Elliptic equations. Iterative methods for large, sparse systems. Parabolic and hyperbolic equations.
  
  Prerequisites: Corequisite: linear algebra.
• CSCI-GA.2433-​001
  DS-GA.2433-001
  (2641) Database Systems  Zvi Kedem
  Office Hours W 5:10-7:00PM CIWW 109
  

  Course Description:

  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
  (2642) Software Engineering   Jean-Claude Franchitti
  Office Hours M 7:10-9:00PM CIWW 317
  

  Course Description:

  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
  (2643) Bioinformatics and Genomes  Brian Parker F 1:00-3:45PM CIWW 102
  

  Course Description:

  The recent explosion in the availability of genome-wide data such as whole genome sequences and microarray data led to a vast increase in bioinformatics research and tool development. Bioinformatics is becoming a cornerstone for modern biology, especially in fields such as genomics. It is thus crucial to understand the basic ideas and to learn fundamental bioinformatics techniques. The emphasis of this course is on developing not only an understanding of existing tools but also the programming and statistics skills that allow students to solve new problems in a creative way.
• CSCI-GA.2560-​001
  (3538) Artificial Intelligence   Ernest Davis
  Office Hours M 5:10-7:00PM CIWW 102
  

  Course Description:

  There are many cognitive tasks that people do easily and almost unconsciously but that have proven extremely difficult to program on a computer. Artificial intelligence is the problem of developing computer systems that can carry out these tasks. This course covers problem solving and state space search; automated reasoning; probabilistic reasoning; planning; and knowledge representation.

• CSCI-GA.2565-​001
  (20916) Machine Learning   Rajesh Ranganath
  Office Hours T 5:10-7:00PM CIWW 109
  

  Course Description:

  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.2572-​001
  DS-GA.1008-001
  (23069) Deep Learning  Yann LeCun M 4:55-6:35PM CIWW 109
  

  Course Description:

  This course concerns the latest techniques in deep learning and representation learning, focusing on supervised and unsupervised deep learning, embedding methods, metric learning, convolutional net and recurrent nets, with applications to computer vision, natural language understanding, and speech recognition.

  
  
  Prerequisites: DS-GA 1001 Intro to Data Science or a graduate-level machine learning course.
• CSCI-GA.2572-​002
  DS-GA.1008-002
  (23259) Deep Learning Lab  Yann LeCun T 7:10-8:00PM Meyr 121
  

  Course Description:

  This course concerns the latest techniques in deep learning and representation learning, focusing on supervised and unsupervised deep learning, embedding methods, metric learning, convolutional net and recurrent nets, with applications to computer vision, natural language understanding, and speech recognition.

  
  
  Prerequisites: DS-GA 1001 Intro to Data Science or a graduate-level machine learning course.
• CSCI-GA.2590-​001
  (3040) Natural Language Processing  Ralph Grishman
  Office Hours T 5:10-7:00PM 60 Fifth Ave 150
  

  Course Description:

  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
  (3076) Networks and Mobile Systems  Anirudh Sivaraman
  Office Hours R 7:10-9:00PM 60 Fifth Ave C12
  

  Course Description:

  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.2820-​001
  (20918) DevOps and Agile Methodologies  John Rofrano
  Office Hours T 5:10-7:00PM CIWW 101 Additional information: Not open to graduate Computer Science, Information Systems, CEI (Computing, Entrepreneurship, and Innovation), or Non-Degree students.
  

  Course Description:

  This course uses a project­ based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.

• CSCI-GA.2820-​002
  (20919) DevOps and Agile Methodologies Lab  John Rofrano
  Office Hours T 7:10-8:00PM CIWW 101 Additional information: Not open to graduate Computer Science, Information Systems, CEI (Computing, Entrepreneurship, and Innovation), or Non-Degree students.
  

  Course Description:

  This course uses a project­ based learning approach towards the study of DevOps as a cultural change in Information Technology organizations, and the supporting development tools and automation technologies required to implement it successfully. Students study the principles of DevOps, and as part of an agile development team, each student is involved in planning, designing, building, testing, and deploying one or more cloud native microservices into a Platform as a Service cloud by utilizing a DevOps Pipeline that they will create.

• CSCI-GA.2840-​001
  (20920) Entrepreneurship Capstone  Evan Korth
  Office Hours T 10:00-12:00PM 16WP 106 Additional information: Open only to students in the MS-CEI program.
  

  Course Description:

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

  The Entrepreneurship Capstone class is a 15­week bootcamp class on entrepreneurship. This class aims to translate experiences of students on idea incubation, prototype development and Lean Launchpad towards entrepreneurship. Students will learn how to pitch their ideas to VCs, focus on business development and translate their prototypes to an evolving MVP.

• CSCI-GA.2840-​002
  (20945) Entrepreneurship Capstone Lab  Nolan Filter T 12:10-1:00PM 16WP 106 Additional information: Open only to students in the MS-CEI program.
  

  Course Description:

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

  The Entrepreneurship Capstone class is a 15­week bootcamp class on entrepreneurship. This class aims to translate experiences of students on idea incubation, prototype development and Lean Launchpad towards entrepreneurship. Students will learn how to pitch their ideas to VCs, focus on business development and translate their prototypes to an evolving MVP.

• CSCI-GA.2945-​001
  MATH-GA.2012-001
  (2644) Adv Topics Num Analysis: High Performance Computing  Georg Stadler
  Dhairya Malhotra M 5:10-7:00PM CIWW 1302
  

  Course Description:

  This class will be an introduction to the fundamentals of parallel scientific computing. We will establish a basic understanding of modern computer architectures (CPUs and accelerators, memory hierarchies, interconnects) and of parallel approaches to programming these machines (distributed vs. shared memory parallelism: MPI, OpenMP, OpenCL/CUDA). Issues such as load balancing, communication, and synchronization will be covered and illustrated in the context of parallel numerical algorithms. Since a prerequisite for good parallel performance is good serial performance, this aspect will also be addressed. Along the way you will be exposed to important tools for high performance computing such as debuggers, schedulers, visualization, and version control systems. This will be a hands-on class, with several parallel (and serial) computing assignments, in which you will explore material by yourself and try things out. There will be a larger final project at the end. You will learn some Unix in this course, if you don't know it already. Prerequisites for the course are (serial) programming experience with C/C++ (I will use C in class) or FORTRAN, and some familiarity with numerical methods.

• CSCI-GA.2945-​002
  MATH-GA.2012-002
  (2645) Adv Topics Num Analysis: Immersed Boundary Method  Charles Peskin M 11:00-12:50PM CIWW 1302
  

  Course Description:

  The immersed boundary (IB) method is a general framework for the computer simulation of flows with immersed elastic boundaries and/or complicated geometry. It was originally developed to study the fluid dynamics of heart valves, and it has since been applied to a wide variety of problems in biofluid dynamics, such as wave propagation in the inner ear, blood clotting, fish swimming, and insect flight.

  Non-biological applications include sails, parachutes, flows of suspensions, and two-fluid or multifluid problems. Topics to be covered include: mathematical formulation of fluid-structure interaction in Eulerian and Lagrangian variables with the Dirac delta function as the link between these two kinds of variables; discretization of the structure, fluid, and interaction equations, including energy-based discretization of the structure equations, finite difference discretization of the fluid equations, and IB delta functions with specified mathematical properties; an IB method with an exactly divergence-free interpolated velocity field; IB methods for immersed boundaries with non-trivial mass and for fluids with non-uniform density and viscosity; IB methods for immersed filaments with bend and twist; and a stochastic IB method for thermally fluctuating hydrodynamics within biological cells.

  Course requirements include homework assignments and a computing project, but no exam. Students may collaborate on the homework and on the computing project, and are encouraged to present the results of their computing projects to the class.

  Text:

  The Immersed Boundary Method, lecture notes by Charles S. Peskin. These notes will be supplemented by selected publications on the topics of the course.

  
  
  Prerequisites: Familiarity with numerical methods and fluid dynamics.
• CSCI-GA.2945-​003
  MATH-GA.2012-003
  (20917) Adv Topics Num Analysis: Numerical Optimization  Margaret Wright
  Office Hours R 5:10-7:00PM CIWW 312
  

  Course Description:

  Many problems in science, engineering, medicine, and business involve optimization, in which we seek to optimize a mathematical measure of goodness subject to constraints. This course will survey widely used methods for continuous optimization, focusing on both theoretical foundations and implementation as software.

  The course will cover: linear programming (including the simplex method and interior-point methods); line search and trust region methods for unconstrained optimization; methods for convex and nonconvex quadratic programming; and penalty, barrier, augmented agrangian, and interior-point methods for convex and nonconvex constrained optimization. In all cases, attention will be paid to numerical issues.

  
  
  Prerequisites: Students are expected to be comfortable with numerical linear algebra and multivariate calculus, and to have programming experience (preferably in Matlab). Students without all elements of this background are likely to have difficulty with the course material.
• CSCI-GA.2945-​004
  MATH-GA.2012-004
  (24010) Adv Topics Num Analysis: Stochastic modeling and uncertainity quantification in complex systems  Benjamin Peherstorfer
  Office Hours M 1:25-3:15PM CIWW 517
  

  Course Description:

  As physical and time domains of partial differential equations (PDEs) can be resolved with ever higher accuracy, the quality of numerical simulations of physical phenomena increasingly tends to be limited by noisy and incomplete data that insufficiently describe boundary conditions, coefficients, and other parameters of the problem setups. This course provides an introduction to the stochastic modeling of these data uncertainties as random coefficients and random forcing terms of PDEs and discusses dimensionality reduction methods for efficiently estimating moments of the solutions of the corresponding stochastic PDEs. The first part focuses on stochastic modeling and sampling (Karhunen-Loeve expansion, polynomial chaos expansion, stochastic Galerkin, (multilevel) Monte Carlo, stochastic collocation, sparse grids). The second part discusses dimensionality reduction techniques to make estimation of moments of the PDE solutions computationally tractable (proper orthogonal decomposition, a posteriori error estimation and error control of reduced models, empirical interpolation).

• CSCI-GA.2945-​005
  MATH-GA.2012-005
  (26174) Adv Topics Num Analysis: Monte Carlo Methods  Jonathan Weare W 11:00-12:50PM CIWW 1302
  

  Course Description:

  This course primarily concerns the design and analysis of Monte Carlo sampling techniques for the estimation of averages with respect to high dimensional probability distributions. Standard simulation tools such as importance sampling, Gibbs and Metropolis-Hastings sampling, Langevin dynamics, and hybrid Monte Carlo will be introduced along with basic theoretical concepts regarding their convergence to equilibrium. The focus is on methods that are broadly useful for problems in science, engineering, and statistics. Particular attention will be paid to the major complicating issues like conditioning and rare events and methods to address them (e.g. tempering, interacting particle methods, and free-energy methods).

• CSCI-GA.3033-​001
  (2646) Special Topics: Big Data Science  Anasse Bari
  Office Hours W 5:10-7:00PM CIWW 201
  

  Course Description:

  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.

  
  
  Prerequisites: Strong programming skills in the Java language and fundamentals of linear algebra.
• CSCI-GA.3033-​002
  (3126) Special Topics: Social Networks  Bhubaneswar Mishra
  Office Hours R 7:10-9:00PM CIWW 512
  

  Course Description:

  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, and LinkedIn, etc. connect small groups of friends; amazon, eBay, etc. provide opportunities for trading, etc, BitCoins, Ethereum, etc. allow parties to make financial and contractual transactions . 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., and have evolved with the dynamics of evolutionary games (particularly Signaling Games). 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, and mechanism designed to interact strategically: SmartContractss, Costly Signaling, Credible and Noncredible Threats, Model Checking and Verification, Safety and Liveness, Recommenders and Verifiers, Deception, Market mechanisms (pricing and auction), Privacy and Trust… Exampled Systems: Bit-coins, Zcash, Ripple, Stellar, Ethereum, Solidity, Rholang, DAO (Distributed Companies), Cyber Security (M-coins), Information Finance Markets (WealthFront, etc.), Market Microstructure, ICO/STO/ITO, GDPR, OpenLaw, OpenZeplin, ...

• CSCI-GA.3033-​003
  (2647) Special Topics: Production Quality Software  CANCELLED -
  

  Course Description:

  In this course we study the craft of software engineering. The semester begins with a thorough review of Java and the Java Virtual Machine. We concentrate on library components and language features most relevant to typical engineering projects. Later lectures cover more sophisticated topics, including concurrency and thread-safety, writing tests, object-oriented programming, and design patterns. The course also covers non-technical topics that are critical to software development including how to write with clarity, managing bugs, successfully developing and reinforcing salutary engineering habits, the nature of human productivity as it relates specifically to engineering, and communicating effectively with teammates. Lessons are reinforced with weekly assignments that are meticulously graded, with some submissions critiqued in classroom code reviews.

• CSCI-GA.3033-​005
  (2649) Special Topics: Big Data Application Development  Suzanne McIntosh
  Office Hours R 7:10-9:00PM CIWW 101
  

  Course Description:

  This course covers Scala, Spark programming, Spark architecture, Spark Streaming, and integration of Spark with the Hadoop ecosystem for developing Big Data applications. In addition, it covers the technologies that integrate well with Spark in the creation of Big Data applications. Students are required to complete weekly reading and/or programming assignments and demonstrate mastery of course topics by developing a final project using Scala, Spark, and complementary Hadoop tools.

  
  
  Prerequisites: Students should have experience using Hadoop (HDFS and MapReduce). In addition, students should have: strong programming skills in Java, Python, or C/C++; coursework in operating systems, networking, and algorithms; familiarity with Linux commands.
• CSCI-GA.3033-​008
  (3136) Special Topics: .Net Web Application Development  Cory Plock
  Office Hours M 5:10-7:00PM CIWW 101
  

  Course Description:

  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 build a fully functional web solution.

  
  
  Prerequisites: Programming languages, object-oriented programming, relational databases, and data structures.
• CSCI-GA.3033-​010
  (3354) Special Topics: Cloud Computing  Jean-Claude Franchitti
  Office Hours R 7:10-9:00PM CIWW 102
  

  Course Description:

  This is a capstone course.

  This course provides a hands-on comprehensive study of Cloud concepts and capabilities across the various Cloud service models including Infrastructure as a Service (IaaS), Platform as a Service (PaaS), Software as a Service (SaaS), and Business Process as a Service (BPaaS).

  The IaaS topics start with a detailed study of the evolution of infrastructure migration approaches from VMWare/Xen/KVM virtualization, to adaptive virtualization, and Cloud Computing / on-demand resources provisioning. Mainstream Cloud infrastructure services and related vendor solutions are also covered in detail.

  The PaaS topics cover a broad range of Cloud vendor platforms including AWS, Red Hat's OpenShift, Cloud Foundry, Apache Stratos, Microsoft Azure, Eucalyptus, OpenStack and others as well as a detailed study of related platform services such as storage capabilities that leverage Google Storage, Amazon S3, Amazon Dynamo, or other facilities meant to provide Cloud resources management and monitoring capabilities.

  The course will focus in particular on mainstream Application Platform as a Service (aPaaS), which is a PaaS offering that leverages container services (e.g., Docker) and microservices architectures aimed at facilitating application development, deployment and execution in the cloud. In addition to encapsulating infrastructure resources, aPaaSs include services such as those for data management (including NoSQL and in-memory data services), BPM and decision-engine services, API Management for hybrid integration, and user interfaces. As an example, Cloud foundation offerings provided on top of modern aPaaS such as IBM's Bluemix Liberty for Java include a collection of Watson analytics, big data, mobile, security, IoT, integration, DevOps, Blockchain, as well as other functionality.

  Similar functionalities are provided on the AWS, Google Cloud (GCP), and Microsoft Azure platforms. Additional aPaaS platforms of interest Oracle aPaaS, Red Hat OpenShift, Salesforce App Cloud, and SAP Hana Cloud Platform (HCP).

• CSCI-GA.3033-​016
  (3356) Special Topics: Multicore Processors: Architecture and Programming  Mohamed Zahran
  Office Hours W 5:10-7:00PM CIWW 312
  

  Course Description:

  This is a capstone course.

  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 power efficient, and more reliable.

• CSCI-GA.3033-​018
  (3361) Special Topics: Geometric Modeling  Daniele Panozzo
  Office Hours R 5:10-7:00PM 60 Fifth Ave C12
  

  Course Description:

  Recent advances in 3D digital geometry processing have created a plenitude of novel concepts for the mathematical representation and interactive manipulation of geometric models. This course covers some of the latest developments in geometric modeling and digital geometry processing. Topics include surface modeling based on polygonal meshes, surface reconstruction, mesh improvement, mesh parametrization, discrete differential geometry, interactive shape editing, skinning animation, architectural and structure-aware geometric modeling, shape modeling with an eye on 3D printing. The students will learn how to design, program and analyze algorithms and systems for interactive 3D shape modeling and digital geometry processing.

  Prerequisites: Basic knowledge of Computer Graphics, experience with C++ programming. Some background in geometric computing is helpful, but not necessary. CSCI-UA 140 (or an equivalent undergraduate course in linear algebra)

• CSCI-GA.3033-​019
  (3362) Special Topics: Practical Computer Security  Kevin Chen
  Office Hours T 7:10-9:00PM CIWW 201
  

  Course Description:

  This course teaches the security mindset and practical security concepts that are essential for software engineers, software developers, quality assurance testers and IT managers. The course discusses various attack techniques and defenses for real world applications and the security activities in the SDLC. Its main topics include: low-level exploits, web application security, malware, threat modeling, security requirements, secure coding practices, security & penetration testing, human factors and usability, mobile platform security, and legal and ethical issues. Course project and assignments may require C, JavaScript, Python, and/or other scripting languages.

  
  
  Prerequisites: Programming experience in C/C++, JavaScript, Python, and SQL; basic understanding of assembly language; working knowledge of web application development.
• CSCI-GA.3033-​020
  DS-GA.3001-014
  (3357) Special Topics: Mathematics of Deep Learning  Joan Bruna M 7:10-9:00PM CIWW 102
  

  Course Description:

  This graduate-level course explores some of the open mathematical challenges arising in the study of Deep Learning. In particular, we will focus on three main topics: (i) signal processing principles underpinning convolutional neural networks and their generalisations to non-euclidean geometries (ii) non-convex optimization challenges arising in high-dimensional (or overparametrised) learning problems, and (iii) geometry of Markov Decision Processes and its role in Reinforcement Learning guarantees.

  
  
  Prerequisites: Background on high-dimensional probability, statistics, and/or harmonic analysis. Familiarity with general Machine Learning topics and basic notions of optimization.
• CSCI-GA.3033-​023
  (3725) Special Topics: High Performance Machine Learning  Giacomo Domeniconi
  Office Hours
  Ulrich Finkler W 7:10-9:00PM CIWW 312
  

  Course Description:

  This is a capstone course for the MSCS program.

  One of the key ingredients of the success of Machine Learning is the ability to perform computations on very large amounts of training data. High Performance Computing (HPC) is where cutting edge technology (GPUs, low latency interconnects, etc.) is applied to the solution of computing intensive problems. Today, the application of High Performance Computing techniques to ML algorithms is a fundamental driver for the progress of Artificial Intelligence. In this course, you will learn HPC techniques that are typically applied to supercomputing software, and how they are applied to obtain the maximum performance out of ML algorithms.

  Topics: ML Hardware and Software stack, Performance analysis methodology, ML algorithms performance, CUDA, cuDNN, Pytorch, MPI, Parallel and Distributed ML algorithms.

  
  
  Prerequisites: Operating Systems and Computer Architecture: CSCI-GA 2250 or good understanding of Computer Architecture, C/C++ programming, OS design, process stack/heap, threads, file-system, IO, Networks. Python and C languages: good programming skills in Python and C. Machine Learning and Neural Networks Algorithms: The course is focused on the performance rather than the algorithmic aspects. A basic explanation of the algorithms will be part of the course. However, it is strongly recommended to start the course with a basic understanding of the following algorithms: logistic regression, neural networks, convolutional neural networks.
• CSCI-GA.3033-​024
  (20911) Special Topics: Big Data and ML Systems  Lakshminarayanan Subramanian
  Office Hours M 7:10-9:00PM CIWW 512
  

  Course Description:

  This class aims to cover introductory and recent concepts in big data and machine learning systems. The class will focus on a broad spectrum of big data computational problems, algorithms and platforms. The class will be centered around several big data case studies in commercial use to understand big data and machine learning tasks across different domains and provide an in-depth understanding of the problems and algorithms used in each domain. From the computational platform perspective, this class covers popular and widely used commercial platforms, Spark, streaming platforms, Tensorflow, ML platforms (MLBase, MxNet) and GPU platforms. The goal of this class is to educate students about the algorithms and systems techniques used to build scalable big data and ML platforms and how these platforms are used in the real world.

  This class covers the following broad topics:

  1. Cloud Infrastructure Blocks: AWS
  2. Big Data Algorithms: searching and indexing large data sets, implementing standard statistical algorithms, similar items, nearest neighbors, graph mining, network analytics, dimensionality reduction
  3. Big Data Computation Platforms: Spark, TensorFlow, MLBase, MLib, MxNet, GPU computing
  4. Scalable ML Algorithms: Implementing deep learning algorithms, graph and network analytics, scalable vision algorithms, scalable NLP algorithms
  5. Domain Specific Applications and Case Studies: vision analytics engines, NLP analytics engines, search and graph analytics
• CSCI-GA.3033-​025
  (20912) Special Topics: Cloud and Machine Learning  I-Hsin Chung
  Office Hours
  Seetharami Seelam R 5:10-7:00PM CIWW 201
  

  Course Description:

  This is a capstone course.

  This course exposes students to various cloud computing models and introduces them to performing machine learning on the cloud. The course material introduces students to various cloud providers including Amazon AWS, Google GCE, and IBM Cloud and their machine learning service capabilities. Students will learn how to build cloud systems for machine learning, the application characteristics, and develop hands-on experience with programming machine learning applications on these cloud platforms.

  
  
  Prerequisites: CSCI-GA 1170, CSCI-GA 2110, and CSCI-GA 2250. Basic understudying of operating systems and computer architecture, ability to program in at least one of c/c++, go, or Python languages. Basic understanding of cloud computing systems.
• CSCI-GA.3140-​001
  (20921) Abstract Interpretation  Patrick Cousot
  Office Hours M 5:10-7:00PM 60 Fifth Ave 446
  

  Course Description:

  Many numerical or symbolic problems are very hard or even undecidable meaning that no computer algorithm can solve them exactly in reasonable time and memory space. This course introduces the latest techniques in abstract interpretation, a powerful framework for automatically calculating approximate solutions of such difficult problems. The main emphasis will be on software verification and automatic analysis with a wide range of applications from compilers to social networks.

  
  
  Prerequisites: Some facility with logic, sets, linear algebra, graphs, formal languages, mathematical proofs, and programming languages is expected.
• CSCI-GA.3812-​001
  (2650) Information Technology Projects *  Evan Korth
  Office Hours W 6:00-9:00PM CIWW 512
  

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

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

  Course Description:

  
  
  Prerequisites: Approval of a faculty adviser and the Director of Graduate Studies for the M.S. programs.
• CSCI-GA.3850-​001
  (25261) PhD Seminar: Cryptography**  Yevgeniy Dodis
  Office Hours T 12:30-3:15PM CIWW 412
  

  Course Description:

  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
  (2659) PhD Seminar: Formal Methods**  Thomas Wies
  Office Hours R 11:00-12:30PM 60 Fifth Ave 446
  

  Course Description:

  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
  (2660) PhD Thesis Research **  STAFF -
  

  Course Description:

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

  Course Description:

  Participation in a programming project or research project conducted outside of the classroom in a governmental, commercial, or academic setting. Open only to graduate students with permission of the Director of Graduate Studies (DGS). Students must submit a brief written description of their work to the DGS before starting the internship and submit a written summary of their work when it is completed. MS students may take this course a maximum of two times. PhD students who wish to take this course more than four times need to request a special permission and provide adequate academic justification.

  Section 1 is for Master's students. Section 2 is for Ph.D. students.

  
  
  Prerequisites: Permission of Director of Graduate Studies.
• CSCI-GA.3870-​002
  (3359) Internship in Computer Science PhD*  STAFF -
  

  Course Description:

  Participation in a programming project or research project conducted outside of the classroom in a governmental, commercial, or academic setting. Open only to graduate students with permission of the Director of Graduate Studies (DGS). Students must submit a brief written description of their work to the DGS before starting the internship and submit a written summary of their work when it is completed. MS students may take this course a maximum of two times. PhD students who wish to take this course more than four times need to request a special permission and provide adequate academic justification.

  Section 1 is for Master's students. Section 2 is for Ph.D. students.

  
  
  Prerequisites: Permission of Director of Graduate Studies.
• MAINT-GA.4747-​001 Maintenance of Matriculation (MS Students)  STAFF -
  

  Course Description:

  Section 1 is for MS students. Section 4 is for non-supported PhD students.
• MAINT-GA.4747-​004 Maintenance of Matriculation (non-supported PhD students)  STAFF -
  

  Course Description:

  Section 1 is for MS students. Section 4 is for non-supported PhD students.
• CSCI-UA.0002-​001
  (7480) Intro To Computer Programming (No Prior Experience)  Deena Engel MW 2:00-3:15PM CIWW 101
  

  Course Description:

  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
  (9930) Intro To Computer Programming (No Prior Experience)  Joseph Versoza
  Office Hours TR 11:00-12:15PM CIWW 312
  

  Course Description:

  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
  (7841) Intro To Computer Programming (No Prior Experience)  Craig Kapp
  Office Hours MW 9:30-10:45AM CIWW 109
  

  Course Description:

  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
  (7842) Intro To Computer Programming (No Prior Experience)  Adam Meyers
  Office Hours TR 8:00-9:15AM 60 Fifth Ave C10
  

  Course Description:

  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
  (7843) Intro To Computer Programming (No Prior Experience)  Craig Kapp
  Office Hours T 5:00-7:30PM Tisch LC11
  

  Course Description:

  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 Intro To Computer Programming (No Prior Experience)  CANCELLED -
  

  Course Description:

  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
  (9089) Intro To Computer Programming (No Prior Experience)  David Gochfeld
  Office Hours MW 9:30-10:45AM 60 Fifth Ave C12
  

  Course Description:

  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
  (9651) Intro To Computer Programming (No Prior Experience)  Joseph Versoza
  Office Hours TR 9:30-10:45AM CIWW 202
  

  Course Description:

  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
  (9931) Intro To Computer Programming (No Prior Experience)  Adam Meyers
  Office Hours MW 8:00-9:15AM 60 Fifth Ave C10
  

  Course Description:

  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
  (9421) Intro To Computer Programming (No Prior Experience)  Michell Cardona
  Office Hours TR 8:00-9:15AM CIWW 101
  

  Course Description:

  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
  (19582) Intro To Computer Programming (No Prior Experience)  Saadia Lgarch
  Office Hours TR 3:30-4:45PM CIWW 512
  

  Course Description:

  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
  (7845) Intro to Web Design & Computer Principles  Alvaro Olsen MW 8:00-9:15AM 60 Fifth Ave 110
  

  Course Description:

  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
  (7846) Intro to Web Design & Computer Principles  Amos Bloomberg
  Office Hours TR 11:00-12:15PM CIWW 102
  

  Course Description:

  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
  (7847) Intro to Web Design & Computer Principles  Roy Vanegas MW 12:30-1:45PM CIWW 101
  

  Course Description:

  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 Intro to Web Design & Computer Principles  CANCELLED -
  

  Course Description:

  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
  (9090) Intro to Web Design & Computer Principles  Lee-Sean Huang
  Office Hours MW 3:30-4:45PM CIWW 101
  

  Course Description:

  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
  (9208) Intro to Web Design & Computer Principles  Lee-Sean Huang
  Office Hours MW 11:00-12:15PM CIWW 102
  

  Course Description:

  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
  (9795) Intro to Web Design & Computer Principles  Adam Scher
  Office Hours TR 8:00-9:15AM CIWW 102
  

  Course Description:

  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
  (7848) Database Design And Implementation  Deena Engel TR 2:00-3:15PM CIWW 102
  

  Course Description:

  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
  (8994) Web Development And Programming  Craig Kapp
  Office Hours MW 12:30-1:45PM CIWW 201
  

  Course Description:

  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
  (9423) Web Development And Programming  Nathan Hull TR 2:00-3:15PM CIWW 202
  

  Course Description:

  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
  (7849) Intro To Computer Science  Suzanne McIntosh
  Office Hours TR 11:00-12:15PM Silv 414
  

  Course Description:

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

  Course Description:

  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
  (9932) Intro To Computer Science  Suzanne McIntosh
  Office Hours MW 11:00-12:15PM 60 Fifth Ave 150
  

  Course Description:

  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
  (7851) Intro To Computer Science  Hilbert Gene Locklear
  Office Hours MW 3:30-4:45PM CIWW 102
  

  Course Description:

  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
  (9092) Intro To Computer Science  Candido Cabo
  Office Hours MW 12:30-1:45PM CIWW 202
  

  Course Description:

  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
  (9383) Intro To Computer Science  Amos Bloomberg
  Office Hours MW 2:00-3:15PM CIWW 102
  

  Course Description:

  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
  (10685) Intro To Computer Science  Douglas Moody
  Office Hours MW 9:30-10:45AM CIWW 202
  

  Course Description:

  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
  (19583) Intro To Computer Science  Nader Nassar
  Office Hours MW 8:00-9:15AM CIWW 102
  

  Course Description:

  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
  (7852) Data Structures  Chee Yap
  Office Hours MW 12:30-1:45PM CIWW 102
  

  Course Description:

  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
  (7853) Data Structures - Recitation  Chandra Prakash Konkimalla
  Office Hours T 12:30-1:45PM Silv 208
  

  Course Description:

  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
  (7854) Data Structures  Young Kun Ko
  Office Hours MW 9:30-10:45AM CIWW 102
  

  Course Description:

  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
  (7855) Data Structures - Recitation  Nicholas Greenquist
  Office Hours R 8:00-9:15AM CIWW 109
  

  Course Description:

  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
  (7856) Data Structures  Anasse Bari
  Office Hours TR 9:30-10:45AM 60 Fifth Ave 150
  

  Course Description:

  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
  (9424) Data Structures - Recitation  Daniel Rivera W 8:00-9:15AM 60 Fifth Ave 150
  

  Course Description:

  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
  (9425) Data Structures  Anasse Bari
  Office Hours TR 2:00-3:15PM Silv 401
  

  Course Description:

  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
  (9652) Data Structures - Recitation  Nicholas Greenquist
  Office Hours W 8:00-9:15AM CIWW 109
  

  Course Description:

  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
  (7857) Computer Systems Organization  Jinyang Li
  Office Hours MW 11:00-12:15PM 60 Fifth Ave C12
  

  Course Description:

  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
  (7858) Computer Systems Organization - Recitation  Lingfan Yu T 9:30-10:45AM 60 Fifth Ave C10
  

  Course Description:

  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
  (9753) Computer Systems Organization  Joanna Klukowska
  Office Hours TR 9:30-10:45AM CIWW 109
  

  Course Description:

  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
  (9754) Computer Systems Organization - Recitation  Christopher Moirano M 11:00-12:15PM CIWW 202
  

  Course Description:

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​005
  (10278) Computer Systems Organization  Allan Gottlieb TR 11:00-12:15PM CIWW 109
  

  Course Description:

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​006
  (10279) Computer Systems Organization - Recitation  Sai Anirudh Kondaveeti
  Office Hours M 3:30-4:45PM CIWW 109
  

  Course Description:

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​007
  (20932) Computer Systems Organization - Recitation  Christopher Moirano M 3:30-4:45PM CIWW 202
  

  Course Description:

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​008
  (20933) Computer Systems Organization - Recitation  Sai Anirudh Kondaveeti
  Office Hours W 3:30-4:45PM CIWW 202
  

  Course Description:

  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
  (7859) Operating Systems  Allan Gottlieb TR 3:30-4:45PM CIWW 109
  

  Course Description:

  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
  (10271) Operating Systems  Yan Shvartzshnaider
  Office Hours MW 11:00-12:15PM Meyr 102
  

  Course Description:

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

  Course Description:

  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
  (7861) Basic Algorithms - Recitation  Alan Siegel W 3:30-4:45PM CIWW 109
  

  Course Description:

  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
  (7862) Basic Algorithms  Gleb Pogudin MW 11:00-12:15PM CIWW 101
  

  Course Description:

  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
  (9426) Basic Algorithms - Recitation  Erica Dominic R 9:30-10:45AM 12WV L120
  

  Course Description:

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
• CSCI-UA.0310-​005
  (10144) Basic Algorithms  Victor Shoup TR 12:30-1:45PM CIWW 101
  

  Course Description:

  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-​006
  (10272) Basic Algorithms - Recitation  Tejal Lotlikar W 12:30-1:45PM CIWW 109
  

  Course Description:

  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
  (9508) Introduction to Computer Simulation  Charles Peskin TR 11:00-12:15PM CIWW 317
  

  Course Description:

  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
  (9509) Introduction to Computer Simulation  Charles Peskin F 11:00-12:15PM CIWW 317
  

  Course Description:

  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
  (9091) Topics of General Interest: Drawing on the Web  Joshua Clayton
  Office Hours TR 2:00-3:15PM CIWW 312
  

  Course Description:

  In this course you will learn how to develop multimedia applications for both the desktop and the web. The course focuses on general programming techniques with an emphasis on the production of interactive graphical environments. In addition, a number of advanced topics will be covered including image processing, video games, simulations, basic computer vision, augmented reality (AR), virtual reality (VR) and data visualization techniques.

  
  
  Prerequisites: Intro To Computer Programming (CSCI-UA 2) and Intro to Web Design & Computer Principles (CSCI-UA 4), or permission of Instructor
• CSCI-UA.0421-​001
  (7863) Numerical Computing   Michael Overton
  Office Hours TR 9:30-10:45AM CIWW 312
  

  Course Description:

  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
  (9654) Theory Of Computation   Richard Cole
  Office Hours TR 11:00-12:15PM 60 Fifth Ave C12
  

  Course Description:

  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.0473-​001
  (9933) Intro To Machine Learning  Kyunghyun Cho
  Office Hours TR 9:30-10:45AM CIWW 102
  

  Course Description:

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102), Linear Algebra (MATH-UA 140) and Probability and Statistics (MATH-UA 185). Students may take any of the following courses in place of MATH-UA 185: Theory of Probability (MATH-UA 333), Mathematical Statistics (MATH-UA 334), Honors Theory of Probability (MATH-UA 338) OR Data Analysis (MA-UY 2224).
• CSCI-UA.0480-​001 Special Topics: TBA  CANCELLED -
  

  Course Description:

  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
  (7865) Special Topics: iOS Programming  Nathan Hull MW 3:30-4:45PM CIWW 317
  

  Course Description:

  In this course, students will learn to create applications for Apple’s iOS on both the iPhone and the iPad using Objective-C, Apple's new programming language Swift, and the iOS SDK. Since its introduction, the Apple iOS SDK has proved to be a powerful platform upon which to build sophisticated applications. Without actually having to own an iPhone or an iPad, students will be able to build and test their applications on Apple Macs using the freely available compiler and simulator, XCode. Students will become proficient in the object-oriented language Objective-C,  Swift, Apple iOS Frameworks,  and the XCode development environment.  This is a new, dynamic, constantly-evolving topic, and students will be at the forefront a new technological advancement.

  
  
  Prerequisites: CSCI-UA.0201 with a grade of C or better
• CSCI-UA.0480-​003
  (7866) Special Topics: Parallel Computing  Mohamed Zahran
  Office Hours MW 2:00-3:15PM CIWW 109
  

  Course Description:

  Most of us have learned to program a single microprocessor (single core) using a high-level programming language like C/C++, Java, ... This is called sequential programming. We feel very comfortable with this because we think in a sequential way and give the machine statements to be executed in sequence. However, this has to change. A microprocessor with 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. A multicore processor contains several cores (called CPUs or cores) on-chip. To make the best use of these multicore chips we need to program them in-parallel. Sequential programming, for all platforms from smartphones 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 with a grade of C or better
• CSCI-UA.0480-​004
  (9093) Special Topics: Algorithmic Problem Solving  Joanna Klukowska
  Office Hours TR 12:30-1:45PM Silv 520
  

  Course Description:

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

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201) and Basic Algorithms (CSC-UA 310) with a grade of C or better. Student must also register for the Recitation – CSCI-UA.480-005.
• CSCI-UA.0480-​005
  (9427) Special Topics: Algorithmic Problem Solving - Recitation  Doruk Kilitçioglu
  Office Hours F 5:10-7:10PM CIWW 101
  

  Course Description:

  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
  (9428) Special Topics: Computer Graphics  Kenneth Perlin
  Office Hours TR 11:00-12:15PM 194M 306
  

  Course Description:

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

  
  
  Prerequisites: CSCI-UA 201 Computer Systems Organization, CSCI-UA-310 (Basic Algorithms) and MATH-UA-140 (Linear Algebra) with grades of C or better, or departmental consent.
• CSCI-UA.0480-​007
  (9653) Special Topics: Agile Software Development and DevOps  Amos Bloomberg
  Office Hours TR 12:30-1:45PM CIWW 109
  

  Course Description:

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

  
  
  Prerequisites: CSCI-UA.0201 with a grade of C or better
• CSCI-UA.0480-​008
  (10136) Special Topics: Applied Internet Technology  Joseph Versoza
  Office Hours MW 11:00-12:15PM CIWW 109
  

  Course Description:

  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 with a grade of C or better
• CSCI-UA.0480-​009
  (10275) Special Topics: Natural Language Processing  Adam Meyers
  Office Hours MW 12:30-1:45PM Silv 414
  

  Course Description:

  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 with a grade of C or better
• CSCI-UA.0480-​010
  (10662) Special Topics: Open Source Software Development  Joanna Klukowska
  Office Hours MW 3:30-4:45PM CIWW 517
  

  Course Description:

  This course prepares students to become active participants in open source projects. It begins with an overview of the philosophy and brief history of open source development, followed by an in-depth look at different types of open source projects and the study of various tools involved in open source development. In particular, it covers the collaborative nature of open source projects, community structure, version control systems, licensing, intellectual property, types of contributions (programming and non-programming) and the tool-chains that enable such contributions. The students are expected to contribute to existing open source projects.

  
  
  Prerequisites: CSCI-UA.0201 with a grade of C or better
• CSCI-UA.0480-​011
  (19584) Special Topics: Introduction to Computer Security  Joseph Bonneau
  Office Hours MW 12:30-1:45PM 60 Fifth Ave 150
  

  Course Description:

  This course will cover basic principles of computer security and security engineering. To facilitate understanding, this course will consider security both from an attacker's perspective (threat modeling) and the defender's perspective (building and deploying secure systems). Specific topics will include operating system security, network security, web security, and mobile device security. Course projects will focus both on writing secure code and exploiting insecure code.

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201) with a grade of C or better. Recommended: Operating Systems (CSCI-UA.202)
• CSCI-UA.0480-​012
  (25368) Special Topics: iOS Programming  Nathan Hull MW 12:30-1:45PM CIWW 312
  

  Course Description:

  In this course, students will learn to create applications for Apple’s iOS on both the iPhone and the iPad using Objective-C, Apple's new programming language Swift, and the iOS SDK. Since its introduction, the Apple iOS SDK has proved to be a powerful platform upon which to build sophisticated applications. Without actually having to own an iPhone or an iPad, students will be able to build and test their applications on Apple Macs using the freely available compiler and simulator, XCode. Students will become proficient in the object-oriented language Objective-C, Swift, Apple iOS Frameworks, and the XCode development environment. This is a new, dynamic, constantly-evolving topic, and students will be at the forefront a new technological advancement.

  
  
  Prerequisites: CSCI-UA.0201 with a grade of C or better

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