The 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.
Computer Science (Undergraduate)
4 credits - 15 Weeks
CSCI-UA 9102-000 (19807)09/02/2021 - 12/14/2021 Tue,Thu12:00 AM - 1:00 PM (Early afternoon)at NYU Paris (Global)Instructed by Cosse, Augustin Marie Dominique
CSCI-UA 9102-000 (19808)09/02/2021 - 12/14/2021 Tue2:00 PM - 3:00 PM (Early afternoon)at NYU Paris (Global)Instructed by Cosse, Augustin Marie Dominique
Course Points: 4 creditsSections (Fall 2021)
CSCI-UA 9102-000 (19807)09/02/2021 - 12/14/2021 Tue,Thu12:00 AM - 1:00 PM (Early afternoon)at NYU Paris (Global)Instructed by Cosse, Augustin Marie Dominique
CSCI-UA 9102-000 (19808)09/02/2021 - 12/14/2021 Tue2:00 PM - 3:00 PM (Early afternoon)at NYU Paris (Global)Instructed by Cosse, Augustin Marie Dominique
NYU Department: IMA Major Electives, Programming & Data (Old Structure), Quantitative Reasoning, Undergraduate
Location:
Admin Contact: None.
Degree Level:
Theory-Practice Scale: