Find Your Courses

Lecture - 1 Overview of the course

 Duration 0h 52m

Lecture - 2 Framework for Algorithms Analysis

 Duration 0h 57m

Lecture - 3 Algorithms Analysis Framework - II

 Duration 0h 54m

Lecture - 4 Asymptotic Notation

 Duration 0h 54m

Lecture -5 Algorithm Design Techniques Basics

 Duration 0h 47m

Lecture -6 Divide And Conquer-I

 Duration 0h 53m

Lecture -7 Divide And Conquer -II Median Finding

 Duration 0h 53m

Lecture -8 Divide And Conquer -III Surfing Lower Bounds

 Duration 0h 57m

Lecture -9 Divide And Conquer -IV Closest Pair

 Duration 1h 4m

Lecture -10 Greedy Algorithms -I

 Duration 0h 52m

Lecture - 11 Greedy Algorithms - II

 Duration 0h 54m

Lecture - 12 Greedy Algorithms - III

 Duration 0h 51m

Lecture - 13 Greedy Algorithms - IV

 Duration 0h 37m

Lecture - 14 Pattern Matching - I

 Duration 0h 55m

Lecture - 15 Pattern Matching - II

 Duration 0h 46m

Lecture -16 Combinational Search and Optimization I

 Duration 0h 55m

Lecture - 17 Combinational Search and Optimization II

 Duration 0h 55m

Lecture -18 Dynamic Programming

 Duration 0h 53m

Lecture 19 Longest Common Subsequences

 Duration 0h 59m

Lecture -20 Matric Chain Multiplication

 Duration 0h 52m

Lecture - 21 Scheduling with Startup and Holding Costs

 Duration 0h 55m

Lecture - 22 Average case Analysis of Quicksort

 Duration 0h 49m

Lecture - 23 Bipartite Maximum Matching

 Duration 0h 52m

Lecture - 24 Lower Bounds for Sorting

 Duration 0h 49m

Lecture -25 Element Distinctness Lower Bounds

 Duration 0h 55m

Lecture -26 NP-Completeness-I -Motivation

 Duration 0h 59m

Lecture - 27 NP - Compliteness - II

 Duration 1h 17m

Lecture - 28 NP-Completeness - III

 Duration 0h 58m

Lecture - 29 NP-Completeness - IV

 Duration 1h 11m

Lecture - 30 NP-Completeness - V

 Duration 0h 42m

Lecture - 31 NP-Completeness - VI

 Duration 0h 41m

Lecture - 32 Approximation Algorithms

 Duration 0h 56m

Lecture - 33 Approximation Algorithms

 Duration 0h 59m