QUESTION BANK
BSc. II YEAR
DATA STRUCTURES
Short Answers Type Questions
1. What is data structure? Explain various types of data structure.
2. What are the applications of array?
3. Describe abstract data type with example.
4. Why we need data structure?
5. Differentiate between linear and non-linear data structures.
6. Give the features of abstract data type (ADT).
7. What is an algorithm? Discuss the different steps in the development of an
algorithm?
8. Distinguish between primitive and non-primitive data structures.
9. Define Data Object.
10. Define ADT.
11. What is algorithm analysis?
12. What do you mean by Array? Describe the storage structure of array.
explain various types of array in detail
13. What are advantages of Data Structure?
14. What are types of Data Structure?
15. What is static and dynamic DS ? Example
16. What is linear and nonlinear DS ? Give example of each.
17. What are advantages of ADT?
18. define data type?
19. What are the characteristics of Algorithm ?
20. What is Performance Analysis of an algorithm?
21. What is space complexity?
22. What is time complexity?
23. What are the components of space complexity?
24. What are Asymptotic Notations?
25. List Asymptotic Notations.
26. Define Big O notation?
27. Define Omega Notation?
28. Define Theta Notation?
1
29. List types of array.
30. What is an array?
31. What is sorting?
32. What is searching?
33. List variants of searching.
34. What is mean by binary search?
35. Write the applications of binary tree.
36. Give algorithm to sort a list using bubble sort.
37. List advantages of binary search over linear search.
38. What is In-Place Sorting?
39. List various types of sorting algorithms.
40. What is internal sorting?
41. What are examples of internal sorting?
42. What is In-Place sorting?
43. What is stable sorting?
44. Binary search performs Faster than sequential search. State True/False
Justify.
45. What is sentinel search?
46. Define Sentinel?
47. What are different searching techniques in data structure?
48. Why we need/ use sentinel search instead of linear search?
49. What is precondition for binary search.
50. What is list?
51. What are the operation perform by link list?
52. Define Doubly Link list.
53. What is circular link list?
54. What is polynomial?
55. Define generalized link list.
56. How to search node in link list?
57. Define NULL list.
58. Write the applications of linked list.
59. What are the disadvantages of linked list?
60. Mention the advantages of linked list?
2
61. What are the operations on link list in a data structure?
62. What is a circular linked list?
63. What is a linked list?
64. What are types of link list?
65. Write Node structure of singly link list and doubly link list.
66. State the following T/F.
1) The elements of a link list are sorted sequentially .
2) Singly Link List can traverse sequentially.
3) Doubly Link List can traverse sequentially.
67. What is TOP of stack?
68. Give the purpose of PUSH operation?
69. Define the term stack overflow.
70. Give the purpose of POP operation.
71. Give the applications of stack.
72. Explain stack as static data structure.
73. Name the Data Structure used in reverse of the String.
74. Convert the following infix expression into postfix form
1) (A+B)*(C+D)*E^F
2) A*B-C$D+E
3) A*B+C/D
4) ((A+B)*C-(D-E)^(F+G)
5) (A+B)*D+E/F
75. Write the prefix form for the following:
1) A+B*(C-D)/(E-F)
2) A*B-C$D+E
3) A*B+C/D
4) ((A+B)*C-(D-E))
5) (A+B)*D+E/F
76. What is a Stack?
77. What is mean stack underflow?
78. List the operations in stack.
79. List applications of stack.
80. Define stack.
3
81. What is FIFO?
82. Define Queue.
83. What is Queue?
84. Give differences between linear and circular queue.
85. What is LIFO?
86. List different applications of Queue.
87. What is front and rear in queue?
88. List the operations in queue.
[Link] the types of queue.
[Link] many ways to implement queue? Name them.
[Link] is Double Ended.
[Link] the types of Dqueue.
Long Answers Type Questions
1. Explain in detail Asymptotic Notations?
2. Describe ADT with its advantages.
3. Define Data Structure .Why we need data structure?
4. With example explain the term Data Object.
5. Why analysis of algorithm is important?
6. Compair linear and non linear data structure.
7. Write Short note on Types of Data Structure.
8. Explain with example big O noatation.
9. Explain Theta and Omega notation in detail.
[Link] Various types of Array in detail.
[Link] array . How to declare it? Explain its memory representation.
[Link] the help of example explain linear search.
4
[Link] is 2D array explain its row and column representation.
[Link] the term binary search with its advantages.
[Link] Short note o
[Link] quick sort algorithm with the help of an example.
[Link] an algorithm for binary search and discuss its speed compared with
linear search.
18. Show the Steps of Sorting the following data using Bubble Sort.
1. Data: 22,4,66,27,55,17
2. 60,31,15,54,17
3. May,Sep,Oct,Jan,Apr,Nov
[Link] Selection Sort with the help of example.
[Link] the help of example describe bubble sort.
[Link] time complexity of various sorting algorithms.
[Link] divide and conquer strategy of algorithm with example.
[Link] algorithm for binary search . State its time complexity.
[Link] the help of example describe insertion sort. Also state its advantages
and disadvantages.
[Link] elements are store in array in memory explain with example.
[Link] are the advantages of binary search over linear search.
[Link] program for linear and binary search and state its time complexity in
best case and worst case.
[Link] Quick sort with example.
[Link] program for Bubble Sort.
[Link] program for Merge Sort.
[Link] program for quick sort, selection sort.
[Link] program for linear search and binary search.
33. Show the Steps of Sorting the following data using Quick Sort.
1. Data: 24,30,27,32,11
2. 55,7,80,32,18,23,82,62
34. Problem Sort the following data in ascending order using the insertion sort
method:
i. Orange, Apple, Banana, Pineapple, Strawberry, Watermelon.
ii. 30,40,10,50,25,35,15
5
[Link] between linear search and binary search.
[Link] types of sorting based on comparison based.
[Link] the following using selection sort.
69,71,8,75,33,29
[Link] is divide and conquer strategy in algorithm?
39. Sort the following using selection sort.
1. 3,1,4,5,9,2,6,5,4
2. 7,3,2,16,24,4,11,9
3. 38,27,43,3,9,82,10
40. Explain counting sort with example.
[Link] are the advantages and disadvantages of counting sort?
[Link] the following data using Radix sort.
1. 121, 432, 564, 23, 1, 45, 788
[Link] of Sorting Methods by their time complexity in best case and
worst case.
44. Explain binary search with example.
[Link] how to represent singly linked list with help of diagram and
example.
[Link] are the fields of link list?Describe with the help of diagram.
[Link] is link list? Write program to create it.
[Link] node structure of doubly link list. Write advantages of Doubly List list
over singly link list.
[Link] different types of link list. Also state their advantages and dis
advantages.
[Link] any two operations of singly link list.
[Link] ‘C’ function and explain algorithm to insert element at the beginning
of linked list.
[Link] algorithm to delete element from circular linked list.
[Link] program and explain algorithm to insert element at the beginning of
singly linked list.
[Link] algorithm to delete element from singly linked list.
[Link] Doubly link list? How to create it?Explain with example.
[Link] program and explain algorithm to insert element at the beginning of
doubly linked list.
[Link] algorithm to delete element from doubly linked list.
[Link] the advantages and disadvantages of linked list over array?
6
[Link] algorithm for insert and delete a node from doubly linked list.
[Link] and explain the algorithm for search and modify operations in doubly
linked list with example.
[Link] the circular linked list in detail.
[Link] is linked list? Write and explain the algorithm for crate, insertion and
traverse operations in doubly linked list with example.
[Link] to search element in singly link list? explain with example.
64. What is a linked list, and how is it different from an array?
65. Explain the structure of a node in a singly linked list. What are its components?
66. Explain how circular linked lists work. What is the significance of having the last
node point to the first node?
67. How does the traversal of a doubly linked list differ from a singly linked list?
[Link] is linked list? Write and explain the algorithm for create and traverse
operations in single linked list with example.
69. What are the different types of linked lists? Explain each type briefly.
70. How do you insert a new node at the beginning of a singly linked list?
71. Write ‘C’ function to insert a new node at given position in singly linked list?
72. Write ‘C’ program to insert node at middle and at end of singly Link List.
73. Describe the process of deleting a node from a singly linked list. How do you
handle deletion at the head, middle, and end of the list?
74. What are the advantages and disadvantages of using a linked list over an array?
75. Write a function to search for an element in a singly linked list. How does the
time complexity of this operation compare with that of arrays?
76. What is a circular doubly linked list? Provide an example of where this structure
might be useful.
[Link] down the steps to invert a singly-linked list to circular linked list?
[Link] is link list. Explain its type with suitable diagram.
79. Write a ‘C’ program to sort elements of a singly linked list in ascending order and
display the sorted List.
80. Write short note on Circular Link List.
81. Write ‘C’ program to insert and delete node at any position in circular link list.
82. Write ‘C’ program and algorithm for merging of singly link list.
83. Write ‘C’ program to sort Link List.
84. Write ‘C’ program that reads the name,age,salary of 10 persons and maintains
them in link list sorted by names.
85. Write ‘C’ function to delete an odd position element from Doubly link list.
86. Write ‘C’ function to display even number number of elements from link list.
7
[Link] to create stack ? Explain with exmple.
[Link] the help of diagram explain PUSH and POP operations in stack.
[Link] and write program for static implementation static stack.
[Link] the following terms with diagram-
1) Stack overflow
2) Stack underflow
[Link] is stack? Why it is known as LIFO? Write algorithm of PUSH and
POP operation on stack.
[Link] the applications of Stack. What is Recursion? Explain Recursion for
93. Write a C function PUSH() and POP() for static stack.
[Link] Program to check expression is well parenthesized or not.
[Link] the output of the following .
Void fun()
{
int i=5,x,y,z;
Init();
while(i<8)
{
Push(i+3);
i++;
}
x=pop();
y =pop();
Push(i+0);
Push(x+y+z);
Push(y+z);
while(!stackempty())
printf(“\n %d”,pop());
}
Note:-Such type of different programs based on stack and queue also.
[Link] stack check the expression is well parenthesized or not.
( ( [ ) ] ) show each step.
[Link] an algorithm for converting Parenthesized Infix expression into
Postfix
expression.
[Link] is stack? Write algorithm for operations of stack with examples.
8
99. Describe PUSH and POP operations of stack with the help of diagram.
100. Write static implementation of stack.
101. How stack is useful in reversing a String?Write ‘C’ program to reverse the
string.
102. Write dynamic implementation of stack.
103. Write Algorithm to evaluate postfix expression.
104. Write Algorithm to convert infix expression into postfix expression.
105. Write program to check expression is well parenthesis or not.
106. For the following operation show the stack.
1) Push(1)
Push(20)
Pop()
Pop()
Pop()
Push(1)
Peek()
Push(100)
Pop()
107. Write ‘C’ programto convert Infix expression into postfix expression.
108. Explain the applications of stack in detail.
109. Write stack contents to check string is palindrome or not.
1) nitin
2) abcd
110. Explain in detail recursion with example.
111. Write program to check string is palindrome or not.
112. Convert the expression (A+B)*C into postfix using stack show each
step.
113. Convert the (A + B – C)+(D * (E + F) /G) infix expression to the postfix
expression using Stack.
114. Convert the given infix expression to a prefix expression:
A^B*C/(D*E-F).
115. Write algorithm to evaluate a postfix expression.
116. Evaluate the postfix expression
AB+CD-*
If the value A=5,B=4,C=2,D=6
9
117. Explain is backtracking.
118. How to store stack using linked list? Explain with example.
119. What are different forms to write expression. Explain with example.
120. What is queue? Why it is known as FIFO explain with example?
121. Write an algorithm to insert and delete an element from a simple
queue.
122. Explain circular queue?
123. Write an algorithm to insert and delete an element from a circular
queue.
124. Explain the various operations that can be performed on a queue.
125. Explain the implementation of circular queue using array. How an
“empty queue” is distinguished from a “full queue”? Write necessary
functions to perform all valid operations on circular queue.
126. What is Priority Queue? Explain the types of priority queue.
127. Explain the algorithms for various operations of circular queue.
128. Give brief description about the priority queues.
129. What are the applications of queue?
130. What is Queue? Write C functions to implement static queue.
131. Write ‘C’ program to implementation of dynamic queue.
132. What are the disadvantages of linear queue?
133. Explain double ended queue with example/
134. Explain types of Double ended queue.
135. Write algorithm for Double ended queue.
136. What is Round Robin Algorithm?
137. For the following operation show queue.
Insert(10)
Insert(20)
Insert(3)
Delete()
Insert(4)
Delete()
Delete()
10