5. Data Structure Lab
Uploaded by
banu5. Data Structure Lab
Uploaded by
banuDATA STRUCTURES AND ALGORITHMS Category L T P C
24CSP36
LABORATORY ESC 0 0 2 1
PREREQUISITE: Basic understanding of mathematical concepts like recursion, combinatorics, and complexity
analysis. Familiarity with problem-solving techniques and algorithmic thinking is essential. Logical reasoning and
analytical skills will help in developing efficient computational solutions.
OBJECTIVES:
1. To learn to implement various linked list operations for dynamic data management.
2. To gain knowledge of stack and queue data structures for expression evaluation and efficient data
processing.
3. To explore tree and graph traversal techniques for effective data organization and retrieval.
4. To use algorithmic approaches to solve pathfinding and optimization problems with shortest path and MST
algorithms.
5. To Compare and analyze different sorting techniques for efficient data arrangement.
List of Experiments:
1. Apply linked list (Single, Double and Circular) operations to manage a dynamic collection of data with
insertion, deletion, and traversal.
2. Develop a program for polynomial manipulation using linked lists to perform addition and multiplication.
3. Demonstrate stack operations using both arrays and linked lists for efficient data handling.
4. Use a binary search tree (BST) to store and retrieve data efficiently by applying insertion, deletion, and
search operations.
5. Convert an infix expression into postfix and evaluate it using stack-based operations.
6. Apply tree traversal techniques (preorder, inorder, postorder) to navigate a binary tree.
7. Implement graph traversal algorithms (DFS & BFS) to explore and analyze connectivity in a graph.
8. Solve the shortest path problem using Dijkstra’s algorithm on a weighted graph.
9. Apply Prim’s algorithm to construct the Minimum Spanning Tree (MST) of a graph.
10. Implementation of Insertion Sort and Selection Sort.
TOTAL: 45 PERIODS
COURSE OUTCOMES:
At the end of the course, the students will be able to:
COs Course Outcome Cognitive Level
Apply linked list operations (Single, Double, Circular) for data organization
CO1 Apply
and manipulation.
Develop stack and queue-based solutions for expression evaluation and real-
CO2 Apply
time applications.
Implement tree and graph traversal algorithms to solve computational
CO3 Apply
problems.
Utilize graph algorithms like Dijkstra’s and Prim’s to find optimal solutions
CO4 Apply
for network problems.
Demonstrate the efficiency of different sorting algorithms in organizing and
CO5 Apply
managing data.
Mapping of COs with POs and PSOs
COs/ PO PO PSO PSO
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9
POs 10 11 1 2
CO1 3 3 2 2 2 - - - - - 2 3 2
CO2 3 3 3 2 3 - - - - - 2 3 2
CO3 2 3 3 3 2 - - - - - 1 3 3
CO4 3 3 3 2 2 - - - - - 1 3 3
CO5 2 3 2 2 2 - - - - - 2 3 2
Avg. 3 3 3 2 2 - - - - - 2 3 2
1-low, 2-medium, 3-high
