InfoCoBuild

Data Structures and Algorithms

Data Structures and Algorithms. Instructor: Dr. Naveen Garg, Department of Computer Science and Engineering, IIT Delhi. The objective of the course is to familiarize students with basic data structures and their use in fundamental algorithms. Topics covered include: introduction to object oriented programming through stacks, queues and linked lists; Dictionaries: skip-lists, hashing, analysis of collision resolution techniques; trees, traversals, binary search trees, 2-4 trees and red-black trees; Tries and pattern matching; priority queues and binary heaps; sorting: merge, quick, radix, selection, heap; graphs, breadth first search and connected components; depth first search in directed and undirected graphs and strongly connected components; spanning trees: Prim's and Kruskal's algorithm, union-find data structure; Dijkstra's algorithm for shortest paths, shortest path tree; directed acyclic graphs: topological sort and longest path. (from nptel.ac.in)

Lecture 34 - Single Source Shortest Paths


Go to the Course Home or watch other lectures:

Lecture 01 - Introduction to Data Structures and Algorithms
Lecture 02 - Stacks
Lecture 03 - Queues and Linked Lists
Lecture 04 - Dictionaries
Lecture 05 - Hashing
Lecture 06 - Trees
Lecture 07 - Tree Walks/Traversals
Lecture 08 - Ordered Dictionaries
Lecture 09 - Deletion
Lecture 10 - Quick Sort
Lecture 11 - AVL (Adelson-Velskii and Landis) Trees
Lecture 12 - AVL (Adelson-Velskii and Landis) Trees (cont.)
Lecture 13 - 2-4 Trees
Lecture 14 - Red Black Trees
Lecture 15 - Insertion in Red Black Trees
Lecture 16 - Disk based Data Structures
Lecture 17 - Case Study: Searching for Patterns
Lecture 18 - Tries
Lecture 19 - Data Compression
Lecture 20 - Priority Queues
Lecture 21 - Binary Heaps
Lecture 22 - Why Sorting?
Lecture 23 - More Sorting
Lecture 24 - Graphs
Lecture 25 - Data Structures for Graphs
Lecture 26 - Two Applications of Breadth First Search
Lecture 27 - Depth First Search
Lecture 28 - Applications of Depth First Search
Lecture 29 - Depth First Search in Directed Graphs
Lecture 30 - Applications of Depth First Search in Directed Graphs
Lecture 31 - Minimum Spanning Trees
Lecture 32 - The Union
Lecture 33 - Prim's Algorithm for Minimum Spanning Trees
Lecture 34 - Single Source Shortest Paths
Lecture 35 - Correctness of Dijkstra's Algorithm
Lecture 36 - Single Source Shortest Paths (cont.)