Course Schedule

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

View undergraduate course grid View graduate course grid

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

  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
  (7152) Intro To Computer Programming (No Prior Experience)  Susan Liao TR 8:00-9:15AM Tisch LC11
  

  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
  (7153) 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
  (8712) Intro To Computer Programming (No Prior Experience)  Nathan Miranda TR 9:30-10:45AM 12WV L120
  

  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
  (7154) Intro To Computer Programming (No Prior Experience)  David Prager MW 11:00-12:15PM 12WV L120
  

  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
  (7155) Intro To Computer Programming (No Prior Experience)  Mihir Patil MW 9:30-10:45AM 194M 305
  

  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
  (7156) Intro To Computer Programming (No Prior Experience)  David Prager MW 12:30-1:45PM Tisch LC11
  

  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
  (8219) Intro To Computer Programming (No Prior Experience)  Emily Zhao TR 12:30-1:45PM Tisch LC11
  

  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
  (8221) Intro To Computer Programming (No Prior Experience)  Matthew Zeidenberg TR 2:00-3:15PM Silv 101A
  

  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
  (8370) Intro To Computer Programming (No Prior Experience)  Joshua Clayton MW 3:30-4:45PM 60 Fifth Ave 150
  

  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
  (9047) 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-​012
  (8509) Intro To Computer Programming (No Prior Experience)  Emily Zhao TR 4:55-6:10PM 12WV L120
  

  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
  (10164) Intro To Computer Programming (No Prior Experience)  David Prager TR 8:00-9:15AM 7E12 LL23
  

  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-​014
  (22984) Intro To Computer Programming (No Prior Experience)  Na'im Tyson MW 8:00-9:15AM Tisch LC11
  

  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
  (8859) Intro to Computer Programming (Limited Prior Experience)  Adam Meyers TR 11:00-12:15PM Silv 520
  

  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.0003-​002
  (23408) Intro to Computer Programming (Limited Prior Experience)  Adrian Caciula MW 9:30-10:45AM CIWW 312
  

  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
  (8309) 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
  (7157) 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
  (7158) Intro to Web Design & Computer Principles  Mark Ramos MW 11:00-12:15PM 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
  (7159) Intro to Web Design & Computer Principles  Joshua Clayton TR 11:00-12:15PM 60 Fifth Ave 110
  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
  (8102) Intro to Web Design & Computer Principles  Emily Zhao MW 12:30-1:45PM GCASL 383
  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
  (8220) Intro to Web Design & Computer Principles  Alvaro Olsen MW 3:30-4:45PM GCASL 279
  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
  (8239) Database Design And Implementation  Amos Bloomberg TR 11:00-12:15PM Online
  

  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
  (7160) Web Development And Programming  Sana Odeh MW 3:30-4:45PM CIWW 109
  

  Provides a practical approach to web technologies and programming. Students build interactive, secure, and powerful web programs. Covers client and server side technologies for the web.

  
  
  Prerequisites: Introduction to Computer Programming (No Prior Experience) (CSCI-UA 2) or Introduction to Computer Programming (Limited Prior Experience) (CSCI-UA 3), and Introduction to Web Design and Computer Principles (CSCI-UA 4). Students that have successfully completed Applied Internet Technology (CSCI-UA 467) are NOT eligible to take this course.
• CSCI-UA.0101-​001
  (7161) 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
  (9254) Intro To Computer Science  Gabriel Provencher Langlois TR 8:00-9:15AM Silv 206
  

  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
  (9697) Intro To Computer Science  Hilbert Gene Locklear MW 12:30-1:45PM 7E12 LL23
  

  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
  (7162) Intro To Computer Science  Candido Cabo TR 12:30-1:45PM GCASL 388
  

  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
  (8125) Intro To Computer Science  Sana Odeh 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-​006
  (9253) Intro To Computer Science  Anasse Bari TR 2:00-3:15PM Silv 520
  

  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
  (8311) Intro To Computer Science  Michael Tao MW 3:30-4: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-​008
  (8580) Intro To Computer Science  Daniel Zint TR 3:30-4: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-​009
  (10059) Intro To Computer Science  Sana Odeh MW 4:55-6:10PM 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-​010
  (23118) Intro To Computer Science  Gizem Kayar TR 11:00-12:15PM CIWW 109
  

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

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

  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
  (7165) Data Structures - Recitation  Arunima Mitra F 8:00-9:15AM CIWW 312 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
  (7166) Data Structures  Anasse Bari TR 11:00-12:15PM Bobst LL138
  

  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
  (8349) Data Structures - Recitation  Norihito Naka F 9:30-10:45AM CIWW 202 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
  (8728) Data Structures  Joanna Klukowska MW 8:00-9:15AM GCASL C95
  

  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
  (8729) Data Structures - Recitation  Anirudh Nistala F 8:00-9:15AM CIWW 317 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
  (9042) Data Structures - Recitation  Arunima Mitra F 9:30-10:45AM CIWW 312 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-​022
  (20025) Data Structures - Recitation  Nolan Filter F 11:00-12:15PM CIWW 312 Additional information: n-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-​023
  (20026) Data Structures - Recitation  Sanghyun Woo F 12:30-1:45PM CIWW 312 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-​024
  (20027) Data Structures - Recitation  Alan Amin F 2:00-3:15PM CIWW 312 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-​025
  (20028) Data Structures - Recitation  Sanghyun Woo F 3:30-4:45PM CIWW 312 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-​026
  (24595) Data Structures - Recitation  Alan Amin F 3:30-4:45PM CIWW 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-​041
  (9062) Data Structures - Recitation  Tanya Pushkin Garg F 11:00-12:15PM CIWW 202 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-​061
  (8737) Data Structures - Recitation  Sungmin Cha F 9:30-10:45AM CIWW 317 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-​062
  (8738) Data Structures - Recitation  Joel Tellis F 11:00-12:15PM CIWW 317 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
  (8874) Data Structures - Recitation  Sungmin Cha F 12:30-1:45PM CIWW 317 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
  (8931) Data Structures - Recitation  Anirudh Nistala F 2:00-3:15PM CIWW 317 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
  (7163) Data Structures - Recitation  Joel Tellis F 3:30-4:45PM CIWW 317 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
  (7167) 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
  (7168) Computer Systems Organization - Recitation  Stacy Chao F 9:30-10:45AM GCASL 383 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
  (8238) Computer Systems Organization  Hasan Aljabbouli TR 9:30-10:45AM 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-​004
  (8528) Computer Systems Organization - Recitation  Abhishek Narayanan F 9:30-10:45AM Silv 405 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
  (8529) Computer Systems Organization  Benjamin Goldberg MW 3:30-4:45PM Silv 405
  

  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
  (8530) Computer Systems Organization - Recitation  Ekanshdeep Gupta F 2:00-3:15PM Silv 408 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
  (10058) Computer Systems Organization  Gizem Kayar TR 3:30-4:45PM Silv 401
  

  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
  (10060) Computer Systems Organization - Recitation  Abhishek Narayanan F 2:00-3:15PM 19UP 102 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.0202-​001
  (7169) Operating Systems  Yang Tang MW 3:30-4:45PM Online
  

  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
  (8662) Operating Systems  Aurojit Panda TR 11:00-12:15PM Cant 102
  

  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
  (7170) Basic Algorithms  Chee Yap TR 12:30-1:45PM 5WP 101
  

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

  
  
  Prerequisites: Data Structures (CSCI-UA 102); Discrete Mathematics (MATH-UA 120); and either Calculus I (MATH-UA 121) OR Mathematics for Economics I (MATH-UA 211).
• CSCI-UA.0310-​002
  (7171) Basic Algorithms - Recitation  Bingwei Zhang 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
  (8661) 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-​004
  (8932) Basic Algorithms - Recitation  Alan Siegel F 11:00-12:15PM 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-​007
  (24306) Basic Algorithms  Jiaxin Guan MW 9:30-10:45AM CIWW 317
  

  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
  (24338) Basic Algorithms - Recitation  Theresa Van T 9:30-10:45AM CIWW 317 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
  (9255) Basic Algorithms - Recitation  Zhaoqi Zhang F 12:30-1:45PM GCASL 275 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-​022
  (20029) Basic Algorithms - Recitation  Bingwei Zhang F 2:00-3:15PM GCASL 383 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.0380-​001
  (7172) Topics of General Interest: Interactive Computing  Craig Kapp MW 3:30-4:45PM Silv 208
  

  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: CSCI-UA.0002 and CSCI-UA.0004, or permission of Instructor
• CSCI-UA.0381-​001
  (9259) Programming Tools for the Data Scientist  Hasan Aljabbouli TR 3:30-4:45PM Meyr 122
  

  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.0453-​001
  (23117) Theory Of Computation   Richard Cole TR 12:30-1:45PM CIWW 101
  

  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
  (9260) Applied Internet Technology  Joseph Versoza TR 9:30-10:45AM CIWW 101
  

  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
  (9698) Applied Internet Technology  Joseph Versoza MW 12:30-1:45PM CIWW 109
  

  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
  (9257) Object Oriented Programming  Hasan Aljabbouli MW 9:30-10:45AM Silv 101A
  

  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.0473-​001
  (9413) Fundamentals of Machine Learning  Sumit Chopra TR 2:00-3:15PM Cant 102
  

  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
  (10099) Fundamentals of Machine Learning - Recitation  Duygu Ataman F 2:00-3:15PM 60 Fifth Ave 150 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
  (20032) Fundamentals of Machine Learning - Recitation  Duygu Ataman F 9:30-10:45AM 60 Fifth Ave 150 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.0474-​001
  (9258) Software Engineering  Amos Bloomberg MW 2:00-3:15PM Online
  

  An intense hands-on study of practical techniques and methods of software engineering. Topics include advanced object-oriented design, design patterns, refactoring, code optimization, universal modeling language, threading, user interface design, enterprise application development, and development tools. All topics are integrated and applied during the semester long group project. The aim of the project is to prepare students for dynamics in a real workplace. Members of the group meet on a regular basis to discuss the project and to assign individual tasks. Students are judged primarily on the final project presentations. Not offered every academic year. 

  
  
  Prerequisites: Computer Systems Organization (CSCI-UA 201).
• CSCI-UA.0476-​001
  (9009) Processing Big Data for Analytics Applications  Ann Malavet TR 8:00-9:15AM CIWW 102
  

  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.0479-​001
  (9261) Data Management and Analysis  Joseph Versoza MW 11:00-12:15PM CIWW 101
  

  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
  (9699) Data Management and Analysis  Matthew Zeidenberg TR 11:00-12:15PM Silv 101A
  

  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-​003
  (10106) Data Management and Analysis  Matthew Zeidenberg MW 3:30-4:45PM Silv 401
  

  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
  (8595) Special Topics: Computer Graphics  Kenneth Perlin TR 8:00-9:15AM 60 Fifth Ave 110
  

  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-​042
  (9371) Special Topics: Computer Vision  Davi Geiger TR 4:55-6:10PM Silv 401
  

  An introduction to the field of computer vision. Basic concepts will be covered such as edge detection, stereo vision, motion, color, texture and recognition.

  
  
  Prerequisites: Computer System Organization (CSCI-UA.0201) and Linear Algebra (CSCI-UA 140) with a grade of C or better
• CSCI-UA.0480-​046
  (8350) Special Topics: Intro to Social Networking  Bhubaneswar Mishra TR 3:30-4:45PM CIWW 312
  

  Social Networks is a specific example of many forms of networks that have become ubiquitous in our modern society. Their utilities have been enhanced by their ability to generate massive amount of personal data that need to be analyzed and disseminated quickly. The World Wide Web enables information flows among vast number of humans; Facebook, LinkedIn, etc. connect small groups of friends; amazon, eBay, etc. provide opportunities for trading, etc. These networks determine our information, influence our opinions, and shape our political attitudes. They also link us, often through important but weak ties, to other humans. Their origin is biological: going back to quorum-sensing, swarming, flocking, social grooming, gossip, etc. Yet, as we have connected our social networks to traditional human institutions (markets, justice systems, education, etc.) through new technologies, the underlying biology has become obscured, but not dormant. This course will introduce the tools, analytics and algorithms for the study of networks and their data. It will show how certain common principles permeate the functioning of these diverse networks: e.g., issues related to robustness, fragility, and interlinkages etc.

  
  
  Prerequisites: Computer System Organization (CSCI-UA.0201) with a grade of C or better
• CSCI-UA.0480-​051
  (23116) 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-​052
  (9981) Special Topics: Algorithmic Problem Solving  Joanna Klukowska MW 12:30-1:45PM Meyr 122
  

  Student must also register for a Recitation section.

  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: CSCI-UA.0201 Computer Systems Organization, CSCI-UA.0310 Basic Algorithms. Student must also register for a Recitation section.
• CSCI-UA.0480-​055
  (20031) Special Topics: Principles of Programming Languages  Thomas Wies TR 4:55-6:10PM Kimmel 803
  

  Computing professionals have to learn new programming languages all the time. This course teaches the fundamental principles of programming languages that enable students to learn new languages quickly and help them decide which one is best suited for a given task. Students will learn new ways of viewing computation and programs, and new ways of approaching algorithmic problems, making them better programmers overall. Topics include recursion and induction, algebraic data types and pattern matching, higher-order functions, continuations and tail recursion, programming language syntax and semantics, type systems, and objects and classes. The course will explore this material by building interpreters for programming languages of increasing complexity. The course will thus be accompanied by extensive programming assignments.

  
  
  Prerequisites: CSCI-UA.0201 with a grade of C or better
• CSCI-UA.0480-​057
  (8504) Special Topics: Natural Language Processing  Adam Meyers TR 2:00-3:15PM 12WV G08
  

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

  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 201 Computer Systems Organization with a grade of C or better. Recommended: Operating Systems (CSCI-UA.202)
• CSCI-UA.0480-​069
  (9013) Special Topics: Agile Software Development and DevOps  Amos Bloomberg TR 12:30-1:45PM Online
  

  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-​073
  (23407) Special Topics: Introduction to Robot Intelligence  Lerrel Pinto TR 3:30-4:45PM 60 Fifth Ave C15
  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.0520-​001 Undergraduate Research   STAFF -
  The student is supervised by a faculty member actively engaged in research, possibly leading to results publishable in the computer science literature. A substantial commitment to this work is expected. The research project may be one or two semesters, to be determined in consultation with the faculty supervisor. Students taking this course for honors in computer science are required to write an honors thesis. All other students need to submit a write-up of the research results at the conclusion of the project.
  
  Prerequisites: Permission of the department.
• CSCI-UA.0897-​001 Internship  STAFF -
  An internship in computer science is an excellent complement to formal course work. We strongly recommend that students have some practical training along with their classroom experience, so they can explore different career options and gain hands-on experience. An internship is for majors only, and students must have maintained an overall GPA of 3.0 and a computer science GPA of 3.5. The internship will be graded.
  
  Prerequisites: Restricted to declared computer science majors. Internship credit does not count toward major requirements, but does apply toward completion of the CAS degree.
• CSCI-UA.0997-​001 Independent Study   STAFF -
  

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

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

• *
  Indicates controlled enrollment (permission number required for registration). Contact your program advisor.
• **
  Indicates controlled enrollment (permission number required for registration). Contact Santiago Pizzini (pizzini@cs.nyu.edu).
• ***
  Indicates controlled enrollment (permission number required for registration). Contact the instructor.

Classroom Locations