2019 – 2020 ODD SEMESTER

UNIVERSITY PART B QUESTION BANK

IT T 33 DATA STRUCTURES
Year/Sem: II/III Batch: 2018-2022
UNIT I

1. What is list ADT? Explain array implementation of linked list.

2. Write the algorithm to insert and delete the element in the single linked list.
3. Explain the structure of doubly linked list. Write the algorithm for various operations performed on it.
(Apr 2012,Nov 2017)
4. Explain doubly linked list with its merits and demerits. State the algorithm to declare a set of nodes
using the array or dynamic implementation. (Apr 2011)
5. Explain the creation of linked list and write the procedure for displaying the contents of a list. (Nov
2011)
6. Explain circularly linked list. Write the algorithm that is used to represent a stack and a queue. (Apr
2011)
7. Define polynomial ADT. Explain the representation of polynomial using linked list.(Nov 2011)
8. Explain the representation of polynomial using a linked list and show how addition of polynomial is
performed. (Apr 2012)
9. Define sparse matrix. Discuss the representation of it using linked list.
10. Represent the following polynomial using liked list: 7x3+6x2+3x+1
11. Create a doubly linked list and perform all the basic operations such as insertion, deletion,
modification and traversal o f the list with suitable example.
12. Define stack ADT. Explain the array implementation of stack with example.
13. Explain the stack operation using linked list. (Nov 2011)
14. Describe an algorithm to convert infix to postfix notation.(April 2017)
15. Give the algorithm to delete a node from a linked stack with illustrations. (Apr 2012)
16. State the algorithm for conversion of infix to postfix expression. Convert the following expressions to
postfix and evaluate the same for A=10, B=6, C=8, D=10 and state the difference of three expressions.
(Apr 2011) (MAY 2019)
a) A*B+C/D
b) A*(B+C)/D
c) A*(B+C/D)
17. A). Give the algorithm to delete an element from an array based stack.
B). Give the applications of stacks. (Nov 2011)
18. Explain about the data structure classification in detail.Apr 2015, Nov 2017
19. Describe about array and linked list implement using array?Apr 2015.
20. (a) What is stack and how is it implemented? ExplainApr 2015.
(b) List the applications of stack.Apr 2015.
21. What is linked list and how can we implement it using array? Explain Apr 2015.
22. Explain the concept of linked list with illustration. (Nov 2018)
23. What are primitive data structures and linear data structures? Illustrate with example and also explain
the significance of abstract data structures and its uses. Dec 2014.

24. Explain the operation of inserting an element at the front, middle and at the rear in a double linked list.
(Nov 2018)

25. Illustrate the algorithm to display the content of a stack with an example. (Nov 2018)

26. What is a stack? Explain its operations with example. (MAY 2019)

UNIT II
1. What is queue ADT? Explain insertion and deletion operations of queue using array
implementation.
2. Explain about the implementation of queue using linked list with example.(Apr 2015)
(a) Describe about the array implementation of circular queue.Apr 2015.
(b) Give the limitations of queues.Apr 2015.
3. What is linked list and how can we implement using array Apr 2015.
4. Explain circular queue an element into insert and deletion with suitable example. April 2017 (MAY
2019)
5. Write short notes on priority queue. (Apr 2011) (Nov 2018(5)) (MAY 2019)
6. Explain about the implementation of queue using linked list with example.(Apr 2015)
7. How to represent polynomials using sparse matrix and explain with example? Apr 2015.
8. Explain the following: (a) Priority Queue. (b) Double ended queues.(11)-Apr 2015.
9. Write short notes on doubly ended queue and its operation.
10. State and explain the algorithm used to perform addition of two polynomials using linked list.
11. Dec 2014.
12. Explain representation of polynomials and sparse matrices with an application of its use.Dec
13. 2014.
14. Explain any two applications of queues. (Apr 2012)
15. write an algorithm to implement a queue using array and to enqueue an element into it .(April
2017)
16. Briefly explain the operations of queue with an example. (Nov 2018)

UNIT III

1. Define binary tree. Explain the binary tree traversal techniques with suitable example. (Nov 2011)
2. Explain the array representation of binary tree. Give the drawbacks associated with it. (Apr 2012)
3. Explain the linked list representation of binary tree. (Nov 2011)
 4. Explain the various traversals of binary tree with illustrations. (Apr 2012,April 2017)
5. Define binary search tree. Explain BST algorithm for insert, delete, find min and find max operations.
(Apr 2011)
6. Define AVL tree. Explain the operations of AVL tree with suitable example. (Apr 2011,April 2017)
7. Explain B tree indexing in detail.
8. Explain the method of inserting a new record in a B+ tree. (Nov 2011)
9. Explain the method of deleing a record in a B+ tree with illustrations. (Apr 2012)
10. Discuss tree indexing with algorithm and example.
11. (a) Explain in detail about depth first search. Apr 2015.
(b) Write the routine for performing breadth first search. Apr 2015.
12 (a) Traverse the example tree using inorder, preorder and post order traversal. Apr 2015.
(b) Illustrate array and linked list implementation of binary trees. Apr 2015.
13. Compare binary tree and binary search tree with example.Apr 2015.
14. (a) Insert the example numbers into a binary search tree: 8, 5, 10, 15, 20, 18,3.Apr 2015.
(b) What is tree? Give some of the applications of trees.Apr 2015
15. (a) state the operations performed in a stack? How many times you will pop a stack of 10 elements to
reach the sixth element from the top? Discuss any two applications of stack and queue.Dec
2014.
16. Write an algorithm to perform the operations for a queue data structure. Explain priority queue with an
Example (11)-Dec 2014.
17. Paraphrase Splay tree with an example. (Nov 2018(5))
18. Discuss the B+ tree and compare with B tree. (Nov 2018(6))
19. Explain the process of finding the minimum and maximum element of binary search tree. (Nov 2018)
20. Explain in detail insertion into AVL trees. (MAY 2019)
21. Write a routine to perform insertion and deletion in B-tree.(MAY 2019)

UNIT IV

1. Define sorting. Explain Bubble sort with an example.

2. Explain quick sort algorithm with a suitable example. Discuss the best, average and worst case
analysis of the same. (Apr 2012,2015, April 2017)

3. Explain the selection sort algorithm with example.

4. Explain heap sort algorithm with example and do the analysis.

5. Write the procedure for heap sort and trace the given numbers: 18, 13, 10, 8, 5, 15(11)-Apr 2015.

6. Write the routine for insertion sort and perform insertion sort with own example (11)-Apr 2015.

7. Write down the insertion sort algorithm with example. Discuss the best, average and worst case
analysis of the same. (Apr 2012)

8. Describe Shell sort algorithm with a suitable example. (April 2017)

9. What is the mechanism behind merge sort? Discuss the algorithm along with its complexity.

10. Explain the merge sort algorithm using the following set of data. Compare the result by
constructing heap sort for the same set of data: 45, 32, 71, 27, 53, 33, 12, 67.Dec 2014.

11. Describe radix sort algorithm with a suitable example. (Nov 2011)

12. Compare and contrast the four sorting techniques, bubble sort, quick sort, merge sort and radix sort.
(Apr 2011)

13. What is external sorting? Discuss the methods of external sorting.

14. What is internal sorting? Explain any two sorting methods.

15. Explain the insert and delete operations of heap with an example. (Nov 2018)

16. With a neat diagram, explain about radix sort with an example. (Nov 2018)

17. Sort the following numbers using Quick sort procedure and discuss the time and space complexity
of this algorithm. 42,12,-8,98,67,83,08,104,7 (MAY 2019)

18. Difference between merge sort and radix sort with suitable example. (MAY 2019)

UNIT V

1. Define hash function. Explain the routine for simple hash function.

2. Discuss in detail the issues in hash tables. (Apr 2012)

3. What do you mean by hashing? Explain the various hashing functions. (Nov 2011)

4. Define hash functions and explain its methods in details.Apr 2015.

5. Define graph ADT. Explain representations of graph.

6. Explain in detail the undirected graphs and directed graphs and their traversals. (Apr 2011, April
2017)

7. Discuss the DFS algorithm in detail with suitable example.

8. Discuss the BFS algorithm in detail with suitable example. (Nov 2018(6))

9. Write the routine for performance breadth first search. Apr 2015.

10. Explain the different tree traversal algorithms. Illustrate the inorder, preorder and postorder
traversal with an example (11)-Dec 2014.

11. Compare the breadth first search and depth first search algorithm and illustrate with an example
(11)-Dec 2014.
12. What is a minimum spanning tree? How is it related to finding the shortest paths? State the
implementation of Prim’s algorithm for minimum spanning tree. (Apr 2011)

13. Find the minimum cost spanning tree for given graph using Kruskal’s algorithm.( April 2017)

14. Write a short notes on spanning tree. (Nov 2018(5))

15. Describe about the application of hashing and explain about the rehashing. (Nov 2018)

16. What do you mean by topological sorting? And write the routine to perform topological sort with
example (Apr 2015) (MAY 2019)

17. Explain different types of hash function with example. (MAY 2019)