QP.

CODE
B.E / B.Tech. LABORATORY EXAMINATIONS, OCTOBER / NOVEMBER 2018

Third Semester
Computer Science and Engineering
CS8381 - DATA STRUCTURES LABORATORY

(Common to Information Technology and Computer and Communication Engineering)

(Regulations - 2017)

Time : 3 Hours Max. Marks 100

Aim/Procedure
Program& Result Quiz Viva-Voce Record Total
(Algorithm)
20 45 15 10 10 100

Execute the push and pop operations performed on a stack of size 5 using C program.
1.
Implement First In First Out order of queue ADT using arrays in C.
2.
Write a C program to implement a sequential data structure - list ADT using array.
3.
Write a C program to implement stack ADT using linked list implementation
4.
Write a C program to implement queue ADT using linked list implementation
5.
Insert elements in a node with pointers and delete few elements using list ADT in C program.
6.
How will you apply stack in converting Infix to postfix using C? Write a program to implement the same.
7.
Write a C Program to implement LIFO structure. Use Linked List Implementation.
8.
Write a C Program to create a binary tree and obtain the order of the nodes by applying various tree
9. traversal methods.
Write a C program to implement the operations binary search tree and perform the following.

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

10. ii. Insert a node with the element 6
iii. Delete the element 11
iv. Display the elements of the BST in preorder.
Explain programmatically using C, how to perform the different traversals in a binary tree.
11.
How to implement the search operation on a binary search tree, after performing insertion operation using
12. C.

Implement a C program with the criteria, every descendant node’s value in the left subtree of n is less than
13. the value of n and every descendant node’s value in the right subtree is greater than the value n.

Write a C program to implement a self balancing tree with nodal height difference of 1 unit.
14.
 Write a C program to create a binary search tree by satisfying the property, the balancing factor for every
15.
node is at most 1
Implement MIN Heap property using C.
16.

Substantiate the importance of MAX Heap in insertion and deletion by programming using C
17.

A person wants to visit some places. He starts from a vertex and then wants to visit every place connected
to this vertex and so on. What traversal methodology suits best for him and implement it using C? (Breadth
18. First Search).

A person wants to visit some places. He starts from a vertex and then wants to visit every vertex till it
finishes from one vertex, backtracks and then explore other vertex from same vertex. What traversal
19. methodology suits best for him and implement it using C? (Depth First Search)

Describe programmatically using C, how to find the shortest path as an application of graphs.
20.

How to locate an element in an array using

a) linear search
21.
b) binary search

a)Write a C program to search the element in a list by using the searching method in divide and conquer
Technique.
22.
b) Write a C Program to sort the following numbers using Selection sort: 24,17,48, 6, 19,8

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
23. use List ADT
b) Write a C Program to sort the following numbers using Radix sort: 45,73, 86, 9,93, 19
a) Code a C program to implement the hashing with hash table of size 10 using separate Chaining for the
24 following numbers 7,12,41,61,75,2,5,8
Write a C program to sort the elements using Merge sort.
25 Write a C program to implement the graph traversal methods.
26 Write a C program to implement any one of the hashing technique
a.) Create a node and perform the following operations Insertion with single rotation and double
rotation, Display in AVL Tree using C program.
27 b.) Write a C Program to sort the following numbers using Radix sort: 45,73, 86, 9,93, 19

a.) Code a C program for the implementation of priority queue using the following heap operations using
28 Minheap. i.) Insert ii.) Delete
 b.) Write a C Program to sort the following numbers using Shell sort: 6, 23, 18, 11, 69, 15

a. Write a C Program to implement LIFO structure. Use array Implementation.

29 b. Write a C Program to implement to find the element in a list in a sequential order

Write a C Program to implement LIFO structure. Use Linked List Implementation

30

Write a C program to implement the operations of List ADT using linked list and perform the following
i. Create a Linked list with the elements 11,22,44,55
ii. Insert 33 after 22
31
iii. Delete the element 22 from the list
iv. Display the elements.