Course Title: Data Structures and Its

Course Code: SWE2001 TPC 3 2 4

Applications
Version No. 1.3
Course Pre-requisites/
SWE1004/SWE2005
Co-requisites/
anti-requisites (if any). CSE2001
1. To impart the basic concepts of data structures and algorithms
2. To understand concepts about searching and sorting techniques
3. To understand basic concepts about stacks, queues, lists, trees and
Objectives: graphs
4. To understand about writing algorithms and step by step approach
in solving problems with the help of fundamental data structures.
5. 5.To implement applications using Data Structures
COs Mapping with POs and PEOs

Course
Course Outcome Statement POs / PEOs
Outcomes
To impart the basic concepts of data structures and
CO1 PO1, PO4.
algorithms
To understand concepts about searching and sorting PO1,
CO2
techniques
To understand basic concepts about stacks, queues, lists, PO1,
CO3
trees and graphs
To understanding about writing algorithms and step by
CO4 step approach in solving problems with the help of PO2, PO3. PO6.
fundamental data structures.
C05 To implement applications using Data Structures PO2, PO3. PO6.

TOTAL HOURS OF INSTRUCTIONS: 45

aa
Module No. 1 Introduction to Algorithm Analysis 4 Hours
Basic Algorithmic Analysis: Asymptotic notations: Big O, little o, omega, and theta notations,
Running time calculations, Identifying differences among best, average, and worst case behaviors;
Complexity analysis- Time and space
Module No. 2 Linear Data Structures 9 Hours
Linear Data Structures: Arrays, Stacks, Applications of stacks, Linear Queues, Circular Queues,
Double ended queues, Applications of Queues, Lists, Doubly Linked Lists, Circular Linked Lists,
Applications of lists.
Module No. 3 Trees 10 Hours
Trees, Types of trees, Binary Trees, Operations on Trees, Tree representations and tree traversals,
Application of binary trees. Binary search trees, Operations and Traversals on BST, Applications.
Introduction of Height balanced trees, AVL trees
Module No. 4 Sorting Techniques 8 Hours
General Background, merge sort, quick sort, selection sort, priority queue, heap sort, Insertion sort.
Comparison, Time complexities and applications
Module No. 5 Searching Techniques 5 Hours
Searching: Basic Search Techniques, Sequential Search, Binary Search. Hashing: Various types of
hashing, Collision Resolution techniques- Separate Chaining, linear probing, Quadratic probing,
Double hashing, Extendible hashing, Rehashing.
Module No. 6 Graphs 10 Hours
GRAPHS Introduction, Representations of graphs, adjacency list, adjacency matrix, Sparse Matrix.
Traversals: BFS and DFS, Time complexities and Applications.
Shortest-path algorithms Single source shortest path; Dijkstra’s, Minimum spanning tree, Prim’s
and Kruskal’s algorithms
Text Books
1. Data Structures and Algorithm Analysis in C++ (Fourth Edition), Mark Allen Weiss Published
by Addison-Wesley, 2013, ISBN: 978-0132847377
References
1. Goodrich, Michael T & Roberto Tamassia, and Algorithm Design: Foundations, Analysis &
Internet Examples, Wiley Student Edition, 2002.
2. Data Structures (SIE), Seymour Lipschutz, McGraw Hill Education.
3. Data Structure Using C++, Varsha H Patil, Oxford university press.
4. .J.P.Tremblay and Paul Sorenson, An introduction to data structures with applications,2007
List of Laboratory Experiments

Develop algorithms and write programs in C++ to implement the following:

Module-1: Introduction to Algorithm Analysis
1. Write a Program to find the factorial of a given number using recursion and analyze the
time complexity.
2. Write a Program to find the transpose of a given matrix and display its time complexity.
Challenging:
3. Write a Program to illustrate the difference between recursion and iteration by giving its
time complexities.
Module-2: Linear Data Structures
1. Write a Program to implement single linked list and its operations.
2. Write a Program to implement doubly linked list and its operations.
3. Write a Program to implement stack operations using arrays.
4. Write a Program to implement queue operations using linked list.
Challenging:
1. A train is travelling from new Delhi to Trivandrum, initially it started with 20
compartments, after some hours of journey (at Bhopal) delinked 9 and 12 compartments, at
Nagpur link some more compartments at the end of train. Each compartment will have 60
members, store 60 member’s details for each compartments.
2. Write a Program for Evaluation given postfix expression.

Module-3: Trees
1. Write a program to implement Representation of Binary tree with linked list.
2. Write a program to implement Binary tree traversals- In-order, Pre-order, Post-order using
recursion.
3. Create AVL Tree (Balanced BST) for the following sequence 3,2,1,4,5,6,7,8,9
Challenging:
1. Get 20 numbers from user and store in array. Create a Binary search tree in the sequence
of input. Perform the following:
(i) Insert an element into BST.
(ii) Delete an element from BST.
(iii) Search an element in BST.
Module-4: Sorting Techniques
1. Write a program to implement the quicksort.
2. Write a program that takes the details of Students (name, roll number, address, CGPA) and
sort it in a non-decreasing order using Selection sort based on CGPA.

Challenging:
1. Write a Program to read N individual characters and display them in alphabetical order
using merge sort.

Module-5: Searching Techniques

1. WAP to implement liner search, binary search.
2. WAP to implement basic hashing techniquies.
Challenging:
1. Write a program that takes the details of a person (name, age, and city) and search for a
specific name using linear search
2. Write a Program to implement Binary search on the given sequence
12,33,42,51,66,73,87,99,101
3. Write a Program to illustrate the concept of Hashing and resolve collision if there is any.
Module-6: Graphs
1. Write a Program to implement DFS algorithm and print the DFS sequence for below graph
start with node D.

F
C

B
D

G E

2. Write a Program to implement BFS Algorithm and print the BFS sequence start with node
A.
Challenging:
1. Write a Program to check the connectivity of a graph using BFS.
2. Write a program to implement Dijkstra’s algorithm
3. Write a Program to Implement Prim’s Algorithm and find the minimum spanning
tree for the given graph
 2

3
F
C
10
A 7 3
8 4
18
4 B
D
9
H
10
2 25
3
G E
7
4. Write a Program to implement Kruskal’s Algorithm and find the minimum spanning tree
for the above graph.

Course Type Embedded Theory and Lab (ETL)

Theory – 75%
Continuous Assessment Test-1 15
Continuous Assessment Test-2 15
Mode of Evaluation Digital Assignments/Quizzes (Min) 30
Final Assessment Test 40
Lab – 25%
Recommended by the
14th BoS 11.05.2024
Board of Studies on
Date of Approval by the
12th Academic Council, 25.05.2024
Academic Council