Data Structures and Algorithms

← Back to Teaching

Work in progress: These course notes are actively being written and may contain errors or omissions. If you spot a mistake, please let me know by email.

Course Code: MAT5EJ302(1)  ·  Semester: V (Elective)  ·  Credits: 4
Institution: Ambedkar College, University of Calicut (CUFYUGP 2024)
Textbook: Dasgupta, Papadimitriou, Vazirani — Algorithms (McGraw-Hill, 2006)

Complete lecture notes with worked examples, step-by-step algorithm traces, and practice problems.

Assessment: Internal 30 marks + External 70 marks (minimum 15 marks from each of Modules I–IV; Module V not assessed in the external exam).

Download Full Course Notes (PDF)

Modules

• Module I — Introduction to Algorithms

  Fibonacci, asymptotic analysis, Big-O notation, modular arithmetic, GCD, primality testing

• Module II — Divide and Conquer

  Karatsuba multiplication, Master Theorem, binary search, merge sort, graph representations, DFS

• Module III — Graph Algorithms

  BFS, connectivity, DAGs, topological sort, SCCs (Kosaraju), Dijkstra's algorithm

• Module IV — Greedy Algorithms and Dynamic Programming

  MST and cut property, Kruskal's algorithm, union-find, Prim's algorithm, Floyd-Warshall

• Module V — Python Practicals

  Python implementations: Fibonacci, extended GCD, primality, DFS, BFS, Dijkstra  ·  Not assessed in external exam

Lab Sessions

• Lab Session 1 — Fibonacci Algorithms & Big-O

  Instructor lesson plan: hands-on measurement of exponential vs. polynomial Fibonacci algorithms

Exam Practice

• Class Tests

  Question papers and answer keys for class tests conducted during the course

• Previous Year Questions

  Coming soon