Capgemini Data Structure MCQs with Answers (150

Questions)

1. Which data structure uses LIFO (Last In First Out) order?

a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

2. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

3. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

4. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

5. What is the time complexity of binary search algorithm?

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

6. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b
7. Which of the following is an example of non-primitive data structure?
a) Integer
b) Float
c) Linked List
d) Character
Answer: c

8. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

9. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

10. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

11. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

12. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

13. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c
14. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

15. What is the time complexity of binary search algorithm?

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

16. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

17. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

18. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

19. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

20. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

21. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

22. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

23. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

24. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

25. What is the time complexity of binary search algorithm?

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

26. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

27. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

28. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

29. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

30. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

31. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

32. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

33. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c
34. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

35. What is the time complexity of binary search algorithm?

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

36. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

37. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

38. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

39. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

40. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a
41. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

42. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

43. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

44. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

45. What is the time complexity of binary search algorithm?

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

46. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

47. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

48. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

49. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

50. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

51. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

52. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

53. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

54. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

55. What is the time complexity of binary search algorithm?

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

56. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

57. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

58. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

59. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

60. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a
61. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

62. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

63. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

64. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

65. What is the time complexity of binary search algorithm?

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

66. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

67. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c
68. Which of these is used to represent hierarchical data?
a) Stack
b) Queue
c) Tree
d) Array
Answer: c

69. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

70. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

71. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

72. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

73. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

74. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

75. What is the time complexity of binary search algorithm?

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

76. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

77. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

78. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

79. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

80. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

81. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

82. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

83. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

84. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

85. What is the time complexity of binary search algorithm?

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

86. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

87. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c
88. Which of these is used to represent hierarchical data?
a) Stack
b) Queue
c) Tree
d) Array
Answer: c

89. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

90. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

91. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

92. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

93. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

94. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b
95. What is the time complexity of binary search algorithm?
a) O(n)
b) O(log n)
c) O(n log n)
d) O(1)
Answer: b

96. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

97. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

98. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

99. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

100. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

101. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

102. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

103. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

104. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

105. What is the time complexity of binary search algorithm?

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

106. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

107. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

108. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

109. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

110. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

111. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

112. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

113. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

114. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b
115. What is the time complexity of binary search algorithm?
a) O(n)
b) O(log n)
c) O(n log n)
d) O(1)
Answer: b

116. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

117. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

118. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

119. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

120. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

121. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b
122. Which of the following is not a linear data structure?
a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

123. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

124. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

125. What is the time complexity of binary search algorithm?

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

126. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

127. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

128. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

129. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

130. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

131. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b

132. Which of the following is not a linear data structure?

a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

133. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

134. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

135. What is the time complexity of binary search algorithm?

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

136. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

137. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

138. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c

139. In a circular queue, if FRONT = REAR, then the queue is:

a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

140. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a

141. Which data structure uses LIFO (Last In First Out) order?
a) Queue
b) Stack
c) Linked List
d) Tree
Answer: b
142. Which of the following is not a linear data structure?
a) Array
b) Linked List
c) Graph
d) Queue
Answer: c

143. In which data structure elements are inserted and deleted from both ends?
a) Stack
b) Queue
c) Deque
d) Tree
Answer: c

144. Which traversal technique is used in a binary search tree to get sorted order elements?
a) Preorder
b) Inorder
c) Postorder
d) Level order
Answer: b

145. What is the time complexity of binary search algorithm?

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

146. Which data structure is used in implementing recursion?

a) Queue
b) Stack
c) Tree
d) Graph
Answer: b

147. Which of the following is an example of non-primitive data structure?

a) Integer
b) Float
c) Linked List
d) Character
Answer: c

148. Which of these is used to represent hierarchical data?

a) Stack
b) Queue
c) Tree
d) Array
Answer: c
149. In a circular queue, if FRONT = REAR, then the queue is:
a) Empty
b) Full
c) Overflow
d) Underflow
Answer: b

150. Which algorithm technique does Quick Sort use?

a) Divide and Conquer
b) Greedy
c) Dynamic Programming
d) Backtracking
Answer: a