QP.

CODE
B.E / B.Tech. LABORATORY EXAMINATIONS,
DECEMBER 2020
Third Semester
Computer Science and Engineering
CS8381 - DATA STRUCTURES LABORATORY
(Common to Information Technology and Computer and Communication Engineering)
(Regulations - 2017)

Time : 09:00 AM TO 12:30 PM Max. Marks 100

Date : 17.12.2020
Program Results Viva-Voce Record Total
Aim/Procedure
(Algorithm)
20 40 20 10 10 100

1. a. Implement List ADT to store the elements 10, 20,30,40,50 and find any element and
delete 30 from the list and display the elements after deletion. Use Array for list
Implementation. (40)
b. Write a C program to sort the n elements using insertion sort. (40)
2. Write a C program to implement the operations of List ADT using linked list and perform
the following
(80)
i. Create a Linked list with the elements 11,22,44,55
ii. Insert 33 after 22
iii. Delete the element 22 from the list
iv. Display the elements.
3. a. Write a C program to implement the task of printing the documents of a printer. Use
Linked list Implementation. (80)
4. a. Write a C Program to implement LIFO structure. Use array Implementation. (40)
b. Write a C Program to implement to find the element in a list in a sequential order. (40)
5. Write a C Program to implement LIFO structure. Use Linked List Implementation.
(80)
6. a. Write a C Program to implement the operations of FIFO structure. Use Array
Implementation. (40)
b. Write a C program to sort the n elements using Selection sort. (40)
7. Write a C Program to create a binary tree and obtain the order of the nodes by applying
various tree traversal methods.(80)

8. Write a C program to implement the operations binary search tree and perform the
 following. (80)

i. Create a BST with the elements 10,20,5,17,18,11

ii. Insert a node with the element 6
iii. Delete the element 11
iv. Display the elements of the BST in preorder.
9. Write a C program to create a binary search tree by satisfying the property,the balancing
factor for every node is at most 1 (80)
10. a. Implement the priority queue using binary heap property. Use the two categories of
binary heap for implementation. (40)
b. Write a C program to search the element in a list by using the searching method in
divide and conquer Technique. (40)
11. a. Write a C program to sort the elements using the efficient sorting technique whose
complexity is O( n log n) where n is the number of elements in the array. (40)
b. Write a C program to implement FIFO structure using array. (40)
12. a. Write a C program to sort the elements using Merge sort. (40)
b. Write a C Program to convert the infix expression a+ (b*c-d)/e into postfix expression.
(40)
13. Write a C program to implement the graph traversal methods. (80)
14. a. Write a C program to implement any one of the hashing technique. (80)
15. a. Write a C program to add the polynomial equations 2x^2+5x^1+3x^0 and
6x^2+3x^1+7x^0. For addition use List ADT. (40)
b. Write a C program to sort the elements using bubble sort . (40)

INTERNAL EXAMINER EXTERNAL EXAMINER