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 (ICE)

Instructor

  • Dr. Lalatendu Behera

TAs

  • Harshita Singh

Class Timings and Venue

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

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

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

  • Venue: LT-302

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 19/01 Introduction to the course Brochure
2 22/01 Class is to be rescheduled To be announced
3 23/01 Overview of data structures and algorithms Brochure
4 29/01 Running Time Analysis Brochure
5 30/01 Time complexity analysis Brochure
6 02/02 Space complexity analysis and ADT Brochure
7 05/02 1-D and 2-D Arrays (All Basic Algorithms) Brochure
8 06/02 Sparse Matrix and Addition of Two Sparse Matrices Brochure
9 09/02 Sparse Matrix Multiplication Brochure
10 12/02 Singly Linked List Brochure
11 13/02 Singly Linked List insertion Brochure
12 16/02 Singly Linked List Deletion and Doubly Linked List Brochure
13 19/02 Introduction to Stack Brochure
14 23/02 Stack Applications Brochure
15 25/02 Queues Brochure
16 26/02 Circular Queues and Deques Brochure
17 19/03 Mid-semester Q/A Discussion and Polynomial Representation in Linked list
18 20/03 Introduction to Trees Brochure
19 23/03 Tree Traversal Brochure
20 30/03 Showing of Mid-semester Answer Sheets
21 02/04 Binary Trees Brochure
22 06/04 Binary Search Trees Brochure
23 09/04 Heap Brochure
24 13/04 AVL Trees Brochure
25 16/04 Introduction to Graphs Brochure
26 17/04 Graph Traversal Algorithms Brochure
27 20/04 Minimum Spanning Tree and Prim's Algorithm Brochure
28 23/04 Kruskal's Algorthm and Dijkstra Algorithm Brochure
29 24/04 Merge Sort and Quick Sort Brochure
30 27/04 Radix Sort and Topological Sort Brochure Brochure
31 30/04 Hashing Brochure
32 04/05 Revision
33 07/05 Revision
34 08/05 Revision

Homeworks

Quizzes

  • 1st Quiz on 11/February/2026 at 12:30 PM at IT Building. (Solutions: Click Here)

  • 2nd Quiz on 30/March/2026 at 12:30 PM at IT Building. (Solutions: Click Here)

  • 3rd Quiz on 20/April/2026 at 12:30 PM at IT Building. (Solutions: Click Here)

End Semester Examination

  • End Semester Examination on 12/May/2026 at 2:00 PM at ALT. (Solutions: Click Here)