DATA STRUCTURES MID-1 QUESTION BANK

UNIT-I & II
UNIT-I
1. Define Data Structure?
2. Define ADT?
3. Define deQueue?
4. Write the syntax of a node structure in DLL?
5. What is Priority Queue?
6. What is the difference between the functions pop() & peek()?
7. Which Data Structure is used to check whether an expression contains a balanced
parenthesis or not?
8. What are the disadvantages of a normal Queue?
9. Write the conditions whether the Circular Queue is full or not?
10. Write the condition for Queue Overflow using arrays?
11. Classify different types of Linked list?
12. What is the difference between Linear and Non-linear data structure?
13. Write the applications of Circular Queue?
14. Write the applications of Stack?
15. Compare the time complexities of dequeue() operation on Queue using arrays & linked
list?
16. Compute the value of the postfix expression 6 3 2 4 + - *
17. Describe the significance of NULL pointer in linked list
18. Is it possible to have both Head and Tail pointers point to NULL at the same time in
DLL? If YES, how? If NO why?
19. Let the following Circular queue can accommodate maximum 6 elements with the
following data: Front=2, Rear=4. Q = _________, L,M,N, ________. What will happen
after enqueue(O) operation takes place?
20. Write the differences between SLL & DLL?
21. Define Data structure? Neatly sketch various types of Data strucutres?
22. Write an algorithm to reverse the Single linked list?
23. Discuss the advantages of linked list over the array?
24. Write a function to traverse the Circular linked list?
25. Examine the following operations performed on a Stack of the size 5: PUSH(1), POP(),
PUSH(2), PUSH(3), POP(), PUSH(4), POP(), POP(), PUSH(5).
After the completion of all operations, analyze the no. of elements in the Stack?
26. Construct the prefix form of infix expression A-B/(C*D^E) ?
27. Why and When we should use Stack or Queue data structure instead of Array or List?
28. Explain in detail about the various operations on queues with examples?
29. Write a C program to insert a node into front of list.
30. Write the steps to convert given infix expression into postfix expression:
(A + B ^ D)/(E – F) + G
31. Evaluate the following post fix expression: 7 3 4 + - 2 4 5 / + * 6 / 7 +
32. (a) Write the differences between array and linked list.
(b) Elaborate different types of linked lists.
33. Develop an algorithm for deleting an element in a Circular Queue?
34. Write a function and explain with an example to insert a node at specific position on SLL.
35. Write a C program to implement Stack using Arrays.
36. Explain DLL along with its operations?
37. Write a C program to convert infix expression to postfix expression using Stack ADT.
38. Explain Circular Queue with Add() and Delete() function?
UNIT-II
1. Define Hash table?
2. Define Collision?
3. What is direct addressing?
4. What is Hash function?
5. List the Collision Resolution techniques?
6 . What is the formula used in quadratic probing?
7 . Describe Dictionary data structure with an example?
8. Define Rehashing?
9. What is meant by Load Factor in Hashing?
10. What is Primary Clustering?
11. List out the different types of Hash functions?
12. Write the hash function used in Double hashing?
13. List out different types of representation of a Dictionary data structure?
14. What is the time complexity of Quadratic probing?
15. When you find the Load Factor in Hashing?
16. What is the advantage of Chained hash table over the Open addressing scheme?
17. Explain the advantage of the hash table than a linked list?
18. Write the applications of Dictionary data structure?
19. What is significance of Load Factor of a hash table?
20. What will be the position of the number 789456123 in a hash table, when the Folding
method is applied? (Let the table size is 1000)
22. Define the terms the Primary and Secondary clustering?
23. Explain the need of Skip list data structure?
24. A hash function H() is defined as H(k) = k mod 7 with linear probing. After inserting the
keys {37, 38, 72, 48, 98, 11, 56} into a table, what will be the location of 11?
25. Consider a hash table with 50 buckets i.e. n=50, and keys are k1=34, k2=65 & k3=15.
Find the positions of them by applying the Mid-Square hash method?
26. Dicuss collision resolution technique of Closed addressing?
27. Explain in detail about Linear probing with the following keys: {125,246, 347, 525, 647,
816, 150, 422, 990} wih the hash function H(k) = 3k + 2
28. What is the benefit of rehashing? Insert the following keys by applying rehashing
technique, Initial table size is 7. Keys: {56,79, 41 44, 21, 43, 11, 29}
29. Define hash function? Describe four Hash functions in detail?
30. Why skip list is called randomized data structure? Explain the procedure to search the
element 35 from the below skip list:

31. Define Collision? Insert the following elements into Hash table by using Quadratic
probing? {32,45,67,82,35,98,22,95}Consider the hash table size is 11.
32. List out the collision resolution techniques of open and closed addressing. Insert the
following keys into a hash table by applying double hashing. Keys:
16,4,6,22,24,10,31,7,9,20,26 and Table size =10
33. Write a C program to Implement Dictionary using Linear List representation?
34. Explain Extendible hashing with the following elements: 16, 4, 6, 22,24, 31, 7, 9, 20, 26?
35. Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function
H(k) = k mod 10. Show the resulting:
a. Open hash table b. Closed hash table using Linear probing
c.Closed hash table using Quadratic probing