We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0, CHHOTUBHAI GOPALBHAI PATEL INSTITUTE OF
eC 7 TECHNOLOGY
Lab Planning
Subject Teachers:
1. Ms. Purvi Tandel
Department Name: IT and CS dept.
en 2. Ms. Jitisha Patel
Program & Semester: Subject Name: Data Structures
[Link] 3" Sem ITA & B
Academic Year: 2022-23 Subject Code: CE4010
Sr. No, Title pouty
Hours
1. | Write a menu driven program, with the help of functions to insert 24
student information, to modify student information and to display
student information like a string of 100 characters called name, a
string of 200 characters called address, integer to hold enrollment
number and a string of 10 characters called admission number.
Prepare an array of 10 students for the above class called Second
Year using the above student information.
2. [Implement a stack which performs the following operations: 2
i PUSH
i POP
iii PEEP
iv DISPLAY
3. Write a program to convert an infix operation to its prefix 4
| operation using stack.
4. | Implement queue operations for library window of five people. 2
CIE-1 2
5. | Implement a circular queue for buffering system which performs 2
the following operations: insert, delete, get_front, get_rear, empty
and full.
6. | Write a menu driven program to implement following operations 2
for train coach using singly linked list.
a. Insert a node at the front of the linked list
Scanned with CamScanner d. Delete a node from linked list
b. Insert a node at the end of the linked list
c. Insert a node in sorted order in linked list
c. Delete a node from linked list
7 Write a program to implement music player system using doubly
linked list and perform following operations,
a. Insert a node at the front of the linked list
b, Insert a node at the end of the linked list
: CIE-2
8. | Sort the given elements by user using Insertion sort algorithm.
sequence of the following tree orders:
a. Preorder
b. Inorder
c. Postorder
9. | Write a program to create a binary search tree and find traversal
10. | Write a program to store k keys into an
location computed using a hash function,
k<=n and_k takes values from [1 to m|
a. Linear probing
+ ____b. Quadratic probing
collisions use the following collision resolution techniques:
array of size nat the
loc = key % n, where
|, m>n. To handle the
11. _ | Implement breadth first search for a graph.
CIE -3
Total contact hours:
30
\
Name & Signature of Subject Teacher:
Ms. Purvi Tandel \GX
Ms. Jitisha Patel le
Name & Signature of Subject In-Charge:
Ms. Jitisha Patel ee
Name & Signature of Head of Department:
\
Ms. Purvi Tandel yor
Scanned with CamScanner
