Scribd
Upload
41 views2 pages

20CS322 Data Structures Lab Experiments

The document outlines the end semester practical examinations for the B.E. in Computer Science and Engineering at K.S.R. College of Engineering, scheduled for November/December 2024. It includes a list of 13 programming experiments focused on data structures, such as linked lists, stacks, queues, trees, and sorting algorithms. Each experiment aims to develop practical skills in implementing and applying various data structures and algorithms.

Uploaded by

banu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
41 views2 pages

20CS322 Data Structures Lab Experiments

The document outlines the end semester practical examinations for the B.E. in Computer Science and Engineering at K.S.R. College of Engineering, scheduled for November/December 2024. It includes a list of 13 programming experiments focused on data structures, such as linked lists, stacks, queues, trees, and sorting algorithms. Each experiment aims to develop practical skills in implementing and applying various data structures and algorithms.

Uploaded by

banu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

K.S.R.

COLLEGE OF ENGINEERING, TIRUCHENGODE – 637 215


[An Autonomous institution, affiliated to Anna University, Chennai]
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
End Semester Practical Examinations Nov / Dec 2024
[Regulations 2020]
Programme: B.E. –Computer Science and Engineering
Course Code & Name: 20CS322 & Data Structures Laboratory
Date and Session of Examination: 30.11.2024 and FN / AN
Year / Semester: II / III Maximum Marks: 100
Time: Three Hours
List of Experiments

1. Develop a program to implement a singly linked list and perform operations such as
insertion, deletion, and traversal.
2. Construct a program to implement a doubly linked list and demonstrate its
functionality for insertion, deletion, and traversal in both directions.
3. Create a program to perform polynomial manipulation using a linked list, including
addition, subtraction, and multiplication of polynomials.
4. Implement stack and queue data structures using arrays and demonstrate their
applications in real-world scenarios.
5. Develop a program to implement stack and queue using linked lists and apply them to
a practical use case.
6. Create a program that applies stack operations to convert an infix expression to
postfix and evaluate the postfix expression using an array-based stack
implementation.
7. Design a queue-based application, such as task scheduling or customer service
simulation, and demonstrate its implementation.
8. Build an expression tree for a given arithmetic expression and traverse it in preorder,
postorder, and inorder sequences.
9. Demonstrate a binary search tree and demonstrate its functionality by performing
insertion, deletion, and searching operations.
10. Construct an AVL tree to maintain balance during insertion and deletion, and
evaluate its efficiency for search operations.
11. Implement graph traversal algorithms such as depth-first search (DFS) and a
minimum spanning tree (MST) using Prim’s algorithm and demonstrate their
applications.
12. Write a programs to apply the insertion sort and merge sort algorithms to arrange a
list of integers in ascending order and compare their performance.
13. Develop a hashing-based program to store and retrieve data efficiently, demonstrating
collision handling using techniques like chaining or open addressing.

Internal Examiner 1 Internal Examiner 2

You might also like