IIT KANPUR-NPTEL

Lecture 27: Basics of IC Engines
Lecture 27: Basics of IC Engines
Lecture 24: Heat Exchangers and Mass Transfer
Lecture 24: Heat Exchangers and Mass Transfer
Lecture 29: Condensed Solution- Understanding Henry’s Law
Lecture 29: Condensed Solution- Understanding Henry’s Law
Lecture 19: RB Tree: Balance
Lecture 19: RB Tree: Balance
Lecture 18: Red Black Tree DS
Lecture 18: Red Black Tree DS
Lecture 17: Queue DS
Lecture 17: Queue DS
Lecture 16: Stack: Expression Evaluation
Lecture 16: Stack: Expression Evaluation
Lecture 15: Balancing a BST, Stack Data Structure
Lecture 15: Balancing a BST, Stack Data Structure
Lecture 14: BST: Search, Insertion
Lecture 14: BST: Search, Insertion
Lecture 13: Binary Search Inspired Tree
Lecture 13: Binary Search Inspired Tree
Lecture 12: Linked Lists
Lecture 12: Linked Lists
Lecture 11: Abstract Data Structures: Lists
Lecture 11: Abstract Data Structures: Lists
Lecture 10: Range Minima in 1D array
Lecture 10: Range Minima in 1D array
Lecture 09: Recurrence & Efficient Data Structures
Lecture 09: Recurrence & Efficient Data Structures
Lecture 08: Efficient Local Minima in 2D
Lecture 08: Efficient Local Minima in 2D
Lecture 07: Local Minima in 2D
Lecture 07: Local Minima in 2D
Lecture 17: Continuation of genetic algorithms
Lecture 17: Continuation of genetic algorithms
Lecture 16: Continuation of genetic algorithms
Lecture 16: Continuation of genetic algorithms
Lecture 15: Continuation of vehicle routing problem with unsplittable demand; genetic algorithms
Lecture 15: Continuation of vehicle routing problem with unsplittable demand; genetic algorithms
Lecture 14: Continuation of vehicle routing problem with splittable demand;
Lecture 14: Continuation of vehicle routing problem with splittable demand;
Lecture 13: Continuation of local search algorithms; vehicle routing problem with splitable demand
Lecture 13: Continuation of local search algorithms; vehicle routing problem with splitable demand
Lecture 12: Approximation algorithm for travelling salesman problem and local search algorithms
Lecture 12: Approximation algorithm for travelling salesman problem and local search algorithms
Lecture 11: Minimum spanning tree, Kruskal's algorithm and Prim's algorithm
Lecture 11: Minimum spanning tree, Kruskal's algorithm and Prim's algorithm
Lecture 10: Continuation of polynomial-time algorithms; Dijkstra's algorithm
Lecture 10: Continuation of polynomial-time algorithms; Dijkstra's algorithm
Lecture 09: Continuation of order of growth; polynomial-time algorithms
Lecture 09: Continuation of order of growth; polynomial-time algorithms
Lecture 08: Analysis of algorithms and order of growth
Lecture 08: Analysis of algorithms and order of growth
Lecture 07: Branch-and-bound algorithms
Lecture 07: Branch-and-bound algorithms
Lecture 06: Continuation of scheduling problem; integer programming
Lecture 06: Continuation of scheduling problem; integer programming
Lecture 05: Optimization formulations of complete matching and scheduling problems
Lecture 05: Optimization formulations of complete matching and scheduling problems
Lecture 04: Alternative formulation of travelling salesman problem
Lecture 04: Alternative formulation of travelling salesman problem