CS 473 Algorithms I
|
Asymptotic notation. Divide and conquer approach. Solving recurrences: substitution method, master method. Bounding summations. Analysis of randomized quicksort. Medians and order statistics. Heaps: heapsort, priority queues. Sorting in linear time. Dynamic programming. Greedy algorithms. Amortized analysis: aggregate, accounting and potential methods, dynamic tables. Elementary graph algorithms: breadth-/depth-first search, topological sort, strongly connected components.
Credit units: 3 ECTS Credit units: 5, Prerequisite:
CS 202.
Autumn Semester (Cevdet Aykanat)
|
|
|
Bilkent University Main Page
Last regenerated automatically on December 7, 2023 by OAC - Online Academic Catalog Software
|
|
