Course Outline
Asymptotic notations for time complexity bounds
Quick Sort: algorithm, correctness, and performance analysis
Heap Sort: algorithm, correctness, and performance analysis
C++ code for creating a Red-Black Tree
BWT: string compression and string matching
String matching with k differences in DNA databases
NP completeness theory - Cook theorm
More about bipartite graphs and general matching
A proof of Tutte's 1-Factor Theorem (easy to understand)
Transitive Closure and Query evaluation in XML databases
Set Intersection (complete manuscript)