Course page for CS2440 - Algorithms I
Back to my homepage
Basics: Models of computation, asymptotic notation, recursion.
Divide-and-conquer paradigm: Binary search, merge sort, bucket and radix sort, medians and order statistics, and other problems.
Dynamic programming: Edit distance, Viterbi algorithm, and other examples.
Greedy algorithms: Minimum change, Huffman codes, and other examples.
Division of credit:
Exams: 80%, Assignments: 20%,