CS 573 Algorithms I

Asymptotic notation. Divide and conquer: Strassen's algorithm for matrix multiplication, quicksort. Solving recurrences: substitution method, master method. Bounding summations. Randomized quicksort: analysis. Medians and order statistics. Heaps: heapsort, priority queues. Sorting in linear time. Dynamic programming: matrix-chain multiplication, longest common subsequence, O/1 Knapsack problem, resource allocation problem. Greedy algorithms: activity selection problem, Hufmann codes, task scheduling problem. Amortized analysis: aggregate, accounting and potential methods, dynamic tables. Credit units: 3 ECTS Credit units: 7.5.

Autumn Semester (Cevdet Aykanat)

  | Bilkent University Main Page |

  Last regenerated automatically on September 22, 2017 by OAC - Online Academic Catalog Software.