Introduction | 1 | Cormen et al. (2001) | |

Mathematical Tools | 2 | Rosen (2002) | |

Logic and Proving Techniques | 3 | Rosen (2002) | |

Proofs, Validation, Verification | 4 | Cormen et al. (2001), Rosen (2002) | |

Strong Math Induction | 5 | Cormen et al. (2001), Rosen (2002) | |

Fibonacci Sequences | 6 | Cormen et al. (2001), Rosen (2002) | |

Recurrence Relations: Mathematical Models, Analysis Techniques | 7 | Brassard and Bretly (1995) | |

Recurrence Relations: Algorithms Design and Analysis Techniques | 8 | Brassard and Bretly (1995) | |

Further Techniques Solving Recurrence Relations | 9 | Brassard and Bretly (1995) | |

Time Complexity Measuring Notations | 10 | Cormen et al. (2001) | |

Relations over Asymptotic Notations | 11 | Cormen et al. (2001) | |

Brute Force Approach: Introduction, Starting with Primality, Sorting Sequence of numbers | 12 | Cormen et al. (2001) | |

Designing Algorithms using Brute Force and Divide & Conquer Approaches | 13 | Cormen et al. (2001) | |

Designing Algorithms using Divide & Conquer Approaches (Cont.) | 14 | Brassard and Bretly (1995) | |

Dynamic Programming for Solving Optimization Problems: Chain Matrix Multiplication Problem | 15 | Cormen et al. (2001) | |

Chain Matrix Multiplication Problem using Dynamic Programming (Cont.) | 16 | Cormen et al. (2001) | |

Assembly-Line Scheduling Problem | 17 | Cormen et al. (2001) | |

2-Line Assembly Scheduling Problem, n-Line Assembly Scheduling Problem | 18 | Cormen et al. (2001) | |

0-1 Knapsack Problem using Dynamic Programming | 19 | Brassard and Bretly (1995) | |

0-1 Knapsack Problem's Algorithm using Dynamic Programming, Optimal Weight Triangulation | 20 | Brassard and Bretly (1995) | |

Optimal Weight Triangulation using Dynamic Programming | 21 | Cormen et al. (2001) | |

Review Lectures 1-21 | 22 | Cormen et al. (2001) | |

Longest Common Subsequence, Optimal Binary Search Trees | 23 | Cormen et al. (2001) | |

Dynamic Programming: Optimal Binary Search Trees (Cont.) , Greedy Algorithms | 24 | Cormen et al. (2001) | |

Greedy Algorithms: Activity Selection Algorithm, Fractional Knapsack, Coin Change Making | 25 | Cormen et al. (2001) | |

Greedy Algorithms: Huffman Coding | 26 | Cormen et al. (2001) | |

Huffman Coding Problem, Road Trip Problem, Graph Theoretic Concepts | 27 | Cormen et al. (2001) | |

Breadth First Search: Shortest Paths | 28 | Cormen et al. (2001) | |

Proof of Breadth First Search Algorithm, Depth First Search | 29 | Cormen et al. (2001) | |

Proof of White Path Theorem, Applications of Depth First Search | 30 | Cormen et al. (2001) | |

Backtracking, Branch & Bound Algorithms | 31 | Brassard and Bretly (1995) | |

Minimal Spanning Tree Problem, Kruskal's Algorithm, Prim's Algorithm | 32 | Cormen et al. (2001) | |

Road Map Problem, Paths and Shortest Paths, Bellman-Ford Algorithm | 33 | Cormen et al. (2001) | |

Proof: Bellman Ford Algorithm, Shortest Paths in Directed Acyclic Graphs | 34 | Cormen et al. (2001) | |

Dijkstra's Algorithm: Problem Statement, Analysis, Correctness | 35 | Cormen et al. (2001) | |

All-Pairs Shortest Paths, Shortest Paths and Matrix Multiplication | 36 | Cormen et al. (2001) | |

The Floyd-Warshall Algorithm, Johnson's Algorithm | 37 | Cormen et al. (2001) | |

Number Theoretic Algorithms: Definitions and Some Important Results | 38 | Cormen et al. (2001) | |

Number Theoretic Algorithms: GCD, Euclid's Algorithm, Groups and Rings | 39 | Cormen et al. (2001) | |

Groups and Rings, Chinese Remainder Theorem, RSA Cryptosystem | 40 | Cormen et al. (2001) | |

Fermat Theorem, Euler's Theorem, RSA Cryptosystem, String Matching Problem | 41 | Cormen et al. (2001) | |

String Matching: Naive Algorithm, Rabin-Karp Algorithm, String Match with Finite Automata | 42 | Cormen et al. (2001) | |

Polynomials and Fast Fourier Transform: Representation of Polynomials, The DFT and FFT | 43 | Cormen et al. (2001) | |

NP Completeness: Circuit Satisfiability, Proof: Formula Satisfiability, 3-CNF, Clique | 44 | Cormen et al. (2001) | |

Review Lecture 1-44 | 45 | Cormen et al. (2001) | |