Delhi University Algorithms with Sonika

Dedicated to all my students. Dear students, this is a humble attempt to prevent seekers from hunting for content. Thanks to my students for bearing with me while I was recording my lectures. A very special thanks to Parag Mittal, Mohd. Ameed Zain and Shanu Kumar Singh who helped me with noise reduction and uploading of the videos.

Greedy: Single Source Shortest Path - Dijkstra's Algorithm Miscellaneous
Greedy: Single Source Shortest Path - Dijkstra's Algorithm Miscellaneous
Introduction to MST
Introduction to MST
Greedy: Single Source Shortest Path - Dijkstra's Algorithm 3
Greedy: Single Source Shortest Path - Dijkstra's Algorithm 3
Greedy: Single Source Shortest Path - Dijkstra's Algorithm 2
Greedy: Single Source Shortest Path - Dijkstra's Algorithm 2
Greedy: Single Source Shortest Path - Dijkstra's Algorithm 1
Greedy: Single Source Shortest Path - Dijkstra's Algorithm 1
Greedy: Single Source Shortest Path Problem
Greedy: Single Source Shortest Path Problem
Graph: Lecture 17(a) - Topological ordering (Algorithm 1)
Graph: Lecture 17(a) - Topological ordering (Algorithm 1)
Graph: Lecture 16 - (Finding Strongly connected components)
Graph: Lecture 16 - (Finding Strongly connected components)
Graph: Lecture 17(b) - Topological ordering (Algorithm 2)
Graph: Lecture 17(b) - Topological ordering (Algorithm 2)
Graph: Lecture 15 - Applications of DFS
Graph: Lecture 15 - Applications of DFS
Heaps: Lecture 6 - Applications (Heap Sort and Priority Queues)
Heaps: Lecture 6 - Applications (Heap Sort and Priority Queues)
Heaps : Lecture 7 - Applications (Priority Queue Contd..)
Heaps : Lecture 7 - Applications (Priority Queue Contd..)
Heaps: Lecture 5 - Building a heap (analysis)
Heaps: Lecture 5 - Building a heap (analysis)
Heaps: Lecture 4 - Building a heap
Heaps: Lecture 4 - Building a heap
Graphs: Lecture 13 - Applications of DFS
Graphs: Lecture 13 - Applications of DFS
Graphs: Lecture 14 - Applications of DFS
Graphs: Lecture 14 - Applications of DFS
Graphs: Lecture 12 - Applications of DFS
Graphs: Lecture 12 - Applications of DFS
Graphs: Lecture 11 - Implementing DFS
Graphs: Lecture 11 - Implementing DFS
Heaps: Lecture 2 - Introduction to the data structure (contd.)
Heaps: Lecture 2 - Introduction to the data structure (contd.)
Heaps: Lecture 1 - Introduction to the data structure
Heaps: Lecture 1 - Introduction to the data structure
Heaps: Lecture 3 - Heapification
Heaps: Lecture 3 - Heapification
Graphs: Lecture 10 - DFS trees
Graphs: Lecture 10 - DFS trees
Graphs: Lecture 9 - Depth First Search
Graphs: Lecture 9 - Depth First Search
Graphs: Lecture 8- BFS applications (testing bipartiteness)
Graphs: Lecture 8- BFS applications (testing bipartiteness)
Graphs: Lecture 7- BFS applications (finding connected components)
Graphs: Lecture 7- BFS applications (finding connected components)
Graphs: Lecture 6- BFS implementation
Graphs: Lecture 6- BFS implementation
Graphs: Lecture 5 - Breadth First Search
Graphs: Lecture 5 - Breadth First Search
Graphs: Lecture 3 Representing Graph | Adjacency Matrix | Adjacency List
Graphs: Lecture 3 Representing Graph | Adjacency Matrix | Adjacency List
Graphs: Lecture 4 S-T Connectivity (Part-1)
Graphs: Lecture 4 S-T Connectivity (Part-1)
Graphs: Lecture 2 Introduction To Trees
Graphs: Lecture 2 Introduction To Trees