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

[Add to Portfolio]

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



[Add to Portfolio]