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 an 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.

Lecture - 1 Introduction to Data Structures and Algorithms.
Lecture - 2 Stacks.
Lecture - 3 Queues and Linked Lists.
Lecture - 4 Dictionaries.
Lecture - 5 Hashing.
Lecture - 6 Trees.
Lecture - 7 Tree Walks / Traversals.
Lecture - 8 Ordered Dictionaries.
Lecture - 9 Deletion.
Lecture - 10 Quick Sort.
Lecture - 11 AVL Trees.
Lecture - 12 AVL Trees.
Lecture - 13 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 DFS.
Lecture - 29 DFS in Directed Graphs.
Lecture - 30 Applications of DFS in Directed Graphs.
Lecture - 31 Minimum Spanning Trees.
Lecture - 32 The Union.
Lecture - 33 Prims Algorithm for Minimum Spanning Trees.
Lecture - 34 Single Source Shortest Paths.
Lecture - 35 Correctness of Dijkstras Algorithm.
Lecture - 36 Single Source Shortest Paths.