CS 473 Algorithms I
|
|
Asymptotic notation. Divide and conquer approach. Solving recurrences asymptotically. Worst case vs expected run time analysis. Medians and order statistics. Lower bound on comparison-based sorting algorithms vs sorting in linear time. Dynamic programming: 4-step formulation procedure with optimal substructure and overlapping subproblems properties. Greedy algorithms: greedy choice and overlapping subproblems properties. Greedy vs DP algorithms and problem reduction. Amortized analysis.
Credit units: 3 ECTS Credit units: 5, Prerequisite:
CS 202.
|
|
|
Bilkent University Main Page
Last regenerated automatically on December 18, 2024 by OAC - Online Academic Catalog Software
|
|
