COL106 - Data Structures and Algorithms

Jan 10, 2026 · 1 min read
teaching

Class Description

Credit: 5 Credits (3-0-4)

Class Timing: Lectures on Tuesday, Thursday & Friday: 11:00 AM to 11:50 AM. Labs on Monday, Tuesday, Thursday & Friday: 2:00 PM to 5:00 PM.

Instructors: Vireshwar Kumar and Srikanta Bedathur

Programming Language: C++

Prerequisite: COL100

Course Website: https://col106iitd.github.io/

Syllabus

This course will cover the following topics.

  • Abstract data types
  • Basic data structures: arrays, stacks, queues, linked lists
  • Dynamic arrays and asymptotic complexity
  • Sorting: merge, quick, radix, and heap sort
  • Dictionaries: skip lists and hashing
  • Trees, tree traversal, and binary search trees
  • Priority queues and binary heaps
  • AVL trees, 2-4 trees, B-trees, multiway search trees, and applications
  • Introduction to graphs; adjacency matrix and adjacency list representations
  • Breadth-first search and applications
  • Depth-first search in directed and undirected graphs, and applications
  • Dijkstra’s shortest-path algorithm and minimum spanning trees