Data Structures Course Code: CS T201

Programme Name/s : Computer Science & Engineering

Programme Code : CSE
Semester : III
Course Title : Data Structures
Course Code : CS T 201
Pre-requisite : NIL

I. RATIONALE
Through this course, students will acquire the skills to select the most effective data structure for a given
problem, enhancing both performance and scalability. It highlights the strong connection between data
structures and algorithms, enabling students to craft more efficient solutions. This foundational
understanding is essential for progressing into advanced topics such as artificial intelligence, machine
learning, and database management, where optimal data handling is crucial for developing robust and
efficient systems.

II. INDUSTRY/EMPLOYER EXPECTED OUTCOME

Industry and employers expect graduates with a strong understanding of data structures to be capable of solving complex
problems efficiently while designing scalable, high-performance systems. This course equips students with the knowledge
of data structures and algorithms, enabling them to optimize code, reduce system resource usage, and improve the overall
performance of applications. These skills are crucial in industries such as software development, data science, finance,
and artificial intelligence, where efficient data management and algorithmic optimization are key to building robust,
cutting-edge solutions.

III. COURSE LEVEL LEARNING OUTCOMES (COS)

Students will be able to achieve & demonstrate the following Cos on completion of course based learning.

CO1Analyze algorithmic performance of various sorting & searching techniques.

CO2 Understand & Apply various data structures like linked list, stacks and queues for problem solving.
CO3 Understand & Apply various table and tree structures.
CO4 Understand & Apply graph applications.
CO5 Understand various algorithmic techniques.

IV. TEACHING-LEARNING & ASSESSMENT SCHEME

Learning Assessment Scheme

Scheme
Actual
Contact
Course Course Title Abbr. Course Hrs./Week Credits Theory
Code Category Paper
/s Duration
L T P FA SA Total
Max Max Max Min

CS T201 Data Structures DS PCC 3 0 0 3 3 25 75 100 40

 Abbreviations: L- Lecture, T- Tutorial Learning, P-Practical, FA - Formative Assessment, SA -Summative
assessment

Note:

FA represents average of three CIEs as mentioned below conducted during the semester.

SA represents summative assessment based on Semester End Examination (SEE) as mentioned below.

SEE Question paper will be for 75 marks. Question paper will contain 10 questions of 1 marks each
and 5 questions of 13 marks each unit-wise without choice of question.

Component Marks Total Marks

CIETest-1 20
CIETest-2 20
CIE (Sum of all 3
CIE’s)/2 =25
CIETest-3
(Micro-project, NPTEL 10
Course/ NPTEL Assignments)
SEE Semester End Examination 75 75
Grand Total 100
V. THEORY LEARNING OUTCOMES AND ALIGNED COURSE CONTENT

Suggested
CO's Covered and Learning content mapped with CO's.
S. No Teaching-
Estimated number of
Learning
Lectures
Pedagogies.
Unit -I
1 CO1 Introduction to data structures, Arrays- One-
(Estimated Teaching Hours – Dimensional Array: Memory Allocation, Operations Chalk Board and
12) on Arrays- Searching-Linear search and Binary PPT
Search, Sorting- Insertion Sort, Bubble Sort,
Selection Sort, Multidimensional Arrays- Two-
Dimensional Arrays memory representation of a
matrix, Sparse Matrices, Three-Dimensional and n-
Dimensional Arrays, limitations of array; Stacks –
Definition, Array Representation, operations and
applications-conversion of an infix to postfix
expression, evaluation of postfix expression,
tower of Hanoi problem.
Unit 2:
CO2 2 Queue- Definition, Array Representation, structures-
2
(Estimated Teaching Hours – circular, deque, priority queue and applications;
Dynamic storage management; Linked Lists - Singly
12) Chalk Board, PPT
linked list, Doubly linked lists, Circular linked lists,
Representation and Applications of linked list using and Demonstration
stack and queue;
3 CO3 Unit 3:
(Estimated Teaching Hours – Tree- definition and concepts, representation of Chalk Board, PPT
12) binary tree, types of binary tree, operations on and Demonstration
binary trees, Types of binary trees- BST , Height
balanced trees-AVL tree and Red-black tree; B tree,
B+-Trees & its Applications
4 CO4 Unit 4:
(Estimated Teaching Hours – Graphs- definition, terminologies and
12) representations, graph traversal- BFS and DFS, Chalk Board, PPT
Single source shortest path- Bellman-Ford and Demonstration
algorithm, Dijkstra’s algorithm, Single-source
shortest paths in directed acyclic graphs- topological
sorting, All pair shortest path problem-Warshall’s
algorithm and transitive closure, Minimum spanning
trees- Prim’s and Kruskal’s Algorithm
5 CO5 Unit 5:
(Estimated Teaching Hours – Table – Rectangular tables, Jagged tables, Inverted
12) tables and Hash tables-Hashing techniques, Chalk Board, PPT,
Collision resolution techniques, closed hashing, Demonstration and
Open hashing, comparison of collision resolution Micro Project
techniques; Set- definition, terminologies and
representations, operations and applications of set.
VI. SUGGESTED COS-POS MATRIX FORM

CO-PO and PSO Mapping

CO PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 3 3 2 1 2 1 2 1 2 3 2 2
CO2 3 3 3 3 3 2 1 2 1 2 1 2 2 3 2
CO3 3 3 3 3 3 2 1 2 1 2 1 2 2 3 2
CO4 3 3 3 3 3 2 1 2 1 2 1 2 3 3 2
CO5 3 2 2 2 2 2 1 1 1 1 1 2 3 2 2
Average 3 2.8 2.8 2.8 2.8 2 1 1.8 1 1.8 1 2 2.6 2.6 2

Low-1: Medium-2: High-3

VII. SUGGESTED LEARNING MATERIALS / BOOKS

Text Books: Ebook /ppt Link (if available)
1 Title Classic Data Structures
Author Debasis Samanta
Publisher Prentice-Hall of India Pvt. Ltd.
2 Title Fundamentals of Data Structures in C
Author Ellis Horowitz, Sartaj Sahni, Susan Anderson-
Freed
Publisher Computer Science Press
Reference Book:
1 Title Data Structures and Algorithms using Python
Author Subrata Saha
Publisher Cambridge University Press

2 Title Data Structures and Algorithms in Python https://ia601807.us.archive.org/26/items/

Author Michael T. Goodrich, Roberto Tamassia, Michael H. data-structures-and-algorithms-in-python-
Goldwasser pdfdrive/Data%20Structures%20and
Publisher Wiley %20Algorithms%20in%20Python
%20%28%20PDFDrive%20%29.pdf
3 Title Data Structures and Algorithimic thinking with
Python
Author Narasimha Karumanchi
Publisher Career Monk
4 Title Hands-On Data Structures and Algorithms with
Python
Author Basant Agarwal, Benjamin Baka
Publisher O’Reilly

E-Books/Web References/NPTEL Courses

1. https://onlinecourses.nptel.ac.in/noc19_cs40/preview
2. https://nptel.ac.in/courses/106102064