Details of CS2102 (Autumn 2026)
| Level: 2 | Type: Theory | Credits: 4.0 |
| Course Code | Course Name | Instructor(s) |
|---|---|---|
| CS2102 | Data Structures and Algorithms | Kripabandhu Ghosh |
| Syllabus |
|---|
| Syllabus
Week 1 Introduction to abstract data types (ADTs), data structures, and algorithms Arrays Week 2 Linked lists Sparse matrices Week 3 Stacks Queues Week 4 Hashing (hash tables, hash functions, collision resolution techniques) Weeks 5 and 6 Graph representations Graph traversals: breadth-first search (BFS) and depth-first search (DFS) Topological sort Strongly connected components Finding a minimum spanning tree, Kruskals algorithm, Prims algorithm Single-source shortest paths finding algorithms (e.g., the Bellman-Ford algorithm, Dijkstras algorithm) Week 7 Trees (binary trees, binary search trees, threaded binary trees) Forests Week 8 Balanced trees (AVL tree, red black tree, B tree, B+ tree, B* tree) Week 9 Heaps Priority queues Week 10 Asymptotic notations for analyzing efficiencies (e.g., time and space complexities) of algorithms The divide-and-conquer technique of algorithm design (e.g., solving the maximum-subarray problem, Strassens algorithm for matrix multiplication) Week 11 The algorithmic methods for solving recurrences (the substitution method, recursion-tree method, master method, proof of the master theorem) Week 12 Introduction to probabilistic analysis and randomized algorithms |
| Prerequisite |
|---|
| CS1101 Introduction to Computer Programming Laboratory |
| References |
|---|
| Textbook(s)
1.Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to Algorithms. 4th Edition. MIT press. Reference book(s) 1.Srivastava, S. K., & Srivastava, D. (2011). Data Structures through C in Depth. 2nd Edition. BPB publications. 2.Lipschutz, S. (2006). Data Structures. 1st Edition. The McGraw-Hill Companies. |
Course Credit Options
| Sl. No. | Programme | Semester No | Course Choice |
|---|---|---|---|
| 1 | IP | 1 | Not Allowed |
| 2 | IP | 3 | Not Allowed |
| 3 | MP | 1 | Not Allowed |
| 4 | MP | 3 | Not Allowed |
| 5 | MR | 1 | Not Allowed |
| 6 | MR | 3 | Not Allowed |
| 7 | MS ( Computational and Data Sciences ) | 3 | Core |
| 8 | MS | 5 | Elective |
| 9 | MS | 7 | Elective |
| 10 | MS | 9 | Elective |
| 11 | RS | 1 | Not Allowed |
| 12 | RS | 2 | Not Allowed |