Menu
Home
Experience
Research
Publication
Students
Professional Activities
Teaching
Courses
External Links
LinkedIn
Google Scholar
ResearcGate
DBLP
usefull links
Jemdoc

Dr. Lalatendu Behera

Vision and Mission of the Department and Institute

CSDC0201: Data Structures and Algorithms

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

  • Monday: 04:30 PM - 05:25 PM

  • Thursday: 01:30 PM - 02:25 PM

  • Friday: 02:30 PM - 03:25 PM

  • Venue: CS-208

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

  1. (R1) Hopcroft, John E., Jeffrey D. Ullman, and Alfred Vaino Aho. Data structures and algorithms. Vol. 175. Boston, MA, USA:: Addison-wesley, 1983.

  2. (R2) Tenenbaum, Aaron M., Yedidyah Langsam, and Moshe J. Augenstein. Data Structures Using C. 1st ed., Pearson Education, 2019.

  3. (R3) Lipschutz, Seymour. Data Structures. 2nd ed., McGraw Hill, 2014

  4. (R4) Horowitz, Ellis, and Sartaj Sahni. Fundamentals of Data Structures in C. 2nd ed., Universities Press, 2008

  5. (R5) Cormen, Thomas H., et al. Introduction to Algorithms. 4th ed., The MIT Press, 2022.

Evaluation

  1. Class Performance: 5%

  2. Assignments: 5%

  3. Quiz: Three Quizzes (Best Two) (10%)

  4. Mid-semester: 30%

  5. End-semester: 50%

Recommended Materials

Classes

Lecture No. Date Topic Source
1 28/07 Introduction to the course Brochure
2 31/07 Introduction to Algorithms Brochure
3 01/08 Running Time Analysis Brochure
4 04/08 Asymptotic Notation Brochure
5 07/08 Computing Time-complexity Brochure
6 08/08 Computing Space-complexity Brochure
7 18/08 ADT and Arrays Brochure
8 21/08 Dynamic Memory Allocation and Sparse Matrix Brochure
9 22/08 Addition and Multiplication in Sparse Matrix Brochure
10 25/08 Recursion Follow 6.8 from R3
11 28/08 Solving Recurrence Relation Follow 4.3, 4.4, and 4.5 from R5
12 29/08 Introduction to Linked List (Insertion) Brochure
13 01/09 Introduction to Linked List (Deletion) Brochure
14 04/09 Doubly Linked List (Insertion) Brochure
15 08/09 Doubly Linked List (Deletion), Circular List Brochure
16 11/09 Stack Brochure
17 12/09 Expression notations Brochure
18 15/09 Queue Brochure

Homeworks

Quizzes

  • 1st Quiz on 10/September/2025 at 12:30 PM in lecture theatres. (Solutions: Set - A and Set - B)

Practice Questions

To be declared