Computer Science | Algorithms Design and Analysis
B503 | 1380 | Wise


B503 Algorithms Design and Analysis (3 cr.) P: Mathematics M216 and
C343. Models, algorithms, recurrences, summations, growth rates.
Probabilistic tools, upper and lower bounds; worst-case and
average-case analysis, amortized analysis, dynamization.
Comparison-based algorithms: search, selection, sorting, hashing.
Information extraction algorithms (graphs, databases). Graphs
algorithms: spanning trees, shortest paths, connectivity, depth-first
search, breadth-first search. Credit not given for both B503 and
B403. B503 corresponds to old C455.