Computer Sc - Design & Analysis of Algorithms (English)

   Thursday, February 06, 2025   

Starting a new Lecture Notes Series on Computer Sc - Design & Analysis of Algorithms

Youtube Lecture Playlist Credits 

Channel Name: nptelhrd

So Let Us Start to This Journey of Learning 

Computer Sc - Design & Analysis of Algorithms By Lecture Notes together!

Lecture 1: Lecture - 1 Overview of the course

Lecture 2: Lecture - 2 Framework for Algorithms Analysis

Lecture 3: Lecture - 3 Algorithms Analysis Framework - II

Lecture 4: Lecture - 4 Asymptotic Notation

Lecture 5: Lecture -5 Algorithm Design Techniques : Basics

Lecture 6: Lecture -6 Divide And Conquer-I

Lecture 7: Lecture -7 Divide And Conquer -II Median Finding

Lecture 8: Lecture -8 Divide And Conquer -III Surfing Lower Bounds

Lecture 9: Lecture -9 Divide And Conquer -IV Closest Pair

Lecture 10: Lecture -10 Greedy Algorithms -I

Lecture 11: Lecture - 11 Greedy Algorithms - II

Lecture 12: Lecture - 12 Greedy Algorithms - III

Lecture 13: Lecture - 13 Greedy Algorithms - IV

Lecture 14: Lecture - 14 Pattern Matching - I

Lecture 15: Lecture - 15 Pattern Matching - II

Lecture 16: Lecture -16 Combinational Search and Optimization I

Lecture 17: Lecture - 17 Combinational Search and Optimization II

Lecture 18: Lecture -18 Dynamic Programming

Lecture 19: Lecture 19 Longest Common Subsequences

Lecture 20: Lecture -20 Matric Chain Multiplication

Lecture 21: Lecture - 21 Scheduling with Startup and Holding Costs

Lecture 22: Lecture - 22 Average case Analysis of Quicksort

Lecture 23: Lecture - 23 Bipartite Maximum Matching

Lecture 24: Lecture - 24 Lower Bounds for Sorting

Lecture 25: Lecture -25 Element Distinctness Lower Bounds

Lecture 26: Lecture -26 NP-Completeness-I -Motivation

Lecture 27: Lecture - 27 NP - Compliteness - II

Lecture 28: Lecture - 28 NP-Completeness - III

Lecture 29: Lecture - 29 NP-Completeness - IV

Lecture 30: Lecture - 30 NP-Completeness - V

Lecture 31: Lecture - 31 NP-Completeness - VI

Lecture 32: Lecture - 32 Approximation Algorithms

Lecture 33: Lecture - 33 Approximation Algorithms

Lecture 34: Lecture - 34 Approximation Algorithms for NP