IIT Kanpur · Computer Science
Data Structures and Algorithms Design
Prof. Nitin Saxena · 40 free video lectures
The modern economy is run by algorithms. This a first-level course to introduce the students to the world of algorithm design, data structures, analysis, and programming. We'll start with the asymptotics notation which captures time and space of algorithms in the worst-case. The basic data…
▶ Play on Open Lecture HallCourse page ↗
Lectures
- Lecture 01: What is an Algorithm?
- Lecture 02: Efficient Algorithms
- Lecture 03: Sorting, Searching and Arrays
- Lecture 04: Clever Algorithms
- Lecture 05: Asymptotics, Fast Max-Sum Subarray
- Lecture 06: Local Minima in 1D
- Lecture 07: Local Minima in 2D
- Lecture 08: Efficient Local Minima in 2D
- Lecture 09: Recurrence & Efficient Data Structures
- Lecture 10: Range Minima in 1D array
- Lecture 11: Abstract Data Structures: Lists
- Lecture 12: Linked Lists
- Lecture 13: Binary Search Inspired Tree
- Lecture 14: BST : Search, Insertion
- Lecture 15: Balancing a BST, Stack Data Structure
- Lecture 16: Stack: Expression Evaluation
- Lecture 17: Queue DS
- Lecture 18: Red Black Tree DS
- Lecture 19: RB Tree: Balance
- Lecture 20: Divide and Conquer Paradigm
- Lecture 21: Integer Multiplication & Inversions
- Lecture 22: Graph Theory & Algorithms
- Lecture 23: Graph DS & Breadth First Search
- Lecture 24: Complexity & Applications of BFS
- Lecture 25: Check Bipartiteness using BFS, Depth First Search
- Lecture 26: DFS tree and biconnected graph
- Lecture 27: Articulation Points, Heap Data Structure
- Lecture 28: Binary Heap
- Lecture 29: Heapification
- Lecture 30: Augmented tree Data Structure
- Lecture 31: Multi Increment and Dynamic Range Min Problems
- Lecture 32: Disjoint-Set Data Structure
- Lecture 33: Fast Union and the i-th Statistic Problem
- Lecture 34: i-th Statistic Problem: Approx Median
- Lecture 35: Greedy Algorithms: Job Scheduling
- Lecture 36: Minimum Spanning Tree
- Lecture 37: MST Cycle, Mobile Towers
- Lecture 38: Shortest Path Algorithm
- Lecture 39: Djikstra's Algorithm
- Lecture 40: Counting Sort, Radix Sort
From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Kanpur.
Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights