Details of CS2103 (Autumn 2026)
| Level: 2 | Type: Laboratory | Credits: 4.0 |
| Course Code | Course Name | Instructor(s) |
|---|---|---|
| CS2103 | Data Structures and Algorithms Laboratory | Kripabandhu Ghosh, Saptarshi Pyne |
| Syllabus |
|---|
| Syllabus
1.Week 1 a.Introduction to the C programming language b.Data types c.Precedence and associativity of operators d.Decision control instructions (e.g., the if-else statements, else if clause, logical and conditional operators) 2.Week 2 a.Loop control instructions (e.g., the for loop, while loop, do-while loop, break and continue statements, nested loops) 3.Week 3 a.Case control instructions (e.g., the switch-case statements, goto statement) b.Functions 4.Week 4 a.Pointers b.Recursion 5.Week 5 a.Storage classes b.Preprocessors (including the topics of macro expansion, file inclusion, conditional compilation, preprocessor directives, and the build process) 6.Week 6 a.Arrays (including multidimensional arrays) b.Dynamic memory allocation (malloc, calloc, realloc, free) c.Strings 7.Week 7 a.Structures and unions b.Console input/output (including command line arguments) c.File handling 8.Week 8 a.Bit operations b.Constants and enums c.Unit testing d.Debugging and memory profiling 9.Week 9 a.Linked lists b.Sparse matrices c.Stacks d.Queues 10.Week 10 a.Graph representations, traversals (breadth-first search (BFS) and depth-first search (DFS)) 11. Week 11 a.Tree representations b.Binary tree operations c.Binary search tree operations d.Threaded binary tree operations 12.Week 12 a.AVL tree operations b.Heap operations c.B tree operations d.B+ tree operations |
| Prerequisite |
|---|
| Prerequisites
CS1101 Introduction to Computer Programming Laboratory |
| References |
|---|
| Textbook(s)
1.Kanetkar, Y. (2024). Let Us C. 20th Edition. BPB Publications. 2.Srivastava, S. K., & Srivastava, D. (2011). Data Structures through C in Depth. 2nd Edition. BPB publications. Reference book(s) 1.Chattopadhyay, S., Dastidar, D. G., & Chattopadhyay, M. z2001). Data Structures through C Language. 1st Indian Edition. BPB Publications. 2.Kanetkar, Y. (2023). Data Structures through C. 5th Edition. BPB Publications. 3.Tenenbaum, A. M., Langsam, Y., & Augenstein, M. J. (1989). Data Structures Using C. 1st Edition. PHI. 4.Weiss, M. A. (2020). Data structures and Algorithm Analysis in C. 2nd Edition. Pearson. |
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 | Not Allowed |
| 9 | MS | 7 | Not Allowed |
| 10 | MS | 9 | Not Allowed |
| 11 | RS | 1 | Not Allowed |
| 12 | RS | 2 | Not Allowed |