2013-2014 Undergraduate and Graduate Bulletin (with addenda) 
    
    Apr 19, 2024  
HELP
2013-2014 Undergraduate and Graduate Bulletin (with addenda) [ARCHIVED CATALOG]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)

CS-UY 2413 Design and Analysis of Algorithms

3 Credits
This course covers fundamental principles of the design and analysis of algorithms. Topics include asymptotic notation, recurrences, randomized algorithms, sorting and selection, balanced binary search trees, augmented data structures, advanced data structures, algorithms on strings, graph algorithms, geometric algorithms, greedy algorithms, dynamic programming and NP completeness.

Prerequisite(s): CS-UY 2134  (C- or better) and MA-UY 2312 /MA-UY 2322 .
Weekly Lecture Hours: 3 | Weekly Lab Hours: 0 | Weekly Recitation Hours: 0


Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Catalog Navigation
  Bulletin Home
  School Profile
  Administration
  Administrative Offices
  Communication Policy
  School Compliance and Other Guidelines
  Statistics on Enrollment and the Student Body
  Admissions, Financial Aid, Tuition and Fees
  NYU Calendars
  Undergraduate Academic Requirements and Policies
  Graduate Academic Requirements and Policies
  Academic Department, Degree and Program Information
  List of Academic Programs and Curricula
  Course Descriptions
  Registration
  Student Services
  Academic Success, Advising and Tutoring Services
  Special Programs
  Index of HEGIS Codes
  Previous & PDF Bulletins