1 of 2
Banasthali Vidyapith-Department of Computer Science
Course Handout: B. Tech. –III Semester (CS/CS-AI/IT/EE/CE/EV/BT/EC/EI/MT)
July - December 2024
Date: 06-July-2024
Course Code: CS 209L Course Name: Data Structures Lab
Credit Points: 2 Max. Marks: 100 (CA: 40 ESA: 60)
Course Instructors: Dr. Neelam Sharma, Associate Professor, Computer Science – (CS Section - A & B)
Dr. Mainaz Faridi, Assistant Professor, Computer Science – (CS Section - C & CS-AI)
Dr. Ashok Kumar, Assistant Professor, Computer Science – (IT)
Dr. Archana Mangal, Assistant Professor, Computer Science – (EE & CE)
Dr. Swati Nigam, Assistant Professor, Computer Science – (EC & EV & BT)
Mrs. Prachi Jain, Assistant Professor, Computer Science – (EI & MT)
Learning Outcomes:
On successful completion of the course students will be able to
Implement problems based on basic data structures like stack and queues.
Implement problems on linked lists.
Implement problems for performing different operations like insertion, deletion and searching on binary
tree and binary search tree.
Suggested Readings:
1. Langsam, Y., Augenstein, M., & Tenenbaum, A. M. (1996). Data Structures using C and C++. New
Jersey: Prentice Hall.
2. Tremblay, J. P., & Sorenson, P. G. (1976). An introduction to data structures with applications. New
York: McGraw-Hill.
3. Horowitz, E., Sahni, S., & Anderson-Freed, S. (2008). Fundamentals of data structures in C.
Universities Press: Computer Science.
4. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1983). Data Structures and algorithms. Addison Wesley
Publishing Company.
Suggested E-Learning Material:
1. Programming and Data Structures : https://swayam.gov.in/course/1407-programming-and-data-
structures
2. Data Structures and Program Methodology : https://nptel.ac.in/courses/106103069/
Assessment Schedule:
Component Marks Submission/ Allotment/ Syllabus
Examination Date(s)
Continuous Assessment** 40 --- Course related topics
End-Semester Examination 60 07-24 December, 2024* Entire Syllabus
* Subject to change.
** Continuous Assessment will be based on practical test(s)/ viva-voce/ minor project(s)/ any other component(s) as
decided by the instructor(s) on regular basis.
2 of 2
Laboratory-Wise Schedule (2Hours per lab):
Lab No. Topics to be Covered
1–2 Implementation of problems based on Array, Functions, Pointers and Structures
3– 5 Implementation of Searching & Sorting Algorithms (Linear & Binary Search, Bubble Sort,
Selection Sort, Insertion Sort)
6–8 Implementation of static stack, Applications of stacks (parenthesis checker, postfix
evaluation, infix to postfix), recursion, quick sort
9 – 11 Implementation of static Queue (linear, circular, priority queue)
12-13 Implementation of linear linked list(creation, traversal)
14 – 16 Implementation of different operations of linear linked list( insertion, deletion, searching,
sorting, merging, reverse)
17 – 18of
Implementation Doubly link list (creation, traversal, insertion, deletion, searching, sorting)
19-20 Linked representation of stack and queue
21-22 Polynomial arithmetic (Addition, Subtraction),
23-24 Implementation of binary search tree (creation, traversal, insertion, deletion, searching),
Non recursive traversal (inorder, preorder, postorder)
25 Heap sort
Dr. Neelam Sharma, Dr. Mainaz Faridi, Dr. Ashok Kumar,
Dr. Archana Mangal, Dr. Swati Nigam, Mrs. Prachi Jain
(Course Instructors)
