B.E / B.Tech.

PRACTICAL END SEMESTER EXAMINATIONS, APRIL/MAY 2022

AD3271 - DATA STRUCTURES DESIGN LABORATORY

(Regulations 2021)

Time : 3 Hours Answer any one Question Max. Marks 100

Aim/ Procedure Program Calculation Viva-Voce Record Total

1. a.) Write a Python Program to implement the following operations for Stack ADT using array
implementation. i.) Push ii.) Pop iii.) Peek iv.) Display. (50)
b.) Write a Python Program to sort the following numbers using Merge sort:
51, 33, 5, 13, 28, 65 (30)

2. a.) Write a Python Program to implement the following operations for Queue ADT using array
implementation. i.) Insert ii.) Delete iii) Peek iv.) Display. (50)
b.) Write a Python Program to sort the following numbers using Quick sort:
14, 23, 8, 19, 63, 153 (30)

3. a.) Write a Python Program to implement the following operations for List ADT using array
implementation. i.) Create ii.) Insert iii.) Erase iv.) Search v.) Traverse (50)
b.) Write a Python Program to sort the following numbers using Insertion sort:
75, 43, 72, 8, 13, 2, 112 (30)

4. a.) Write a Python Program to implement the following operations for List ADT using Linked
List implementation. i.) Create ii.) Insert after the node iii.) Search. iv.) Traverse (50)
b.) Write a Python Program to sort the following numbers using Bubble sort:
67, 73, 65, 4, 17, 8, 121 (30)

5. a.) Write a Python program to implement Stack ADT by using linked list for the following
operations i.) Push ii.) Pop iii.) Peek iv.) Display. (50)
b.) Write a C Program to sort the following numbers using Selection sort:
324, 27, 77, 20, 12, 5 (30)

Page 1 of 4
6. a.) Write a Python program to implement Queue ADT by using linked list for the following
operations i.) Enqueue ii.) Dequeue iii.) Peek iv.) Display (50)
b.) Write a Python Program to check whether the given number is in the list using linear search.
(30)
7. a.) Write a Python program to implement List ADT by using linked list for the following
operations i.) Create ii.) Insert beginning of the list iii.) delete iv.) Traverse (50)
b.) Write a Python Program to check whether the given number is in the list using binary
search. (30)
8. a.) Write a Python Program to merge the given two Linked List into a Single Linked List (50)
b.) Write a Python program to implement the hashing with hash table of size 10 using separate
Chaining for the following numbers 17,22,11,12,45,27,33,44 (30)

9. a.) Write a Python program to convert an infix expression to postfix expression using Stack
ADT. (50)
b.) Write a Python program to implement the hashing with hash table of size 10 using open
addressing for the following numbers 8,12,71,98,36, 105, 48 (30)
10. a.) Write a Python program to implement the addition of two polynomials using linked list. (50)

b.) Write a Python Program to visualize the list class by instantiating its object and do the
following operations i.) adding element at the end ii.) storing a value in a particular position iii.)
finding element position iv) delete an element (30)
11. a.) Write a Python program to construct a binary tree and display the nodes using inorder,
preorder and postorder traversals. (50)

b.) Write a Python C Program to find factorial of a number using Recursion (30)

12. a.) Create a node for binary tree and implement the following operations in the tree Create,
Search and Preorder traversal and Postorder traversal using Python program.
(50)
b.) Write a Python Program to sort the following numbers using Insertion sort:
76, 23, 62, 4, 1, 75, 8 ,2 (30)

13. a.) Write a Python Program for Binary Search Tree with the following operations Create,
Insert, Delete and View. (50)

Page 2 of 4
 b.) Write a Python Program to find sum of natural numbers using Recursion (30)
14. a.) Write a Python Program for Binary Search Tree with the following operations Create,
Insert, Findmin and Findmax. (50)

b.) Write a Python Program to visualize the dictinary class by instantiating its object and do the
following operations i.) show the list of keys ii.) show list of values iii.) show list of pairs iv.)
inserting a pair of values (30)

15. a.) Write a Python program to implement Minimum Spanning Tree algorithm from the given
Graph. (50)
b.) Write a Python Program to visualize the list class by instantiating its object and do the
following operations i.) adding element at the end ii.) storing a value in a particular position
iii.) finding element position iv) delete an element (30)

16. a.) Write a Python program for the implementation of priority queue using the following heap
operations using Minheap. i.) Insert ii.) Delete iii.) Display (50)
b.) Write a Python C Program to find factorial of a number using Recursion (30)

17. a.) Write a Python program for the implementation of priority queue using the following heap
operations using Maxheap i.) Insert ii.) Delete iii.) Display (50)

b.) Write a Python Program to visualize the dictinary class by instantiating its object and do the
following operations i.) show the list of keys ii.) show list of values iii.) show list of pairs iv.)
inserting a pair of values (30)
18. a.) Write a Python program to implement Dijkstra’s algorithm to solve the single source shortest
path problem. (50)
b.) Write a Python Program to Input an adjacency matrix to represent a graph and find the
indegree and outdegree of each node in the graph. (30)
19. a.) Implement the DFS to perform depth first search on the graph using Python. (50)
b.) Write a Python Program to check whether the given number is in the list using binary
search. (30)
20. a.) Implement the BFS to perform breadth first search on the graph using Python. (50)

b.) Write a Python Program to check whether the given number is in the list using linear search.
(30)

Page 3 of 4
Page 4 of 4