An Autonomous Institution

Approved by AICTE, Affiliated to Anna University, Chennai.

ISO 9001:2015 Certified Institution, Accredited by NBA (BME, CSE, ECE, EEE, IT & MECH),
Accredited by NAAC with 'A' Grade with CGPA of 3.49.
#42, Avadi-Vel Tech Road, Avadi, Chennai- 600062, Tamil Nadu, India.

DEPARTMENT OF
ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

COURSE FILE

Course Code:
Course: DATA STRUCTURES AND ALGORITHMS
Branch: B. Tech – AI&DS
Year: I
Semester: II

Prepared By
SOMSUBHRA SAHA, M.TECH.
Asst. Professor / AI&DS

DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

Vision
To promote centre of excellence through effectual Teaching and Learning, imparting the contemporary
knowledge centric education through innovative research in multidisciplinary fields.
Mission
 To impart quality technical skills through practicing, knowledge updating in recent technology and
produce professionals with multidisciplinary and leadership skills.
 To promote innovative thinking for design and development of software products of varying complexity
with intelligence to fulfil the global standards and demands.
 To inculcate professional ethics among the graduates and to adapt the changing technologies through
lifelong learning.
 Course File - Check List (2023-24 EVEN)

Name of the Faculty: SOMSUBHRA SAHA MTS No: 2096

Course Code:
DATA STRUCTURES AND
Name of the Course: ALGORITHMS
Semester: II

Programme: AI&DS Year: I

S.No Documents & Details Availability Remarks

1 Vision, Mission, PEO, PO, PSO

2 Syllabus

3 CO with Justification

4 Academic Schedule

5 Course Plan

6 Class Time Table

7 Individual Time Table

8 Revision Class Time Table

9 Course Material for all Units

10 Question Bank with Answers for all Units

11 Previous Year Question papers

12 Student Class Notes (Sample)

13 Slow learners plan of action (proof)

14 Fast learners plan of action (proof)

15 Video Lecture developed for this course?

Any Events organized / Industrial Visit related to this
16
course?
17 Innovative Teaching Methods (With proof)

 Role Play
 Games
 Puzzles
 Crosswords
 Concept for the day
 Pick the Odd Man out
 Charts
  Models / Projects
 PPT / Video / Animations
 Hands on Training in Lab
 Google classroom
Supporting activity (Applicable with proof)

 Assignment
 Case Study
18
 Group Discussion
 Quiz
 Seminar
 Mini Project
19 Logbook(s)

20 Course Exit Survey (Sample)

Internal Assessment – Availability (√)

Particulars CAT-1 CAT-2 CAT-3

Question Paper

Answer booklets (Sample)

CO Attainment Excel

Retest QP with Answer sheets

(if Applicable)
 DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

PEOs PROGRAMME EDUCATIONAL OBJECTIVES (PEOs)

PEO1 Train the graduates with the potential of strong knowledge in the respective field
and to create innovative multidisciplinary solutions for challenges in the society

Groom the engineers to understand, analyse different nature of data and use
PEO2 Machine Learning techniques to develop software systems with varying
complexity for data intensive applications

To practice professionalism among the graduates and reflect good leadership

PEO3 skills with ethical standards and continued professional development through
lifelong learning.

PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO’s PROGRAMME SPECIFIC OUTCOMES (PSOs)

PSO1 To impart theoretical knowledge in the respective field along with recent
industrial tools and techniques to solve societal problems

Apply the core competency obtained in the field of Machine Learning for
PSO2 analysis, design and development of computing systems for multi-disciplinary
problems

Acquire knowledge in the field of intelligence, deep learning and develop

PSO3
software solutions for security and analytics of large volume of data.
 DEPARTMENT OF ARTIFICIAL INTELLIGENCE AND DATA SCIENCE

POs PROGRAMME OUTCOMES (POS)

Engineering Knowledge: Apply knowledge of mathematics, science, engineering fundamentals and

PO1
an Engineering Specialization to the solution of complex engineering problems.

Problem Analysis: Identify, formulate, review research literature and analyze complex
PO2 engineering problems reaching substantiated conclusions using first principles of mathematics, natural
sciences, and engineering sciences.

Design / Development of solutions: Design solutions for complex engineering problems and design
PO3 system components or processes that meet specified needs with appropriate consideration for public
health and safety, cultural, societal, and environmental considerations.
Conduct Investigations of Complex Problems: Use research-based knowledge and research methods
PO4 including design of experiments, analysis and interpretation of data, and synthesis of the information to
provide valid conclusions.
Modern tool usage: Create, select, and apply appropriate techniques, resources, and modern
PO5 engineering and IT tools including prediction and modeling to complex engineering activities with an
understanding of the limitations.
The Engineer and Society: Apply reasoning informed by the contextual knowledge to assess societal,
PO6 health, safety, legal and cultural issues and the consequent responsibilities relevant to the professional
engineering practice.
Environment and sustainability: Understand the impact of the professional engineering solutions in
PO7 societal and environmental contexts, and demonstrate the knowledge of, and need for
sustainable development.
Ethics: Apply ethical principles and commit to professional ethics and responsibilities and norms of the
PO8
engineering practice.

Individual and team work: Function effectively as an individual, and as a member or leader in diverse
PO9
teams, and in multidisciplinary settings.

Communication: Communicate effectively on complex engineering activities with the engineering

PO10 community and with society at large, such as, being able to comprehend and write effective reports and
design documentation, make effective presentations, and give and receive clear instructions

Project Management and Finance: Demonstrate knowledge and understanding of the engineering and
PO11 management principles and apply these to one’s own work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.

Life-long learning: Recognize the need for, and have the preparation and ability to engage in
PO12
independent and life-long learning in the broadest context of technological change.
 DATA STRUCTURES AND ALGORITHMS

Course Objectives: The student should be made

 To recall the concepts of ADTs

 To interpret the linear data structures – lists, stacks, and queues
 To practice non-linear data structures – trees and graphs
 To analyze sorting, searching and hashing algorithms
 To apply Tree and Graph structures

Pre-requisite Chart

PROGRAMMING IN C

DATA STRUCTURES AND

ALGORITHMS

Concept Map

Singly
Algorith linked
m list Applicatio
analysis Stac Queue
n of stack
k
Application
of list
Doubly Circula
LIST STACK AND QUEUE r
linked
list Queue

Applicatio
n of queue Binary tree
Circular
linked DATA STRUCTURE AND
list TREE
ALGORITHM Binary search
tree
Binar Linea
Bubbl y Hashin Hea
r AVL tree
e sort searc g p
searc
h h
MULTIWAY SEARCH B,B+ Tree
Shel SEARCHING, SORTING AND
HASHING TECHNIQUES TREE AND GRAPHS
l sort

Graphs
Selectio Insertio Merg
n sort Minimum BFT and
n sort e sort
Spanning DFT
Tree
 DATA STRUCTURES AND ALGORITHMS

SYLLABUS

UNIT I LISTS 9

Abstract Data Types (ADTs) – Introduction to analysis of algorithms – asymptotic notations–

recursion – analyzing recursive algorithms-List ADT – Array-based implementation – Linked list
implementation – Singly linked lists – Circularly linked lists – Doubly-linked lists – Applications of lists.
UNIT II STACKS AND QUEUES 9
Stack ADT –LIFO Principle- Operations – Applications – Balancing Symbols – Evaluating
arithmetic expressions- Infix to Postfix conversion – Function Calls – Queue ADT – FIFO Principle-
Operations – Circular Queue – De-Queue -Applications of Queues

UNIT III TREES 9

Tree ADT – Terminologies- Tree Traversals - Binary Tree ADT – Expression trees – Binary Search
Tree ADT – AVL Trees – Priority Queue (Heaps) – Binary Heap

UNIT IV MULTIWAY SEARCH TREES AND GRAPHS 9

B-Tree – B+ Tree – Graph Definition – Representation of Graphs – Types of Graph -
Breadth-first traversal – Depth-first traversal –– Bi-connectivity – Euler circuits – Topological Sort –
Dijkstra's algorithm – Minimum Spanning Tree – Prim's algorithm – Kruskal's algorithm

UNIT V SEARCHING, SORTING AND HASHING TECHNIQUES 9

Searching – Linear Search – Binary Search. Sorting-Internal Vs External – Bubble sort –
Selection sort – Insertion sort – Shell sort –. Merge Sort – Hashing – Hash Functions – Separate Chaining
– Open Addressing –Rehashing – Extendible Hashing

TOTAL : 45 PERIODS

Course Outcome:
At the end of the semester the students can be able to:

Course
Course Outcome Statements
Outcome
CO1 Define linear and non-linear data structures

CO2 Implement linear and non–linear data structure operations

CO3 Use appropriate linear/non–linear data structure operations for solving a given
problem
CO4 Apply appropriate graph algorithms for graph applications
CO5 Analyze the various searching and sorting algorithms
 DATA STRUCTURES AND ALGORITHMS

Topic wise Mapping with POs and PSO’s

UNIT-1 LISTS
Pos PSOs
CO Topics
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
Introduction to analysis of
CO1.1 √ - - - - - - - - - - √ - - -
algorithms
analyzing recursive
CO1.2 √ √ - - - - - - - - - √ - - -
algorithms
CO1.3 List ADT √ - - - - - - - - - - √ - - -
CO1.4 Array-based implementation √ √ √ - √ - - - - - - √ √ - -
CO1.5 Linked list implementation √ √ √ - √ - - - - - - √ √ - -
CO1.6 Singly linked lists √ √ √ - √ - - - - - - √ √ - -
CO1.7 Circularly linked lists √ √ √ - √ - - - - - - √ √ - -
CO1.8 Doubly-linked lists √ √ √ - √ - - - - - - √ √ - -
CO1.9 Applications of lists. √ √ - - - - - - - - - √ √ - -
CO1 √ √ √ - √ - - - - - - √ √ - -

UNIT-2 STACKS AND QUEUES

Pos PSOs
CO Topics
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO2.1 Stack ADT √ - √ - √ - - - - - - √ √ - -
CO2.2 Balancing Symbols √ √ - - - - - - - - - √ - √ -
Evaluating arithmetic
CO2.3 √ √ - √ - - - - - - - √ - √ -
expressions
CO2.4 Infix to Postfix conversion √ √ - √ - - - - - - - √ - √ -
CO2.5 Function Calls √ √ - - - - - - - - - √ - √ -
CO2.6 Queue ADT √ - √ - √ - - - - - - √ √ - -
CO2.7 Circular Queue √ √ √ - √ - - - - - - √ - - -
CO2.8 De-Queue √ √ √ - - - - - - - - √ - - -
CO2.9 Applications of Queues √ √ - √ - - - - - - - √ - - -
CO2 √ √ √ √ √ - - - - - - √ √ √ -

UNIT-3 TREES

Pos PSOs
CO Topics
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO3.1 Tree ADT √ - √ - √ - - - - - - √ √ - -
CO3.2 Terminologies- √ - - - - - - - - - - √ √ - -
CO3.3 Tree Traversals √ √ - - - - - - - - - √ - √ √
CO3.4 Binary Tree ADT √ - √ - √ - - - - - - √ √ - -
CO3.5 Expression trees √ √ - √ - - - - - - - √ - √ √
CO3.6 Binary Search Tree ADT √ √ √ √ - - - - - - - √ - √ √
CO3.7 AVL Trees √ √ √ √ - - - - - - - √ - √ √
CO3.8 Priority Queue (Heaps) √ √ √ - √ - - - - - - √ √ - -
CO3.9 Binary Heap √ √ √ - √ - - - - - - √ √ - -
CO3 √ √ √ √ √ - - - - - - √ √ √ √

UNIT-4 MULTIWAY SEARCH TREES AND GRAPHS

 Pos PSOs
CO Topics
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO4.1 B-Tree , B+ Tree √ √ √ - - - - - - - - √ √ - -
CO4.2 Graph √ - √ - √ - - - - - - √ - - -
Breadth-first ,Depth-first
CO4.3 √ √ - √ - - - - - - - √ √ - -
traversal
Bi-connectivity, Euler
CO4.4 √ √ - - - - - - - - - √ √ - -
circuits
CO4.5 Topological Sort √ √ √ - - - - - - - - √ √ - -
CO4.6 Dijkstra's algorithm √ √ - √ √ - - - - - - √ √ √ -
CO4.7 Minimum Spanning Tree √ √ √ √ - - - - - - - √ √ √ -
CO4.8 Prim's algorithm √ √ - √ √ - - - - - - √ - √ √
CO4.9 Kruskal's algorithm √ √ - √ √ - - - - - - √ - √ √
CO4 √ √ √ √ √ - - - - - - √ √ √ √

UNIT-5 SEARCHING, SORTING AND HASHING TECHNIQUES

Pos PSOs
CO Topics
1 2 3 4 5 6 7 8 9 10 11 12 1 2 3
CO5.1 Linear Search √ √ - √ - - - - - - - √ √ - -
CO5.2 Binary Search √ √ - √ - - - - - - - √ √ - -
CO5.3 Bubble sort √ √ - √ - - - - - - - √ - √ √
CO5.4 Selection sort √ √ - √ - - - - - - - √ - √ √
CO5.5 Insertion sort √ √ - √ - - - - - - - √ - √ √
CO5.6 Merge Sort √ √ - √ - - - - - - - √ - √ √
CO5.7 Hashing, Hash Functions √ √ √ - - - - - - - √ √ - -
Separate Chaining, Open
CO5.8 √ √ √ - - - - - - - - √ √ - -
Addressing
Rehashing , Extendible
CO5.9 √ √ √ - - - - - - - - √ √ - -
Hashing
CO5 √ √ √ √ - - - - - - - √ √ √ √

CO Course Outcome Mapping CO's with PO's Mapping

CO's with
PSO's
 PSO 1
PSO 2
PSO 3
PO 10

PO 11

PO12
PO 1

PO 2
PO 3

PO 4
PO 5

PO 6
PO 7
PO 8

PO 9
Define linear and non-
CO1 √ √ √ - √ - - - - - - √ √ - -
linear data structures
Implement linear and non–
CO2 linear data structure √ √ √ √ √ - - - - - - √ √ √ -
operations
Use appropriate linear/non–
linear data structure
CO3 √ √ √ √ √ - - - - - - √ √ √ √
operations for solving a
given problem.
Apply appropriate graph
CO4 algorithms for graph √ √ √ √ √ - - - - - - √ √ √ √
application.
Apply appropriate graph
CO5 algorithms for graph √ √ √ √ - - - - - - - √ √ √ √
applications.
CO √ √ √ √ √ - - - - - - √ √ √ √

1 – Low 2 – Medium 3 – High

Mapping Strength Calculation:

No of Class
CO Course Outcomes Mapping POs/ PSOs Cognitive Level
Sessions
Define linear and non-linear data PO1, PO2, CL1, CL2,
CO1 9
structures PO3,PO5,PO12,PSO1 CL3,CL4,CL5

Implement linear and non–linear PO1, PO2, PO3, PO4,PO5, CL1, CL2,
CO2 9
data structure operations PO12,PSO1, PSO2 CL3,CL4,CL5

Use appropriate linear/non–linear

PO1, PO2, PO3,PO4,PO5, CL1, CL2,
CO3 data structure operations for 9
PO12,PSO1, PSO2,PSO3 CL3,CL4,CL5
solving a given problem.

Apply appropriate graph PO1, PO2,PO3,PO4,PO5, CL1, CL2,

CO4 9
algorithms for graph applications. PO12,PSO1, PSO2,PSO3 CL3,CL4,CL5

Apply appropriate graph PO1, PO2,PO3,PO4, CL1, CL2,

CO5 9
algorithms for graph applications. PO12,PSO1, PSO2,PSO3 CL3,CL4,CL5

Mapping Strength Level

Total No of No of sessions
POs / PSOs Cos (>40 % = 3, 40%<>25% = 2,
Sessions devoted
25%<>5% = 1, <5% = 0)
PO1 CO1,CO2,CO3,CO4,CO5 45 100% 3
 PO2 CO1,CO2,CO3,CO4,CO5 37 82% 3

PO3 CO1,CO2,CO4,CO5 22 49% 3

PO4 CO2,CO3,CO4,CO5 17 38% 2

PO5 CO1,CO2,CO3,CO4 16 36% 2

PO6

PO7

PO8

PO9

PO10

PO11

PO12 CO1,CO2,CO3,CO4,CO5 45 100% 3

PSO1 CO1,CO2,CO3,CO4,CO5 24 53% 3

PSO2 CO1,CO2,CO3,CO4,CO5 16 36% 2

PSO3 CO1,CO2,CO3,CO4,CO5 10 22% 1

Mapping
Mapping CO's with PO's CO's with
PSO's
CO Course Outcome

PSO 1
PSO 2
PSO 3
PO 10
PO 11

PO12
PO 1

PO 2
PO 3

PO 4
PO 5
PO 6
PO 7
PO 8

PO 9

Define linear and non-

CO1 3 3 3 - 2 - - - - - - 3 3 - -
linear data structures
Implement linear and non–
CO2 linear data structure 3 3 2 2 2 - - - - - - 3 3 2 -
operations
Use appropriate linear/non–
linear data structure
CO3 3 3 2 2 2 - - - - - - 3 3 2 1
operations for solving a
given problem.
Apply appropriate graph
CO4 algorithms for graph 3 3 2 2 2 - - - - - - 3 3 2 1
application.
Apply appropriate graph
CO5 algorithms for graph 3 3 2 2 - - - - - - - 3 3 2 1
applications.
CO 3 3 2 2 2 - - - - - - 3 3 2 1

Teaching methods: (if Applicable)

S. No Teaching methods
 T1 Chalk & Talk

T2 Power point presentation

T3 E-Learning

T4 Roll Play

Assessment tools:

S. No Methods Assessment

M1 Technical Activity (Case Study)

M2 Internal Tests

Technical Activity Topics: (Case Study)

S. No Topics CO / PO / PSO
1 Linked list implementation CO1.5/PO1-3,PO12/PSO1
2 Circular Queue CO2.7/PO1-3,PO12
3 Binary Search Tree ADT CO3.6/PO1-2,PO4,PO12/PSO1-2
4 Minimum Spanning Tree CO4.7/PO1-3,PO12/PSO1-2

5 Hashing CO5.7/PO1-2,PO12/PSO1

COURSE PLAN

UNIT I – LISTS

Periods Proposed CO Topics Detailed Coverage Teaching Text /

 Date Methods Ref Book
Introduction to analysis of Algorithm, algorithm as
1 26/02/2024 CO1.1 Chalk & Talk R2-5,11
algorithms technology
asymptotic notations, O-notation, Ω-notation,
2 27/02/2024 CO1.2 Chalk & Talk R2-45
recursion Θ-notation
analyzing recursive Worst case, average
3 28/02/2024 CO1.3 Chalk & Talk R2-23
algorithms case, order of growth
4 01/03/2024 CO1.4 List ADT Abstract data types Chalk & Talk T1-57
Array, Linked list -based
5 04/03/2024 CO1.5 Array, linked list Chalk & Talk T1-59
implementation
Insertion, deletion, T1-62,
6 05/03/2024 CO1.6 Singly linked lists Roll Play
search operations T2-238
Insertion, deletion,
7 07/03/2024 CO1.7 Circularly linked lists Roll Play T1-68
search operations
Insertion, deletion,
8 08/03/2024 CO1.8 Doubly-linked lists Roll Play T1-67
search operations
Polynomial, radix sort,
9 09/03/2024 CO1.9 Applications of lists. Chalk & Talk T1-70
multilists

UNIT II – STACKS AND QUEUES

Proposed Teaching Text /

Periods CO Topics Detailed Coverage
Date Methods Ref Book
1 11/03/2024 CO2.1 Stack ADT Push, Pop Roll Play T1-78
2 12/03/2024 CO2.2 Balancing Symbols Operand , Operator Chalk & Talk T1-87
Evaluating arithmetic T1-88,
3 13/03/2024 CO2.3 Prefix,Postfix,Infix Chalk & Talk
expressions T2-130
Infix to Postfix Power point T1-90,
4 14/03/2024 CO2.4 Operand , Operator
conversion Presentation T2-137
Pass by value, Pass by
5 15/03/2024 CO2.5 Function Calls Chalk & Talk T1-93
reference
6 18/03/2024 CO2.6 Queue ADT Dequeue, enqueue Roll Play T1-95

7 19/03/2024 CO2.7 Circular Queue Front,Rear,enqueue Chalk & Talk R4-135

8 21/03/2024 CO2.8 DeQueue Front,Rear Chalk & Talk T1-95

Simulation of an Chalk & Talk
9 23/03/2024 CO2.9 Applications of Queues T1-100
airport,

UNIT III – TREES

Proposed Teaching Text /

Periods CO Topics Detailed Coverage
Date Methods Ref Book
Root,Child node,
1 25/03/2024 CO3.1 Tree ADT Parent,Sibling,Leaf E-learning T1-105
Node
Number of edges,Depth
2 26/03/2024 CO3.2 Terminologies- of node x,Height of Chalk & Talk T1-106
node x
Complete,perfect,balan
4 28/03/2024 CO3.4 Binary Tree ADT Chalk & Talk T1-111
ced binary tree
PPT
5 15/04/2024 CO3.5 Expression trees Operand , Operato T1-113
presentation
Binary Search Tree Insertion,deletion,
6 16/04/2024 CO3.6 Roll Play T1-116
ADT search
RR rotation,LL
7 17/04/2024 CO3.7 AVL Trees rotation, LR Chalk & Talk T1-126
rotation,RL rotatio
8 18/04/2024 CO3.8 Priority Queue (Heaps) Ascending order Chalk & Talk T1-193
 priority
queue,Descending order
priority queue
9 19/04/2024 CO3.9 Binary Heap Min heap,Max heap Chalk & Talk T1-195

UNIT IV - MULTIWAY SEARCH TREES AND GRAPHS

Proposed Teaching Text /

Periods CO Topics Detailed Coverage
Date Methods Ref Book
Non-Leaf node,Leaf
1 22/04/2024 CO4.1 B-Tree , B+ Tree Chalk & Talk T1-149
node,Root node
Directed and undirected PPT
2 23/04/2024 CO4.2 Graph Definition T1-299
graph presentation
Breadth-first ,Depth-
3 24/04/2024 CO4.3 Backtracking Chalk & Talk T1-335
first traversal
Bi-connectivity,Euler
4 25/04/2024 CO4.4 Chalk & Talk T1-342
circuits
Dependency
5 26/04/2024 CO4.5 Topological Sort resolution,Sentence Chalk & Talk T1-301
Ordering:
Visited property, path
6 29/04/2024 CO4.6 Dijkstra's algorithm Chalk & Talk T1-311
property
Minimum Spanning
7 30/04/2024 CO4.7 graph E-learning T1-329
Tree
Minimum Spanning
8 02/05/2024 CO4.8 Prim's algorithm Chalk & Talk T1-330
Tree
Minimum Spanning
9 03/05/2024 CO4.9 Kruskal's algorithm Chalk & Talk T1-332
Tree

UNIT - V SEARCHING, SORTING AND HASHING TECHNIQUES

Proposed Teaching Text /

Periods CO Topics Detailed Coverage
Date Methods Ref Book
sequential search
1 13/05/2024 CO5.1 Linear Search Chalk & Talk R3-51
algorithm.
Iteration method, E-learning
2 14/05/2024 CO5.2 Binary Search R3-121
Recursive method
3 15/05/2024 CO5.3 Bubble sort swapping Chalk & Talk R3-241
4 16/05/2024 CO5.4 Selection sort swapping Chalk & Talk R1-351
5 17/05/2024 CO5.5 Insertion sort adaptive Chalk & Talk T1-236
PPT
6 20/05/2024 CO5.6 Merge Sort merge T1-246
presentation
Hashing,Hash
7 21/05/2024 CO5.7 Hash table Chalk & Talk T1-165
Functions
Separate Chaining,Open
8 22/05/2024 CO5.8 Hash function Chalk & Talk T1-168
Addressing
Rehashing , Extendible
9 23/05/2024 CO5.9 Load factor Chalk & Talk T1-173
Hashing

TEXT BOOK:
 1. Mark Allen Weiss, Data Structures and Algorithm Analysis in C, 2nd Edition, Pearson Education, 2005.
2. Kamthane, Introduction to Data Structures in C, 1st Edition, Pearson Education, 2007

REFERENCES:

1. Langsam, Augenstein and Tanenbaum, Data Structures Using C and C++, 2nd Edition, Pearson
Education, 2015.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L.Rivest, Clifford Stein, Introduction to Algorithms",
Fourth Edition, Mcgraw Hill/ MIT Press, 2022.
3. Alfred V. Aho, Jeffrey D. Ullman,John E. Hopcroft ,Data Structures and Algorithms, 1st edition,
Pearson, 2002.
4. Kruse, Data Structures and Program Design in C, 2nd Edition, Pearson Education, 2006.

Websites / Extensive reading (e-Learning)

1. https://www.geeksforgeeks.org/data-structures/
2. https://www.javatpoint.com/data-structure-in-c
3. https://www.tutorialspoint.com/dsa_using_c/index.htm
4. https://en.wikipedia.org/wiki/Data_structure

Signature of Course in-charge Signature of HOD