FACULTY NAME COURSE

CODE
MCA 152

PAPER NAME Data &

File Structures LAB

Mr. Vijay Singhal, Professor

L
T/P
CREDIT
0
2
1

1. WAP to insert and delete an element from an array.

2. WAP to implement single link list with the following operations
a. Insert item
b. Delete item
c. Display item
d. Search item
e. Empty list
f. Reverse display the item
g. Reverse the list
3. WAP to implement sorted single link list with appropriate functions.
4. WAP to implement doubly link list with appropriate functions.
5. WAP to implement grounded header link list with appropriate functions.
6. WAP to implement circular header link list with appropriate functions
7. WAP to transpose the sparse matrix.
8. WAP to implement the sparse matrix using link list with the following operationsa. Insert an item.
b. Delete an item.
c. Display matrix.
9. WAP to implement polynomial using link list with the following operationsa. Add polynomial
b. Multiply polynomial
c. Display polynomial
10.
WAP to implement STACK using link list with appropriate functions.
11.
WAP to implement QUEUE using link list with appropriate functions.
12.
WAP to implement circular QUEUE using array for the following operationsa. Insert
b. Delete
c. Display
13.
WAP to implement input restricted and output restricted DEQUE using array.
14.
WAP to implement BST tree with following operationsa. Insert an item (recursive/non-recursive)
b. Delete an item(recursive/non-recursive)
c. Total Node
d. Toal non-leaf node
e. Traverse BST (Pre/Post/In-order)
15.
WAP to traverse a threaded BST.
16.
WAP for binary search.

17.
18.
19.
20.
21.
22.

WAP
WAP
WAP
WAP
WAP
WAP

for
for
for
for
for
for

linear search.
insertion sort.
bubble sort.
merge sort.
quick sort.
shell sort.