2500 Data Structures MCQs

Arrays and Strings

1. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

3. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

4. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

5. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

6. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

7. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

8. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

9. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

10. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
11. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

12. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

13. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

14. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

15. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

16. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

17. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

18. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

19. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

20. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

21. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

22. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

23. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

24. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

25. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

26. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

27. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

28. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

29. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

30. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

31. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

32. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

33. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

34. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

35. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

36. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

37. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

38. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

39. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

40. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

41. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

42. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

43. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

44. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

45. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
46. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

47. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

48. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

49. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

50. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

51. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

52. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

53. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

54. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

55. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

56. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

57. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

58. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

59. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

60. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

61. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

62. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

63. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

64. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

65. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

66. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

67. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

68. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

69. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

70. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

71. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

72. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

73. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

74. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

75. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

76. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

77. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

78. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

79. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

80. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
81. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

82. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

83. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

84. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

85. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

86. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

87. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

88. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

89. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

90. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

91. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

92. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

93. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

94. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

95. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

96. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

97. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

98. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

99. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

100. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

101. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

102. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

103. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

104. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

105. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

106. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

107. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

108. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

109. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

110. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

111. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

112. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

113. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

114. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

115. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
116. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

117. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

118. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

119. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

120. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

121. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

122. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

123. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

124. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

125. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

126. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

127. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

128. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

129. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

130. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

131. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

132. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

133. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

134. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

135. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

136. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

137. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

138. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

139. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

140. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

141. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

142. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

143. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

144. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

145. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

146. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

147. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

148. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

149. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

150. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
151. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

152. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

153. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

154. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

155. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

156. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

157. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

158. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

159. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

160. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

161. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

162. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

163. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

164. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

165. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

166. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

167. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

168. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

169. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

170. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

171. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

172. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

173. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

174. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

175. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

176. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

177. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

178. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

179. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

180. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

181. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

182. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

183. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

184. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

185. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
186. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

187. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

188. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

189. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

190. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

191. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

192. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

193. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

194. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

195. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

196. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

197. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

198. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

199. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

200. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

201. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

202. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

203. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

204. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

205. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

206. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

207. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

208. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

209. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

210. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

211. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

212. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

213. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

214. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

215. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

216. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

217. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

218. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

219. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

220. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
221. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

222. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

223. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

224. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

225. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

226. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

227. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

228. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

229. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

230. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

231. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

232. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

233. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

234. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

235. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

236. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

237. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

238. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

239. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

240. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

241. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

242. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

243. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

244. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

245. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

246. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

247. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

248. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

249. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

250. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

251. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

252. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

253. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

254. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

255. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
256. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

257. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

258. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

259. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

260. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

261. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

262. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

263. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

264. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

265. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

266. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

267. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

268. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

269. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

270. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

271. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

272. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

273. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

274. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

275. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

276. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

277. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

278. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

279. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

280. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

281. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

282. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

283. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

284. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

285. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

286. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

287. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

288. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

289. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

290. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
291. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

292. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

293. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

294. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

295. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

296. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

297. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

298. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

299. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

300. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

301. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

302. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

303. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

304. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

305. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

306. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

307. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

308. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

309. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

310. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

311. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

312. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

313. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

314. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

315. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

316. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

317. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

318. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

319. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

320. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

321. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

322. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

323. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

324. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

325. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
326. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

327. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

328. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

329. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

330. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

331. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

332. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

333. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

334. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

335. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

336. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

337. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

338. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

339. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

340. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

341. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

342. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

343. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

344. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

345. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

346. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

347. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

348. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

349. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

350. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

351. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

352. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

353. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

354. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

355. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

356. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

357. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

358. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

359. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

360. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
361. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

362. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

363. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

364. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

365. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

366. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

367. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

368. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

369. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

370. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

371. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

372. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

373. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

374. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

375. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

376. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

377. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

378. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

379. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

380. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

381. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

382. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

383. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

384. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

385. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

386. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

387. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

388. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

389. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

390. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

391. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

392. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

393. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

394. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

395. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
396. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

397. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

398. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

399. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

400. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

401. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

402. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

403. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

404. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

405. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

406. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

407. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

408. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

409. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

410. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

411. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

412. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

413. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

414. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

415. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

416. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

417. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

418. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

419. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

420. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

421. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

422. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

423. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

424. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

425. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

426. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

427. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

428. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

429. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

430. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
431. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

432. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

433. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

434. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

435. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

436. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

437. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

438. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

439. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

440. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

441. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

442. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

443. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

444. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

445. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

446. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

447. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

448. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

449. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

450. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

451. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

452. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

453. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

454. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

455. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

456. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

457. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

458. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

459. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

460. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

461. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

462. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

463. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

464. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

465. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
466. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

467. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

468. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

469. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

470. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

471. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

472. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

473. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

474. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

475. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

476. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

477. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

478. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

479. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

480. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

481. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

482. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

483. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

484. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

485. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

486. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

487. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

488. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

489. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

490. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

491. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

492. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

493. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

494. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

495. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

496. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

497. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

498. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

499. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

500. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)
Linked Lists

501. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

502. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

503. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

504. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

505. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

506. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

507. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

508. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

509. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

510. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

511. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
512. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

513. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

514. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

515. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

516. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

517. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

518. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

519. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

520. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

521. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

522. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

523. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

524. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

525. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

526. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

527. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

528. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

529. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

530. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

531. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

532. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

533. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

534. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

535. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

536. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

537. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

538. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

539. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

540. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

541. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

542. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

543. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

544. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

545. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

546. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
547. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

548. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

549. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

550. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

551. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

552. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

553. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

554. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

555. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

556. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

557. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

558. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

559. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

560. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

561. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

562. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

563. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

564. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

565. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

566. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

567. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

568. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

569. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

570. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

571. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

572. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

573. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

574. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

575. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

576. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

577. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

578. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

579. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

580. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

581. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
582. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

583. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

584. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

585. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

586. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

587. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

588. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

589. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

590. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

591. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

592. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

593. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

594. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

595. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

596. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

597. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

598. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

599. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

600. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

601. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

602. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

603. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

604. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

605. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

606. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

607. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

608. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

609. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

610. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

611. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

612. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

613. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

614. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

615. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

616. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
617. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

618. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

619. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

620. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

621. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

622. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

623. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

624. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

625. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

626. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

627. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

628. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

629. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

630. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

631. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

632. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

633. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

634. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

635. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

636. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

637. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

638. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

639. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

640. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

641. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

642. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

643. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

644. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

645. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

646. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

647. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

648. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

649. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

650. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

651. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
652. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

653. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

654. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

655. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

656. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

657. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

658. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

659. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

660. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

661. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

662. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

663. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

664. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

665. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

666. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

667. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

668. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

669. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

670. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

671. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

672. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

673. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

674. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

675. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

676. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

677. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

678. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

679. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

680. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

681. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

682. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

683. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

684. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

685. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

686. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
687. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

688. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

689. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

690. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

691. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

692. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

693. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

694. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

695. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

696. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

697. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

698. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

699. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

700. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

701. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

702. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

703. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

704. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

705. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

706. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

707. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

708. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

709. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

710. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

711. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

712. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

713. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

714. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

715. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

716. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

717. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

718. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

719. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

720. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

721. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
722. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

723. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

724. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

725. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

726. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

727. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

728. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

729. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

730. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

731. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

732. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

733. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

734. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

735. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

736. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

737. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

738. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

739. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

740. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

741. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

742. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

743. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

744. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

745. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

746. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

747. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

748. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

749. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

750. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

751. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

752. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

753. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

754. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

755. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

756. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
757. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

758. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

759. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

760. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

761. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

762. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

763. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

764. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

765. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

766. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

767. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

768. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

769. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

770. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

771. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

772. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

773. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

774. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

775. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

776. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

777. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

778. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

779. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

780. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

781. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

782. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

783. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

784. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

785. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

786. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

787. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

788. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

789. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

790. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

791. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
792. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

793. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

794. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

795. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

796. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

797. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

798. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

799. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

800. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

801. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

802. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

803. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

804. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

805. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

806. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

807. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

808. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

809. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

810. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

811. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

812. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

813. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

814. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

815. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

816. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

817. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

818. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

819. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

820. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

821. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

822. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

823. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

824. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

825. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

826. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
827. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

828. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

829. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

830. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

831. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

832. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

833. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

834. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

835. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

836. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

837. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

838. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

839. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

840. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

841. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

842. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

843. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

844. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

845. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

846. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

847. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

848. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

849. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

850. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

851. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

852. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

853. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

854. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

855. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

856. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

857. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

858. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

859. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

860. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

861. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
862. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

863. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

864. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

865. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

866. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

867. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

868. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

869. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

870. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

871. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

872. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

873. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

874. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

875. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

876. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

877. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

878. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

879. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

880. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

881. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

882. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

883. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

884. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

885. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

886. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

887. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

888. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

889. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

890. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

891. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

892. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

893. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

894. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

895. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

896. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
897. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

898. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

899. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

900. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

901. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

902. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

903. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

904. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

905. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

906. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

907. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

908. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

909. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

910. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

911. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

912. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

913. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

914. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

915. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

916. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

917. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

918. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

919. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

920. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

921. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

922. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

923. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

924. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

925. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

926. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

927. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

928. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

929. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

930. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

931. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
932. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

933. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

934. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

935. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

936. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

937. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

938. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

939. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

940. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

941. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

942. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

943. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

944. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

945. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

946. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

947. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

948. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

949. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

950. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

951. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

952. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

953. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

954. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

955. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

956. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

957. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

958. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

959. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

960. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

961. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

962. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

963. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

964. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

965. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

966. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue
967. Which traversal method is used in Depth First Search (DFS)?
a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

968. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

969. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

970. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

971. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

972. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

973. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

974. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

975. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

976. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

977. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

978. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

979. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

980. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

981. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

982. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

983. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

984. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

985. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

986. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

987. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

988. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

989. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

990. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

991. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

992. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

993. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

994. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

995. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

996. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

997. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

998. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

999. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1000. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

Stacks and Queues

1001. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1002. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1003. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1004. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1005. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1006. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1007. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1008. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1009. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1010. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1011. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1012. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1013. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1014. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1015. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1016. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1017. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1018. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1019. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1020. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1021. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1022. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1023. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1024. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1025. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1026. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1027. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1028. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1029. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1030. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1031. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1032. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1033. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1034. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1035. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1036. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1037. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1038. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1039. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1040. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1041. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1042. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1043. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1044. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1045. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1046. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1047. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1048. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1049. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1050. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1051. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1052. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1053. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1054. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1055. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1056. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1057. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1058. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1059. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1060. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1061. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1062. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1063. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1064. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1065. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1066. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1067. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1068. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1069. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1070. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1071. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1072. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1073. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1074. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1075. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1076. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1077. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1078. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1079. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1080. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1081. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1082. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1083. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1084. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1085. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1086. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1087. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1088. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1089. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1090. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1091. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1092. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1093. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1094. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1095. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1096. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1097. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1098. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1099. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1100. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1101. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1102. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1103. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1104. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1105. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1106. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1107. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1108. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1109. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1110. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1111. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1112. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1113. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1114. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1115. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1116. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1117. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1118. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1119. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1120. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1121. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1122. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1123. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1124. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1125. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1126. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1127. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1128. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1129. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1130. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1131. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1132. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1133. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1134. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1135. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1136. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1137. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1138. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1139. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1140. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1141. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1142. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1143. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1144. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1145. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1146. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1147. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1148. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1149. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1150. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1151. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1152. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1153. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1154. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1155. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1156. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1157. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1158. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1159. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1160. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1161. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1162. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1163. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1164. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1165. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1166. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1167. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1168. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1169. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1170. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1171. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1172. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1173. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1174. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1175. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1176. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1177. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1178. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1179. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1180. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1181. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1182. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1183. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1184. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1185. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1186. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1187. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1188. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1189. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1190. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1191. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1192. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1193. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1194. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1195. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1196. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1197. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1198. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1199. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1200. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1201. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1202. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1203. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1204. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1205. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1206. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1207. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1208. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1209. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1210. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1211. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1212. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1213. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1214. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1215. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1216. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1217. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1218. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1219. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1220. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1221. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1222. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1223. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1224. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1225. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1226. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1227. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1228. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1229. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1230. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1231. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1232. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1233. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1234. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1235. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1236. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1237. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1238. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1239. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1240. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1241. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1242. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1243. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1244. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1245. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1246. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1247. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1248. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1249. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1250. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1251. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1252. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1253. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1254. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1255. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1256. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1257. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1258. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1259. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1260. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1261. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1262. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1263. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1264. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1265. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1266. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1267. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1268. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1269. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1270. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1271. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1272. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1273. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1274. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1275. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1276. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1277. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1278. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1279. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1280. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1281. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1282. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1283. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1284. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1285. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1286. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1287. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1288. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1289. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1290. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1291. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1292. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1293. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1294. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1295. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1296. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1297. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1298. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1299. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1300. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1301. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1302. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1303. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1304. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1305. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1306. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1307. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1308. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1309. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1310. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1311. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1312. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1313. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1314. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1315. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1316. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1317. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1318. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1319. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1320. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1321. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1322. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1323. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1324. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1325. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1326. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1327. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1328. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1329. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1330. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1331. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1332. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1333. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1334. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1335. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1336. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1337. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1338. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1339. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1340. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1341. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1342. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1343. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1344. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1345. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1346. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1347. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1348. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1349. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1350. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1351. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1352. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1353. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1354. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1355. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1356. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1357. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1358. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1359. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1360. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1361. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1362. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1363. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1364. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1365. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1366. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1367. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1368. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1369. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1370. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1371. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1372. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1373. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1374. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1375. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1376. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1377. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1378. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1379. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1380. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1381. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1382. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1383. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1384. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1385. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1386. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1387. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1388. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1389. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1390. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1391. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1392. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1393. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1394. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1395. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1396. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1397. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1398. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1399. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1400. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1401. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1402. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1403. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1404. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1405. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1406. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1407. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1408. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1409. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1410. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1411. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1412. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1413. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1414. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1415. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1416. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1417. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1418. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1419. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1420. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1421. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1422. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1423. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1424. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1425. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1426. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1427. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1428. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1429. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1430. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1431. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1432. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1433. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1434. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1435. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1436. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1437. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1438. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1439. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1440. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1441. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1442. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1443. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1444. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1445. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1446. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1447. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1448. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1449. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1450. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1451. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1452. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1453. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1454. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1455. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1456. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1457. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1458. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1459. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1460. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1461. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1462. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1463. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1464. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1465. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1466. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1467. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder
1468. What is the worst-case time complexity of QuickSort?
a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1469. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1470. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1471. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1472. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1473. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1474. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1475. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1476. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1477. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1478. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1479. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1480. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1481. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1482. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1483. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1484. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1485. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1486. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1487. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1488. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1489. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1490. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1491. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1492. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1493. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1494. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1495. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1496. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1497. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1498. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1499. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1500. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

Trees

1501. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1502. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1503. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1504. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1505. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1506. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1507. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1508. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1509. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1510. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1511. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1512. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1513. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1514. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1515. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1516. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1517. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1518. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1519. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1520. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1521. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1522. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1523. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1524. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1525. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1526. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1527. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1528. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1529. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1530. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1531. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1532. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1533. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1534. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1535. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1536. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1537. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1538. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1539. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1540. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1541. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1542. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1543. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1544. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1545. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1546. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1547. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1548. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1549. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1550. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1551. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1552. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1553. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1554. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1555. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1556. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1557. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1558. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1559. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1560. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1561. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1562. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1563. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1564. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1565. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1566. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1567. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1568. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1569. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1570. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1571. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1572. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1573. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1574. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1575. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1576. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1577. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1578. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1579. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1580. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1581. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1582. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1583. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1584. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1585. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1586. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1587. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1588. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1589. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1590. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1591. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1592. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1593. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1594. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1595. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1596. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1597. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1598. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1599. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1600. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1601. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1602. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1603. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1604. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1605. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1606. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1607. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1608. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1609. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1610. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1611. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1612. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1613. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1614. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1615. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1616. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1617. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1618. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1619. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1620. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1621. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1622. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1623. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1624. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1625. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1626. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1627. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1628. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1629. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1630. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1631. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1632. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1633. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1634. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1635. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1636. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1637. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1638. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1639. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1640. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1641. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1642. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1643. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1644. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1645. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1646. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1647. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1648. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1649. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1650. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1651. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1652. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1653. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1654. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1655. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1656. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1657. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1658. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1659. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1660. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1661. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1662. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1663. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1664. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1665. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1666. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1667. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1668. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1669. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1670. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1671. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1672. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1673. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1674. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1675. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1676. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1677. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1678. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1679. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1680. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1681. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1682. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1683. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1684. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1685. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1686. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1687. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1688. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1689. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1690. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1691. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1692. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1693. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1694. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1695. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1696. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1697. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1698. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1699. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1700. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1701. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1702. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1703. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1704. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1705. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1706. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1707. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1708. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1709. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1710. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1711. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1712. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1713. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1714. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1715. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1716. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1717. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1718. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1719. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1720. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1721. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1722. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1723. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1724. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1725. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1726. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1727. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1728. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1729. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1730. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1731. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1732. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1733. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1734. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1735. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1736. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1737. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1738. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1739. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1740. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1741. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1742. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1743. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1744. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1745. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1746. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1747. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1748. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1749. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1750. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1751. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1752. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1753. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1754. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1755. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1756. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1757. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1758. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1759. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1760. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1761. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1762. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1763. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1764. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1765. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1766. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1767. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1768. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1769. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1770. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1771. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1772. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1773. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1774. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1775. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1776. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1777. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1778. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1779. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1780. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1781. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1782. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1783. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1784. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1785. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1786. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1787. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1788. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1789. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1790. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1791. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1792. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1793. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1794. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1795. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1796. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1797. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1798. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1799. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1800. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1801. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1802. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1803. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1804. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1805. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1806. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1807. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1808. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1809. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1810. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1811. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1812. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1813. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1814. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1815. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1816. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1817. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1818. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1819. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1820. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1821. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1822. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1823. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1824. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1825. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1826. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1827. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1828. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1829. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1830. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1831. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1832. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1833. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1834. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1835. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1836. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1837. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1838. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1839. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1840. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1841. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1842. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1843. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1844. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1845. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1846. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1847. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1848. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1849. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1850. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1851. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1852. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1853. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1854. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1855. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1856. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1857. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1858. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1859. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1860. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1861. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1862. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1863. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1864. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1865. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1866. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1867. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1868. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1869. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1870. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1871. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1872. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1873. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1874. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1875. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1876. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1877. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1878. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1879. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1880. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1881. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1882. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1883. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1884. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1885. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1886. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1887. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1888. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1889. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1890. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1891. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1892. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1893. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1894. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1895. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1896. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1897. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1898. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1899. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1900. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1901. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1902. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1903. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1904. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1905. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1906. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1907. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1908. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1909. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1910. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1911. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1912. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1913. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1914. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1915. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1916. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1917. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1918. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1919. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1920. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1921. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1922. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1923. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1924. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1925. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1926. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1927. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1928. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1929. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1930. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1931. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1932. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1933. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1934. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1935. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1936. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1937. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1938. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1939. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1940. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1941. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1942. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1943. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1944. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1945. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1946. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1947. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1948. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1949. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1950. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1951. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1952. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1953. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1954. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1955. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1956. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1957. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1958. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1959. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1960. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1961. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1962. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1963. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1964. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1965. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1966. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1967. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1968. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)
1969. What is the primary advantage of a hash table?
a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1970. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1971. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1972. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1973. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1974. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1975. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1976. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1977. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1978. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1979. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1980. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1981. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1982. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1983. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1984. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1985. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1986. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1987. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1988. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1989. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1990. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1991. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1992. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1993. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1994. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

1995. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

1996. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

1997. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

1998. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

1999. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2000. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

Graphs, Hashing, and Miscellaneous

2001. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2002. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2003. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2004. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2005. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2006. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2007. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2008. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2009. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2010. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2011. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2012. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2013. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2014. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2015. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2016. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2017. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2018. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2019. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2020. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2021. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2022. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2023. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2024. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2025. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2026. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2027. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2028. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2029. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2030. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2031. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2032. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2033. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2034. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2035. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2036. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2037. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2038. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2039. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2040. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2041. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2042. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2043. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2044. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2045. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2046. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2047. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2048. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2049. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2050. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2051. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2052. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2053. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2054. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2055. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2056. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2057. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2058. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2059. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2060. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2061. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2062. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2063. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2064. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2065. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2066. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2067. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2068. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2069. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2070. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2071. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2072. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2073. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2074. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2075. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2076. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2077. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2078. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2079. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2080. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2081. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2082. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2083. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2084. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2085. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2086. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2087. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2088. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2089. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2090. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2091. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2092. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2093. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2094. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2095. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2096. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2097. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2098. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2099. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2100. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2101. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2102. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2103. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2104. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2105. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2106. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2107. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2108. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2109. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2110. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2111. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2112. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2113. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2114. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2115. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2116. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2117. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2118. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2119. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2120. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2121. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2122. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2123. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2124. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2125. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2126. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2127. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2128. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2129. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2130. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2131. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2132. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2133. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2134. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2135. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2136. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2137. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2138. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2139. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2140. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2141. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2142. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2143. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2144. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2145. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2146. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2147. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2148. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2149. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2150. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2151. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2152. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2153. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2154. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2155. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2156. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2157. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2158. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2159. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2160. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2161. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2162. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2163. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2164. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2165. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2166. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2167. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2168. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2169. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2170. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2171. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2172. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2173. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2174. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2175. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2176. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2177. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2178. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2179. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2180. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2181. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2182. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2183. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2184. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2185. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2186. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2187. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2188. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2189. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2190. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2191. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2192. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2193. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2194. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2195. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2196. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2197. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2198. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2199. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2200. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2201. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2202. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2203. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2204. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2205. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2206. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2207. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2208. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2209. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2210. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2211. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2212. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2213. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2214. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2215. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2216. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2217. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2218. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2219. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2220. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2221. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2222. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2223. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2224. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2225. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2226. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2227. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2228. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2229. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2230. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2231. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2232. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2233. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2234. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2235. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2236. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2237. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2238. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2239. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2240. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2241. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2242. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2243. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2244. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2245. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2246. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2247. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2248. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2249. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2250. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2251. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2252. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2253. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2254. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2255. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2256. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2257. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2258. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2259. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2260. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2261. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2262. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2263. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2264. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2265. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2266. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2267. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2268. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2269. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2270. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2271. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2272. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2273. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2274. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2275. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2276. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2277. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2278. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2279. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2280. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2281. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2282. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2283. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2284. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2285. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2286. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2287. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2288. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2289. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2290. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2291. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2292. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2293. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2294. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2295. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2296. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2297. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2298. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2299. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2300. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2301. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2302. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2303. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2304. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2305. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2306. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2307. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2308. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2309. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2310. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2311. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2312. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2313. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2314. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2315. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2316. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2317. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2318. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2319. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2320. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2321. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2322. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2323. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2324. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2325. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2326. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2327. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2328. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2329. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2330. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2331. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2332. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2333. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2334. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2335. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2336. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2337. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2338. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2339. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2340. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2341. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2342. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2343. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2344. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2345. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2346. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2347. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2348. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2349. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2350. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2351. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2352. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2353. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2354. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2355. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2356. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2357. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2358. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2359. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2360. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2361. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2362. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2363. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2364. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2365. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2366. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2367. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2368. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2369. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2370. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2371. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2372. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2373. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2374. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2375. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2376. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2377. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2378. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2379. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2380. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2381. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2382. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2383. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2384. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2385. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2386. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2387. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2388. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2389. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2390. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2391. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2392. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2393. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2394. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2395. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2396. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2397. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2398. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2399. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2400. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2401. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2402. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2403. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2404. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2405. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2406. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2407. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2408. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2409. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2410. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2411. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2412. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2413. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2414. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2415. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2416. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2417. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2418. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2419. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2420. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2421. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2422. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2423. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2424. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2425. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2426. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2427. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2428. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2429. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2430. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2431. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2432. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2433. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2434. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2435. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2436. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2437. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2438. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2439. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2440. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2441. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2442. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2443. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2444. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2445. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2446. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2447. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2448. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2449. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2450. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2451. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2452. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2453. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2454. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2455. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2456. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2457. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2458. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2459. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2460. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2461. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2462. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2463. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2464. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2465. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2466. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2467. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2468. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2469. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching
2470. What is the time complexity of accessing an element in an array?
a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2471. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2472. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2473. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2474. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2475. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2476. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2477. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2478. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2479. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2480. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2481. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2482. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2483. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2484. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2485. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2486. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2487. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2488. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2489. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2490. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2491. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2492. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2493. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2494. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2495. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)

2496. Which data structure follows FIFO (First In, First Out) principle?
a) Stack b) Queue c) Linked List d) Tree
Answer: b) Queue

2497. Which traversal method is used in Depth First Search (DFS)?

a) Level order b) Preorder, Inorder, Postorder c) Breadth First d) None
Answer: b) Preorder, Inorder, Postorder

2498. What is the worst-case time complexity of QuickSort?

a) O(n) b) O(n log n) c) O(n²) d) O(log n)
Answer: c) O(n²)

2499. What is the primary advantage of a hash table?

a) Fast searching b) Less memory usage c) Ordered storage d) Simple implementation
Answer: a) Fast searching

2500. What is the time complexity of accessing an element in an array?

a) O(1) b) O(n) c) O(log n) d) O(n log n)
Answer: a) O(1)