Course Code Course Title L T P S C
22CS102003 DATA STRUCTURES 3 - 2 - 4
Pre-Requisite -
Anti-Requisite -
Co-Requisite -
COURSE DESCRIPTION: This course provides an overview of data structure concepts, arrays,
stack, queues, trees, and graphs. Discussion of various implementations of these data objects,
programming styles, and run-time representations.
COURSE OUTCOMES: After successful completion of the course, students will be able to:
CO1. Understand the concept of Dynamic memory management, data types, algorithms, Big
O notation.
CO2. Understand basic data structures such as arrays, linked lists, stacks and queues.
CO3. Solve problem involving graphs, trees and heaps.
CO4. Apply Algorithm for solving problems like sorting, searching, insertion and deletion of
data.
CO-PO-PSO Mapping Table:
Program Specific
Program Outcomes
Course Outcomes
Outcomes
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3 PSO4
CO1 3 2 - - - - - - - - - - 3 - - -
CO2 3 2 - - - - - - - - - - 3 - - -
CO3 3 3 3 - - - - - - - - - 3 - - -
CO4 3 3 3 2 - - - - - - - - 3 - - -
Course
Correlation 3 3 3 2 - - - - - - - - 3 - - -
Mapping
Correlation Levels: 3: High; 2: Medium; 1: Low
COURSE CONTENT
MODULE – I (10 Hours)
Introduction: Introduction to Data Structures, Basic Concepts and Notations,
Abstract Data Types, Analysis and Efficiency of Algorithms, Time and Space
Complexity.
Stack, Queue: Stack, Stack operations, Implementation using arrays, applications of
stack, Queue, Queue operations, Implementation using arrays, various Queue
Structures, applications of queue.
MODULE-2 (8 Hours)
Linked lists: Single linked list, double linked list, circular linked list, operations on
linked lists, Applications of Linked List.
Implementation of stack using Pointers, Implementation of Queue using Pointers.
MODULE-3 (8 Hours)
Searching Techniques: Linear Search, Binary Search and Fibonacci Search.
Sorting Techniques: Selection Sort, Insertion sort, Bubble sort, Merge Sort, Quick
Sort, Heap sort, Radix Sort.
Hash Tables: Hash Functions, Collision Handling Schemes, Applications.
MODULE-4 (10 Hours)
Trees: Vocabulary and Definitions, Binary Tree, Implementation, Binary Tree
Traversal, Binary Search Tree, Implementation, Balanced Search Trees: AVL Trees,
Implementation, Splay Trees, Red- Black Trees.
MODULE-5 (9 Hours)
Graph Theory: Graphs Terminology, Graph ADT, Data Structures for Graphs-
Adjacency Matrix Structure, Graph Traversals, Shortest Paths, Minimum Spanning
Trees- Prims’ Algorithm, Kruskal’s Algorithm, Dijkstra's Algorithm, Floyd-Warshall
Algorithm
Text Books:
1. Data Structures and Algorithm Analysis in C, Mark Allen Weiss, Second Edition,
2002, Pearson.
2. Introduction to Algorithms, Thomas H. Cormen, Charles E. Leiserson,
Ronald L.Rivest, Clifford Stein, Third Edition, 2010, PHI.
3. Data Structures and Algorithms Made Easy by Narasimha Karumanchi,
2020, Career Monk Publications.
Reference Books:
1. Fundamental of Data Structures in C, Horowitz, Sahani, Anderson-
Freed, Second Edition, 2008, Universities Press.
2. Classic Data Structures, Debasis Samantha, Second Edition, 2009, PHI
Experiential Learning
1. Demonstrate recursive algorithms with examples.
2. Develop a program to perform operations of a Stack and Queue using arrays.
3. Implement and perform different operations on Single, Double and Circular
Linked Lists.
4. Develop a program to perform operations of Stack and Queue using Linked Lists
5. Develop programs to implement Stack applications.
6. Implement Circular Queues.
7. Implement various Searching techniques.
8. Develop programs for different Sorting techniques
9. Develop a program to represent a Tree data structure.
10. Develop a program to demonstrate operations on Binary Search Tree.
11. Demonstrate Graph Traversal Techniques.
12. Develop a program to find Minimum cost Spanning tree.
Video Resources:
1. https://www.youtube.com/watch?v=zWg7U0OEAoE&list=PLBF3763AF2E1C572F
2. https://www.youtube.com/watch?v=S47aSEqm_0I&list=PLD9781AC5EBC9FA16
3. https://www.youtube.com/watch?v=9MmC_uGjBsM&list=PLyqSpQzTE6M_Fu6l8ir
VwXkUyC9Gwqr6_
