Salem college of Engineering and Technology CS3311 DATA STRUCTURES LABORATORY
SALEM COLLEGE OF ENGINEERING AND TECHNOLOGY
(Approved by AICTE and Affiliated to ANNA University Chennai)
NH-68, Salem-Attur Main Road, Mettupatty, Perumapalayam,
Selliamman Nagar, Salem, Tamil Nadu 636111.
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
LABORATORY MANUAL
Name of the laboratory : CS3311-DATA STRUCTURES LABORATORY
: COMPUTER SCIENCE AND ENGINEERING
Name of the department
Year / Semester : II/III
Academic Year : 2025-2026
Prepared by
[Link]/CSE
Subject In-Charge Verified by Approved by
HOD/CSE PRINCIPAL
[Link] / CSE
1
Salem college of Engineering and Technology CS3311 DATA STRUCTURES LABORATORY
CS3311 DATA STRUCTURE LABORATORY L T P C 0042
COURSE OBJECTIVES:
To demonstrate array implementation of linear data structure algorithms.
To implement the applications using stack.
To implement the applications using Linked list
To implement Binary search tree and AVL tree algorithms.
To implement the Heap algorithm.
To implement Dijkstra’s algorithm.
To implement Prim’s algorithm
To implement Sorting, Searching and hashing algorithms.
LIST OF EXPERIMENTS:
1. Array implementation of Stack, Queue and Circular Queue ADTs
2. Implementation of Singly Linked List
3. Linked list implementation of Stack and Linear Queue ADTs
4. Implementation of Polynomial Manipulation using Linked list
5. Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues
9. Implementation of Dijkstra’s Algorithm
10. Implementation of Prim’s Algorithm
11. Implementation of Linear Search and Binary Search
12. Implementation of Insertion Sort and Selection Sort
13. Implementation of Merge Sort
2
Salem college of Engineering and Technology CS3311 DATA STRUCTURES LABORATORY
14. Implementation of Open Addressing (Linear Probing and Quadratic Probing)
[Link] Name of the Experiments
Array implementation of Stack ADTs
1a
Array implementation of Queue ADTs
1b
Array implementation of Circular Queue ADTs
1c
Implementation of Singly Linked List
2
Linked list implementation of Stack ADTs
3a
. Linked list implementation of Linear Queue ADTs
3b
Implementation of Polynomial Manipulation using Linked list
4
Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
5
Implementation of Binary Search Trees
6
Implementation of AVL Trees
7
Implementation of Heaps using Priority Queues
8
Implementation of Dijkstra’s Algorithm
9
Implementation of Prim’s Algorithm
10
Implementation of Linear Search
11a
Implementation of Binary Search
11b
Implementation of Insertion Sort
12a
Implementation of Selection Sort
12b
Implementation of Merge Sort
13
Implementation of Open Addressing (Linear Probing and Quadratic Probing)
14
CONTENT BEYOND SYLLABUS
3
Salem college of Engineering and Technology CS3311 DATA STRUCTURES LABORATORY
LIST OF EXPERIMENTS
[Link] Name of the Experiments
CYCLE-I
Array implementation of Stack ADTs
1a
Array implementation of Queue ADTs
1b
Array implementation of Circular Queue ADTs
1c
Implementation of Singly Linked List
2
Linked list implementation of Stack ADTs
3a
. Linked list implementation of Linear Queue ADTs
3b
Implementation of Polynomial Manipulation using Linked list
4
Implementation of Evaluating Postfix Expressions, Infix to Postfix conversion
5
Implementation of Binary Search Trees
6
Implementation of AVL Trees
7
CYCLE-II
Implementation of Heaps using Priority Queues
8
Implementation of Dijkstra’s Algorithm
9
Implementation of Prim’s Algorithm
10
Implementation of Linear Search
11a
Implementation of Binary Search
11b
Implementation of Insertion Sort
12a
Implementation of Selection Sort
12b
Implementation of Merge Sort
13
Implementation of Open Addressing (Linear Probing and Quadratic Probing)
14