The course materials are available via the course web site:


https://reed.cs.depaul.edu/lperkovic/courses/csc321/ (NOT accessible during final exam)

Lecture slides for final exam:

 Lecture 1 slides (running time analysis, asymptotic notation, polynomial evaluation, insertionsort)

 Lecture 2 slides (divide-and-conquer, mergesort, quicksort, binary search, fast exponentiation, fast multiplication, closest pair of points, recurrence relations)

 Lecture 3 slides (backtracking, N-queens problem, subset sum)

 Lecture 4 slides (backtracking, text segmentation, longest increasing subsequence, optimal binary search trees)

 Lecture 5 slides (dynamic programming, Fibonacci numbers, text segmentation, longest increasing subsequence)

 Lecture 6 slides (dynamic programming, subset sum, edit distance, greedy methods, activity selection)

 Lecture 7 slides (greedy method, prefix-free codes and Huffman's algorithm, stable matching)

 Lecture 8 slides (graph algorithms, DFS, BFS, WFS, topological sort)

 Lecture 9 slides (graph algorithms, strongly connected components, minimum spanning trees, shortest path algorithms)