Dr. Lalatendu Behera
Vision and Mission of the Department and Institute
CSDC0201: Data Structures and Algorithms (CSE and DSE)
Instructor
Dr. Lalatendu Behera
TAs
Harshita Singh
Class Timings and Venue
Monday: 08:30 AM - 09:25 AM (CSE-B)
Monday: 02:30 PM - 03:25 PM (DSE)
Monday: 04:30 PM - 05:25 PM (CSE-A)
Tuesday: 03:30 PM - 04:25 PM (DSE)
Tuesday: 01:30 PM - 02:25 PM (CSE-B)
Wednesday: 04:30 PM - 05:25 PM (DSE)
Thursday: 01:30 PM - 02:25 PM (CSE-A)
Thursday: 03:30 PM - 04:25 PM (CSE-B)
Friday: 02:30 PM - 03:25 PM (CSE-A)
Venue: LT – 403 (CSE-A)
Venue: LT – 102 (CSE-B)
Venue: LT – 201 (DSE)
Course Outcomes
| CO | |
| 1 | Understand the concepts of data structures, algorithm and analyse their time complexity. |
| 2 | Apply sequential data structures, e.g., Array and Linked list to solve basic problems. |
| 3 | Apply and analyze stack and queue data structures to solve practical problems in real-life scenarios. |
| 4 | Apply variety of data structures, including trees, graphs, and hashing techniques, to address diverse and complex real-time computing problems. |
CO - PO Mapping
| CO | PO1 | PO2 | PO3 | PO4 | PO5 | PO6 | PO7 | PO8 | PO9 | PO10 | PO11 | PO12 | PSO1 | PSO2 |
| CO1 | M | H | M | H | M | L | H | L | ||||||
| CO2 | M | L | M | L | L | H | ||||||||
| CO3 | H | M | H | H | M | M | H | H | H | L | ||||
| CO4 | H | M | H | H | M | M | H | H | H | L | ||||
Recommended Books
(R1) Hopcroft, John E., Jeffrey D. Ullman, and Alfred Vaino Aho. Data structures and algorithms. Vol. 175. Boston, MA, USA:: Addison-wesley, 1983.
(R2) Tenenbaum, Aaron M., Yedidyah Langsam, and Moshe J. Augenstein. Data Structures Using C. 1st ed., Pearson Education, 2019.
(R3) Lipschutz, Seymour. Data Structures. 2nd ed., McGraw Hill, 2014
(R4) Horowitz, Ellis, and Sartaj Sahni. Fundamentals of Data Structures in C. 2nd ed., Universities Press, 2008
(R5) Cormen, Thomas H., et al. Introduction to Algorithms. 4th ed., The MIT Press, 2022.
Evaluation
Class Performance: 5%
Assignments: 5%
Quiz: Three Quizzes (Best Two) (10%)
Mid-semester: 30%
End-semester: 50%
Recommended Materials
Classes
| Lecture No. | Date | Topic | Source |
| 1 | 27/07 | Introduction to the course | |
| 2 | 28/07 | Introduction to Algorithms |  |
| 3 | 29/07 | Running-time Analysis | |
| 4 | 03/08 | Asymptotic Notation | |
| 5 | 04/08 | Time- and space-Complexity | |
| 6 | 05/08 | Arrays | |
| 7 | 10/08 | Sparse Matrix | |
| 8 | 11/08 | Sparse Matrix Multiplication and Linked List | |
| 9 | 12/08 | Linked List Insertion | |
| 10 | 17/08 | Linked List Deletion | |
| 11 | 18/08 | Doubly Linked List | |
| 12 | 19/08 | Circular Linked List | Refer Class Notes |
| 13 | 24/08 | Polynomial Representation using Linked Lists | |
| 14 | 25/08 | Stacks | |
| 15 | 27/08 | No Classes | |
| 16 | 31/08 | No Classes | |
| 17 | 01/09 | Stack Applications | |
| 18 | 02/09 | Tower of Hanoi and Recursion | |
| 19 | 07/09 | Queues | |
Homeworks
To be declared
Quizzes
1st Quiz on 25/August/2026 at 12:30 PM in lecture theatres. (Solutions: Click Here)
Practice Questions
To be declared