DEPARTMENT OF COMPUTER SCIENCE
AND ENGINEERING
Laboratory Manual
REGULATION 2023
CS23231 – DATA STRUCTURES
, RAJALAKSHMI ENGINEERING COLLEGE
An Autonomous Institution, Affiliated to Anna University
Rajalakshmi Nagar, Thandalam – 602 105
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING
CS23231 – DATA STRUCTURES
(Regulation 2023)
LAB MANUAL
Name :.............................................
Register No. :.............................................
Year / Branch / Section : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Semester :.............................................
Academic Year :.............................................
, LESSON PLAN
Course Code Course Title L T P C
(Laboratory Integrated Theory Course)
CS23231 Data Structures 3 0 4 5
LIST OF EXPERIMENTS
Sl. No Name of the experiment
Week 1 Implementation of Single Linked List (Insertion, Deletion and Display)
Week 2 Implementation of Doubly Linked List (Insertion, Deletion and Display)
Week 3 Applications of Singly Linked List (Polynomial Manipulation)
Week 4 Implementation of Stack using Array and Linked List implementation
Week 5 Applications of Stack (Infix to Postfix)
Week 6 Applications of Stack (Evaluating Arithmetic Expression)
Week 7 Implementation of Queue using Array and Linked List implementation
Week 8 Implementation of Binary Search Tree
Week 9 Performing Tree Traversal Techniques
Week 10 Implementation of AVL Tree
Week 11 Performing Topological Sorting
Week 12 Implementation of BFS, DFS
Week 13 Implementation of Prim’s Algorithm
Week 14 Implementation of Dijkstra’s Algorithm
Week 15 Program to perform Sorting
Week 16 Implementation of Open Addressing (Linear Probing and Quadratic Probing)
Week 17 Implementation of Rehashing
, CS23231 – D a t a S t r u c t u r e s
INDEX
Name of the Experiment Expt. Page Faculty
S. No.
Date No Sign
1 Implementation of Single Linked List
(Insertion, Deletion and Display)
2 Implementation of Doubly Linked List
(Insertion, Deletion and Display)
3 Applications of Singly Linked List
(Polynomial Manipulation)
4 Implementation of Stack using Array and
Linked List implementation
5 Applications of Stack (Infix to Postfix)
6 Applications of Stack (Evaluating
Arithmetic Expression)
7 Implementation of Queue using Array and
Linked List implementation
8 Performing Tree Traversal Techniques
9 Implementation of Binary Search Tree
10 Implementation of AVL Tree
11 Implementation of BFS, DFS
12 Performing Topological Sorting
13 Implementation of Prim’s Algorithm
14 Implementation of Dijkstra’s Algorithm
15 Program to perform Sorting
16 Implementation of Collision Resolution
Techniques
Note: Students have to write the Algorithms at left side of each
problem statements.
AND ENGINEERING
Laboratory Manual
REGULATION 2023
CS23231 – DATA STRUCTURES
, RAJALAKSHMI ENGINEERING COLLEGE
An Autonomous Institution, Affiliated to Anna University
Rajalakshmi Nagar, Thandalam – 602 105
DEPARTMENT OF COMPUTER SCIENCE AND
ENGINEERING
CS23231 – DATA STRUCTURES
(Regulation 2023)
LAB MANUAL
Name :.............................................
Register No. :.............................................
Year / Branch / Section : . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
Semester :.............................................
Academic Year :.............................................
, LESSON PLAN
Course Code Course Title L T P C
(Laboratory Integrated Theory Course)
CS23231 Data Structures 3 0 4 5
LIST OF EXPERIMENTS
Sl. No Name of the experiment
Week 1 Implementation of Single Linked List (Insertion, Deletion and Display)
Week 2 Implementation of Doubly Linked List (Insertion, Deletion and Display)
Week 3 Applications of Singly Linked List (Polynomial Manipulation)
Week 4 Implementation of Stack using Array and Linked List implementation
Week 5 Applications of Stack (Infix to Postfix)
Week 6 Applications of Stack (Evaluating Arithmetic Expression)
Week 7 Implementation of Queue using Array and Linked List implementation
Week 8 Implementation of Binary Search Tree
Week 9 Performing Tree Traversal Techniques
Week 10 Implementation of AVL Tree
Week 11 Performing Topological Sorting
Week 12 Implementation of BFS, DFS
Week 13 Implementation of Prim’s Algorithm
Week 14 Implementation of Dijkstra’s Algorithm
Week 15 Program to perform Sorting
Week 16 Implementation of Open Addressing (Linear Probing and Quadratic Probing)
Week 17 Implementation of Rehashing
, CS23231 – D a t a S t r u c t u r e s
INDEX
Name of the Experiment Expt. Page Faculty
S. No.
Date No Sign
1 Implementation of Single Linked List
(Insertion, Deletion and Display)
2 Implementation of Doubly Linked List
(Insertion, Deletion and Display)
3 Applications of Singly Linked List
(Polynomial Manipulation)
4 Implementation of Stack using Array and
Linked List implementation
5 Applications of Stack (Infix to Postfix)
6 Applications of Stack (Evaluating
Arithmetic Expression)
7 Implementation of Queue using Array and
Linked List implementation
8 Performing Tree Traversal Techniques
9 Implementation of Binary Search Tree
10 Implementation of AVL Tree
11 Implementation of BFS, DFS
12 Performing Topological Sorting
13 Implementation of Prim’s Algorithm
14 Implementation of Dijkstra’s Algorithm
15 Program to perform Sorting
16 Implementation of Collision Resolution
Techniques
Note: Students have to write the Algorithms at left side of each
problem statements.
