About Lecture - 1 Overview of the course

Job Scheduling NP-Completeness in Computer Science Greedy Approximation Algorithm for Set Cover Problem in NP-Complete Optimization Approximation Algorithms for NP Complete Problems in Design and Analysis of Algorithms Fully Polynomial Time Approximation Scheme (FPTAS) for Knapsack Problem in Computer Science NP-Completeness via Reduction from Vertex Cover on Bounded Degree Graphs Average Case Analysis of Quicksort in Algorithm Design Algorithm Analysis in Computer Science Using Time and Space Complexity Criteria Merge Sort Algorithm in Divide and Conquer using Binary Search Greedy Algorithm Interval Partitioning by Starting Times to Minimize Parts Branch and Bound Combinatorial Optimization via Negative Cost Functions in Algorithms Analysis Framework II: Random Access Machine Model in Design and Analysis of Algorithms Naive and Rabin-Karp Pattern Matching Algorithm in Computer Science Element Distinctness Lower Bounds in Decision Tree Model Longest Common Subsequence Dynamic Programming in Algorithms Linear Time Median Finding Using Divide and Conquer in Algorithms Omega-n-log-n Lower Bound on Comparison-based Sorting Algorithms in Decision Trees NP Completeness Reduction from Vertex Cover to Clique in Combinatorial Optimization Fractional Knapsack Problem Greedy Algorithm Analysis in Computer Science Sorting Lower Bounds Using Comparison Trees in Computer Science Algorithm Design Techniques: Finding Min and Second Minimum in Arrays using Divide and Conquer Lecture - 23 Bipartite Maximum Matching Lecture -20 Matric Chain Multiplication Lecture - 21 Scheduling with Startup and Holding Costs Maximum Independent Set on Trees using Greedy Algorithms KMP Algorithm: Computing Pattern Matching Failure Function (in English) Reductions Between Hamiltonian Cycle and Hamiltonian Path Problems in Graph Theory Lecture -16 Combinational Search and Optimization I Closest Pair Problem in Computational Geometry using Divide and Conquer Algorithm Design Technique Knapsack Problem Optimization Using Dynamic Programming in Algorithm Design NP Completeness Defined via Hamiltonian Cycle and Verifier Proof in Computer Science Theory Huffman Coding for Binary Trees using Frequency Minimization Greedy Algorithm in Computer Science Asymptotic Notation in Algorithm Analysis NP-Completeness Proof via Subset Sum and Exact Cover Reductions in Computational Complexity Theory