Courses
CATALOG DESCRIPTIONS
Back to Previous Page
CS 603 Design and Analysis of Algorithms I
Description:
Review of basic data structures and mathematical tools. Data structures:priority queues, binary search trees, balanced search trees. B-trees. 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.
Credits: 3:0:0:3
Pre-Requisite: CS 5403 and CS 6003
Co-Requisite: none
Notes: none
|
