Advanced Algorithms Analysis and Design (V-U)

Minimal Spanning Tree Problem, Kruskal's Algorithm, Prim's Algorithm (V-U)

NP Completeness: Circuit Satisfiability, Proof: Formula Satisfiability, 3-CNF, Clique (V-U)

Number Theoretic Algorithms: Definitions and Some Important Results (V-U)

Number Theoretic Algorithms: GCD, Euclid's Algorithm, Groups and Rings (V-U)

Optimal Weight Triangulation using Dynamic Programming (V-U)

Polynomials and Fast Fourier Transform: Representation of Polynomials, The DFT and FFT (V-U)

Proof of Breadth First Search Algorithm, Depth First Search (V-U)

Proof of White Path Theorem, Applications of Depth First Search (V-U)

Proof: Bellman Ford Algorithm, Shortest Paths in Directed Acyclic Graphs (V-U)

Proofs, Validation, Verification (V-U)

Recurrence Relations: Algorithms Design and Analysis Techniques (V-U)

Recurrence Relations: Mathematical Models, Analysis Techniques (V-U)

Relations over Asymptotic Notations (V-U)

Review Lecture 1-44 (V-U)

Review Lectures 1-21 (V-U)

Road Map Problem, Paths and Shortest Paths, Bellman-Ford Algorithm (V-U)

String Matching: Naive Algorithm, Rabin-Karp Algorithm, String Match with Finite Automata (V-U)

Strong Math Induction (V-U)

The Floyd-Warshall Algorithm, Johnson's Algorithm (V-U)

Time Complexity Measuring Notations (V-U)