2016-2018 Undergraduate and Graduate Bulletin (without addenda) 
    
    Nov 25, 2024  
HELP
2016-2018 Undergraduate and Graduate Bulletin (without addenda) [ARCHIVED CATALOG]

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

CS-GY 6033 Design and Analysis of Algorithms I

3 Credits
This course reviews basic data structures and mathematical tools. Topics: Data structures: priority queues, binary search trees, balanced search trees. Btrees. Algorithm design and analysis techniques illustrated in searching and sorting: heapsort, quicksort, sorting in linear time, medians and order statistics. Design and analysis techniques: dynamic programming, greedy algorithms. Graph algorithms: elementary graph algorithms (breadth-first search, depth-first search, topological sort, connected components, strongly connected components), minimum spanning tree, shortest path. String algorithms. Geometric algorithms. Linear programming. Brief introduction to NP completeness.

Prerequisite(s): Graduate status, CS-GY 5403  and CS-GY 6003 .
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