Course Schedule

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

View undergraduate course grid View graduate course grid

• CSCI-UA.0002-​001
  (7639) Intro To Computer Programming (No Prior Experience)  Amanda Steigman MW 8:00-9:15AM CIWW 202
  

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

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

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

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

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

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

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

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

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

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

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

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

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

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

  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
  (8648) Intro To Computer Programming (No Prior Experience)  Emily Zhao MW 2:00-3:15PM CIWW 312
  

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

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

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

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

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

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

  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-​013
  (9916) Intro To Computer Programming (No Prior Experience)  Michell Cardona TR 6:20-7:35PM CIWW 201
  

  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.0003-​001
  (9947) Intro to Computer Programming (Limited Prior Experience)  Adam Meyers MW 11:00-12:15PM Silv 208
  

  Introduces object-oriented programming, recursion, and other important concepts to students who already have had some exposure to programming in the context of building applications using Python. Students will design and implement Python programs in a variety of applied areas.

  
  
  Prerequisites: Limited programming experience, or any score on the AP Computer Science examination (students will forfeit the AP credit for scores of 4 or 5), or Data Science for Everyone (DS-UA 111). 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 some 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
  (7643) Intro to Web Design & Computer Principles  Alvaro Olsen MW 8:00-9:15AM CIWW 101
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0004-​002
  (7644) Intro to Web Design & Computer Principles  Adam Scher TR 8:00-9:15AM Online
  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
  (9917) Intro to Web Design & Computer Principles  Joshua Clayton TR 9:30-10:45AM Bobst LL138
  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
  (9330) Intro to Web Design & Computer Principles  Mark Ramos MW 11:00-12:15PM CIWW 312
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0004-​005
  (21109) Intro to Web Design & Computer Principles  Julie Lizardo TR 2:00-3:15PM CIWW 317
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0004-​006
  (8784) Intro to Web Design & Computer Principles  Alvaro Olsen MW 3:30-4:45PM CIWW 312
  Introduces students to both the practice of web design and the basic principles of computer science. The practice component covers not only web design but also current graphics and software tools. The principles section includes an overview of hardware and software, the history of computers, and a discussion of the impact of computers and the Internet.
  
  Prerequisites: Three years of high school mathematics or equivalent. No prior computing experience is assumed. Students with computing experience should consult with the department before registering.
• CSCI-UA.0060-​001
  (7645) Database Design And Implementation  Amos Bloomberg TR 12:30-1:45PM 60 Fifth Ave 150
  

  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
  (8393) Web Development And Programming  Craig Kapp MW 12:30-1:45PM Meyr 122
  

  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
  (7646) Intro To Computer Science  Nader Nassar MW 8:00-9:15AM Silv 208
  

  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
  (7647) Intro To Computer Science  Gabriel Provencher Langlois TR 8:00-9:15AM CIWW 101
  

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

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

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

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

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

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

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

  
  
  Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
• CSCI-UA.0101-​006
  (8628) Intro To Computer Science  Hilbert Gene Locklear TR 12:30-1:45PM CIWW 101
  

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

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

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

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

  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-​009
  (9918) Intro To Computer Science  Michael Tao MW 3:30-4:45PM GCASL 275
  

  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-​010
  (10537) Intro To Computer Science  Daniel Zint TR 3:30-4:45PM CIWW 317
  

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

  
  
  Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), or a score of 3 on the AP Computer Science exam (scores of 4 and 5 are acceptable prerequisites for students who wish to take CSCI-UA 101 before entering CSCI-UA 102; they will forfeit the AP credit), or departmental permission assessed by placement exam.
• CSCI-UA.0102-​001
  (9919) Data Structures  Evan Korth MW 3:30-4:45PM CIWW 109
  

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

  
  
  Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
• CSCI-UA.0102-​002
  (9924) Data Structures - Recitation  Adithya Viswanathan F 3:30-4:45PM Cant 101 Additional information: In-person Recitation for Section 1
  

  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
  (9921) Data Structures  Anasse Bari TR 2:00-3:15PM Meyr 122
  

  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
  (9925) Data Structures - Recitation  Chris Davidson W 9:30-10:45AM Meyr 122 Additional information: In-person recitation for Section 3
  

  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
  (9922) Data Structures  Joanna Klukowska MW 8:00-9:15AM CIWW 109
  

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

  
  
  Prerequisites: Introduction to Computer Science (CSCI-UA 101), or a score of 4 or 5 on the AP Computer Science examination.
• CSCI-UA.0102-​006
  (9923) Data Structures - Recitation  Surya Dheeshjith F 11:00-12:15PM Tisch LC11 Additional information: In-person Recitation for Section 5
  

  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-​021
  (9920) Data Structures - Recitation  Vaibhav Mavi F 3:30-4:45PM Online Additional information: Online Recitation for Section 1
  

  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-​061
  (9927) Data Structures - Recitation  Joel Tellis F 11:00-12:15PM Online Additional information: Online Recitation for Section 51
  

  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-​062
  (9928) Data Structures - Recitation  Surya Dheeshjith F 9:30-10:45AM GCASL 388 Additional information: In-person recitation for Section 5
  

  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-​063
  (9929) Data Structures - Recitation  Anirudh Nistala R 9:30-10:45AM 7E12 LL23 Additional information: In-person recitation for Section 5
  

  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-​064
  (9930) Data Structures - Recitation  Joseph Cappadona F 2:00-3:15PM Bobst LL138 Additional information: In-person recitation for Section 5
  

  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-​065
  (9931) Data Structures - Recitation  Joel Tellis R 2:00-3:15PM Kimmel 808 Additional information: In-person recitation for Section 5
  

  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
  (7649) Computer Systems Organization  Douglas Moody MW 9:30-10:45AM CIWW 101
  

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​002
  (7650) Computer Systems Organization - Recitation  Shraddha Thyagarajan Iyer F 9:30-10:45AM 60 Fifth Ave 150 Additional information: In-person recitation for Section 1
  

  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
  (8772) Computer Systems Organization  Gizem Kayar MW 11:00-12:15PM CIWW 109
  

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102).
• CSCI-UA.0201-​004
  (8773) Computer Systems Organization - Recitation  Vaibhav Mavi R 4:55-6:10PM Silv 520 Additional information: In-person recitation for Section 3
  

  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
  (8887) Computer Systems Organization  Hasan Aljabbouli TR 9:30-10:45AM Online
  

  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
  (8888) Computer Systems Organization - Recitation  Swapnil Gupta W 8:00-9:15AM 60 Fifth Ave 150 Additional information: In-person recitation for Section 5
  

  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
  (9932) Computer Systems Organization  Jean-Claude Franchitti MW 3:30-4:45PM Silv 408
  

  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
  (9933) Computer Systems Organization - Recitation  Yang Gao F 3:30-4:45PM 60 Fifth Ave 150 Additional information: In-person recitation for Section 7
  

  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-​021
  (9332) Computer Systems Organization - Recitation  Jaya Amit Sai Gurrala F 9:30-10:45AM Online Additional information: Online Recitation for Section 1
  

  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-​041
  (9032) Computer Systems Organization - Recitation  Sai Krishna Chaitanya Annavazala R 4:55-6:10PM Online Additional information: Online Recitation for Section 3
  

  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-​061
  (9333) Computer Systems Organization - Recitation  Shraddha Thyagarajan Iyer W 8:00-9:15AM Online Additional information: Online Recitation for Section 5
  

  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-​081
  (9934) Computer Systems Organization - Recitation  Joanna Gilberti F 3:30-4:45PM Online Additional information: Online Recitation for Section 7
  

  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
  (7651) Operating Systems  Michael Walfish MW 3:30-4:45PM Silv 207
  

  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
  (8886) Operating Systems  Yang Tang TR 12:30-1:45PM Cant 101
  

  Covers the principles and design of operating systems. Topics include process scheduling and synchronization, deadlocks, memory management (including virtual memory), input/output, and file systems. Programming assignments.

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201).
• CSCI-UA.0310-​001
  (7652) Basic Algorithms  Seyed Hossein Nassajianmojarrad TR 12:30-1:45PM Online
  

  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
  (7653) Basic Algorithms - Recitation  Abishek Shyamsunder F 11:00-12:15PM GCASL 279 Additional information: In-person recitation for Section 1
  

  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
  (7654) Basic Algorithms  Oded Regev TR 8:00-9:15AM Silv 411
  

  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
  (8649) Basic Algorithms - Recitation  Ishan Agarwal W 8:00-9:15AM Silv 401 Additional information: In-person recitation for Section 3
  

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

  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-​007
  (21110) Basic Algorithms  Vladimir Podolskii MW 11:00-12:15PM GCASL 269
  

  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-​008
  (21111) Basic Algorithms - Recitation  Majid Daliri F 11:00-12:15PM Silv 208 Additional information: In-person recitation for Section 7
  

  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-​021
  (9936) Basic Algorithms - Recitation  Shantanu Dahiya F 11:00-12:15PM Online Additional information: Online Recitation for Section 1
  

  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-​041
  (9937) Basic Algorithms - Recitation  Aaron Zweig W 8:00-9:15AM Online Additional information: Online Recitation for Section 3
  

  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-​061
  (9611) Basic Algorithms - Recitation  Alan Siegel F 2:00-3:15PM Online Additional information: Online Recitation for Section 5
  

  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-​081
  (21112) Basic Algorithms - Recitation  Lakshay Tyagi F 11:00-12:15PM Online Additional information: Online Recitation for Section 7
  

  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
  (8699) Introduction to Computer Simulation  Charles Peskin TR 11:00-12:15PM 194M 204
  

  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
  (8700) Introduction to Computer Simulation  Claire Nicole Valva F 11:00-12:15PM 194M 208 Additional information: In-person recitation for Section 1
  

  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
  (8452) Topics of General Interest: Drawing on the Web  Joshua Clayton MW 3:30-4:45PM CIWW 317
  

  The Web is an intrinsically visual medium whose graphical capabilities are diverse and evolving. With the development of HTML5 and CSS3, there are now multiple ways to code images and animation natively in the browser. This course will provide a survey of current drawing techniques. We will create a series of Web-based projects that involve raster graphics, vector graphics, and interactivity using HTML, CSS, SVG, and JavaScript. Drawing on the Web builds upon foundations in Web design and computer programming with a focus on the range of graphics that can be coded into Web pages.

  
  
  Prerequisites: CSCI-UA.0002 Intro to Computer Programming and CSCI-UA.0004 Intro to Web Design and Computer Principles, or permission of Instructor
• CSCI-UA.0381-​001
  (9948) Programming Tools for the Data Scientist  Hasan Aljabbouli TR 11:00-12:15PM 19W4 C-20
  

  Lecture and laboratory.  Building applications in Python using a project-based learning approach. Students use Python packages in a variety of applied areas, such as textual analysis and data visualization. Does not count toward the computer science major. 

  
  
  Prerequisites: Data Science for Everyone (DS-UA 111) or equivalent proficiency in Python, and either Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3).
• CSCI-UA.0421-​001
  (7655) Numerical Computing   Michael Overton TR 2:00-3:15PM Silv 408
  

  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
  (8739) Theory Of Computation   Subhash Khot TR 9:30-10:45AM Silv 208
  

  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.0467-​001
  (9949) Applied Internet Technology  Joseph Versoza MW 12:30-1:45PM GCASL 261
  

  Applied Internet Technology is a practical introduction to creating modern web applications. It covers full-stack (that is, every aspect of building a database driven web application: server programming, database implementation, frontend markup, styling and interactivity) web development. It includes topics such as database and data model design, web application architecture, separation of logic and presentation, handling user input and processing form data, managing asynchronous processes, strategies for creating real-time web applications, and handling client-side interactivity. Students will use current server and client-side web frameworks and libraries to build dynamic, data-driven sites. Various applications to support development will also be introduced, such as version control, static analysis tools, and build systems.

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201). Students who complete Applied Internet Technology (CSCI-UA 467) with a C or better are not eligible to take Web Development and Programming (CSCI-UA 61).
• CSCI-UA.0467-​002
  (9950) Applied Internet Technology  Joseph Versoza TR 9:30-10:45AM 194M 206
  

  Applied Internet Technology is a practical introduction to creating modern web applications. It covers full-stack (that is, every aspect of building a database driven web application: server programming, database implementation, frontend markup, styling and interactivity) web development. It includes topics such as database and data model design, web application architecture, separation of logic and presentation, handling user input and processing form data, managing asynchronous processes, strategies for creating real-time web applications, and handling client-side interactivity. Students will use current server and client-side web frameworks and libraries to build dynamic, data-driven sites. Various applications to support development will also be introduced, such as version control, static analysis tools, and build systems.

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201). Students who complete Applied Internet Technology (CSCI-UA 467) with a C or better are not eligible to take Web Development and Programming (CSCI-UA 61).
• CSCI-UA.0470-​001
  (9938) Object Oriented Programming  Hasan Aljabbouli TR 2:00-3:15PM CIWW 101
  

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

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201).
• CSCI-UA.0472-​001
  (9939) Artificial Intelligence   Ernest Davis MW 11:00-12:15PM Online
  Many cognitive tasks that people can do easily and almost unconsciously have proven extremely difficult to program on a computer. Artificial intelligence tackles the problem of developing computer systems that can carry out these tasks. Focus is on three central areas in AI: representation and reasoning, machine learning, and natural language processing.
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201) and Basic Algorithms (CSCI-UA 310).
• CSCI-UA.0473-​001
  (8821) Fundamentals of Machine Learning  Pascal Wallisch MW 12:30-1:45PM CIWW 109
  

  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.0473-​002
  (21115) Fundamentals of Machine Learning - Recitation  Kaushik Tummalapalli R 12:30-1:45PM GCASL C95 Additional information: In-person recitation for CSCI-UA.473-001
  

  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.0473-​021
  (21116) Fundamentals of Machine Learning - Recitation  Inder Preet Walia R 12:30-1:45PM Online Additional information: Online Recitation for CSCI-UA.473-001
  

  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.0476-​001
  (9115) Processing Big Data for Analytics Applications  Ann Malavet TR 8:00-9:15AM Silv 206
  

  Introduces platforms, tools, and architectures that facilitate scalable management and processing of vast quantities of data. Explores open source tools enabling the efficient acquisition, distributed storage, and processing of big data. Provides hands-on experience with distributed processing Apache solutions such as Hadoop MapReduce, HBase, Hive, Impala, Pig, core Spark, Spark SQL, and Spark Streaming. Other Apache big data tools covered are Oozie, Zookeeper, Flume, and Kafka.

  
  
  Prerequisites: (CSCI-UA 201) Computer Systems Organization and (CSCI-UA 310) Basic Algorithms. Familiarity with Linux commands and SQL will be helpful but is not required.
• CSCI-UA.0478-​001
  MATH-UA.0243
  (9940) Introduction To Cryptography  CANCELLED -
  An introduction to the principles and practice of cryptography and its application to network security. Topics include symmetric-key encryption (block ciphers, modes of operations, AES), message authentication (pseudorandom functions, CBC-MAC), public-key encryption (RSA, ElGamal), digital signatures (RSA, Fiat-Shamir), and authentication applications (identification, zero-knowledge).
  
  Prerequisites: Basic Algorithms (CSCI-UA 310).
• CSCI-UA.0479-​001
  (9336) Data Management and Analysis  Joseph Versoza MW 9:30-10:45AM Silv 408
  

  Extracting, transforming and analyzing data in myriad formats. Using traditional relational
  databases as well as non-relational databases as well as non-relational databases to store, manipulate, and query data. Students write custom programs, create queries, and use data analysis tools and libraries on a wide array of data sets.  Additional topics: data modeling, cloud databases and AP programming.

  
  
  Prerequisites: Data Structures (CSCI-UA 102). Students that complete Data Management and Analysis (CSCI-UA 479) with a C or better are not eligible to take Database Design and Implementation (CSCI-UA 60).
• CSCI-UA.0479-​002
  (9994) Data Management and Analysis  Matthew Zeidenberg TR 3:30-4:45PM Silv 520
  

  Extracting, transforming and analyzing data in myriad formats. Using traditional relational
  databases as well as non-relational databases as well as non-relational databases to store, manipulate, and query data. Students write custom programs, create queries, and use data analysis tools and libraries on a wide array of data sets.  Additional topics: data modeling, cloud databases and AP programming.

  
  
  Prerequisites: Data Structures (CSCI-UA 102). Students that complete Data Management and Analysis (CSCI-UA 479) with a C or better are not eligible to take Database Design and Implementation (CSCI-UA 60).
• CSCI-UA.0480-​041
  (21113) Special Topics: Computer Graphics  Gizem Kayar TR 12:30-1:45PM 12WV L120
  

  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), or departmental consent.
• CSCI-UA.0480-​051
  (9941) Special Topics: Parallel Computing  Mohamed Zahran TR 2:00-3:15PM Online
  

  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: Computer System Organization (CSCI-UA.0201) with a grade of C or better
• CSCI-UA.0480-​057
  (9942) Special Topics: Natural Language Processing  Adam Meyers TR 9:30-10:45AM Silv 408
  

  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-​061
  (9944) Special Topics: Open Source Software Development  Joanna Klukowska MW 12:30-1:45PM CIWW 202
  

  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-​063
  (21114) Special Topics: Introduction to Computer Security  Joseph Bonneau MW 2:00-3:15PM Silv 408
  

  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: CSCI-UA.0201 with a grade of C or better. Recommended: Operating Systems (CSCI-UA.202).
• CSCI-UA.0480-​069
  (9943) Special Topics: Agile Software Development and DevOps  Amos Bloomberg MW 12:30-1:45PM Silv 405
  

  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-​072
  (9945) Special Topics: Introduction to Robot Intelligence  Lerrel Pinto TR 3:30-4:45PM 60 Fifth Ave C15
  

  Robots have made a profound impact in our lives. It is almost impossible to imagine a world without them. Without robots, we would not have phones (mass-produced by robot manipulators), delivery services (fulfilled by mobile robots), or affordable electronics. But still, robots have ways to go. Open-ended problems with robots are endless from space exploration, self-driving, and general-purpose home assistants. In this class, we will take the first steps to creating machines that can think (robots). We will go over the fundamentals of robotic behavior by studying robot kinematics, dynamics, and control. Following this, we will study how robots can plan long-term behaviors in their environments without crashing into obstacles. Finally, we will see how modern ideas in optimization and AI can enable robotic grasping, self-driving, and walking. This introductory course will focus on understanding foundational robotic concepts, while broadly looking at their application in the real world.

  
  
  Prerequisites: CSCI-UA.0201 with a grade of C or better
• CSCI-UA.0480-​073
  (24778) Special Topics: Randomized Algorithms  Richard Cole MW 9:30-10:45AM CIWW 317
  

  This course will look at randomization as a tool for designing more efficient algorithms. Examples include primality testing, string matching, stable matching with random preferences, parallel quicksort, hashing, bloom filters. The course will cover the necessary background in probability.

  
  
  Prerequisites: CSCI-UA.310 Basic Algorithms and CSCI-UA.201 Computer Systems Organization

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