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 209 Course Name: Data Structures
Credit Points: 4 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:
After successful completion of the course, students will be able to:
 Develop knowledge of basic data structures for storage and retrieval of ordered or unordered data. Data structures
include arrays, linked lists, stacks, queues, binary trees, heaps.
 Develop knowledge of applications of data structures including the ability to implement algorithms for the
creation, insertion, deletion, searching, and sorting of each data structure.
 Analyze and compare algorithms for efficiency using Big-O notation.
 Describe the concept of dynamic memory management, data types, algorithms, Big O notation.
 Apply Algorithm for solving problems like sorting, searching, insertion and deletion of data.

Syllabus:
Section A
Abstract data type, Data Structures , Complexity of Algorithms and Asymptotic notations. Searching and
Sorting: Linear search and Binary Search, Bubble sort, Selection sort, Insertion sort, Quick sort. Linear data
structures: Static implementation of stack, queue, and their applications.
Section B
Linked List: Linear, doubly or two way, circular, header and various operations; Representation of polynomial
using linked list, addition and subtraction of polynomials. Dynamic implementation of stacks and queues. Dynamic
memory management: fixed and variable block storage, storage techniques: first-fit, best-fit, worst-fit, next-fit; data
compaction, and garbage collection.
Section C
Nonlinear data structures: Graph & Tree concepts, General Tree, binary tree and types, binary search tree,
implementation of various operations on Binary Search Tree (tree traversal, searching, insertion and deletion,
counting leaf and non-leaf nodes, height), Heap and heap sort, Threaded Binary Tree( Insertion ,Deletion and
Traversals).
Suggested Books:
S1. Langsam, Y., Augenstein, M., Tenenbaum, A. M. (1996), Data Structures using C and C++, New Jersey:
Prentice Hall.
S2. Tremblay, J. P., Sorenson, P. G. (1976), An introduction to data structures with applications, New York:
McGraw-Hill.
S3. Horowitz, E., Sahni, S., & Anderson-Freed, S. (2008), Fundamentals of data structures in C, Universities
Press: Computer Science.
S4. Aho, A. V., Hopcroft, J. E., & Ullman, J. D. (1983), Data Structures and algorithms, Addison Wesley
Publishing Company.

Suggested E-Learning Material:

E1 : Programming and Data Structures https://swayam.gov.in/course/1407-programming-and-data-structures
E2 : Data Structures and Program Methodology https://nptel.ac.in/courses/10610
Assessment Schedule:

Submission/
Component Marks Allotment/ Syllabus
Examination Date(s)
Topics shall be allotted in the class by 07
Assignment 1** 10 23 August, 2024
August, 2024
04-07 September,
Periodical Test 1 10 Lecture No. 01 to 20
2024*
Topics shall be allotted in the class by 14
Assignment 2** 10 30 September, 2024
September, 2024
Periodical Test 2 10 23-26 October, 2024* Lecture No. 21 to 40
07-24 December,
End-Semester Examination 60 Entire Syllabus
2024*
* Subject to change.
** Assignment marks will be based on written document(s)/ any other component(s)

Lecture-Wise Plan:

Suggested
Lecture No. Topics to be covered
Readings
1 Introduction to Data types, Data structures, Abstract data type S1
Review of Array based problems, Pointers with arrays, strings, Structures,
2-5 S1, E2
functions
6-8 Sorting and Searching – Binary and Linear search, Bubble, Insertion, Selection. S1
9-10 Complexity of Algorithms and Asymptotic notations S1
Static implementation of Stack, Applications of stack in recursion, Quick sort,
11-15 S1, S4
expressions conversion (infix, prefix and postfix), expression evaluation.
Queue (simple, circular), static representation of queue and its implementation
16-20 S1, S4
(insertion, deletion), Various types of Queue and its applications,
Linear linked list implementation and its operations (insertion, deletion,
21-25 S1, S4
searching, reverse, merging, traversals etc.),
Circular and Header linked list, Polynomial representation and operations
26-28
(addition, subtraction) using linked list.
29-31 Dynamic Implementation of stack and queue using linked list S1,E1
Dynamic memory management: fixed and variable block storage, Storage
32-34 techniques: first-fit, best-fit, next-fit, worst-fit, Data compaction and garbage S1,E2
collection
35 Introduction to Graph & Tree, Graph verses Tree S1
Types of Trees, general tree, binary tree and types, Binary Search Tree (BST)
36-37 S1
and its representations.
Implementation of BST and its operations (insertion, deletion, searching,
38-43 traversals, counting leaf and non-leaf nodes, and height). Conversions of S1, S4
general trees to binary trees.
44-47 Heap and Heap sort. S1,E1
48-50 Threaded Binary Tree( Insertion ,Deletion and Traversals) S1,E1

Dr. Neelam Sharma, Dr. Mainaz Faridi, Dr. Ashok Kumar,

Dr. Archana Mangal, Dr. Swati Nigam, Mrs. Prachi Jain
(Course Instructors)