Data Structure Algorithms Online Test - 2

14. Which of the following data structure can’t store the non-homogeneous data elements?

a. Arrays
b. Records   
c. Pointers   
d. None

Answer: a. Arrays

15. Which data structure allows elements adding or removing at either end but not in the middle?

a. Linked lists   
b. Queues       
c. Deque
d. Stacks

Answer: c. Deque

16. The situation when a pop operation is attempted on an empty stack or linked list is called as

a. Underflow
b. Overflow   
c. Houseful   
d. Saturated

Answer: a. Underflow

17. An array is suitable for homogeneous data but the data items in a record may have different data type   

a. True
b. False

Answer: a. True

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

a. Arrays   
b. Linked list   
c. Queue
d. Binary tree

Answer: d. Binary tree

19. When we try to push more items on a stack than it can hold, this situation is usually called

a. Underflow   
b. Overflow
c. Housefull   
d. Saturated

Answer: b. Overflow

20. Arrays are dense lists and static data structure   

a. True
b. False

Answer: a. True

21. Linked lists are collection of the nodes that contain information part and next pointer

a. True
b. False

Answer: a. True

22. Two main measures of the efficiency of an algorithm are

a. Processor and memory   
b. Complexity and capacity   
c. Time and space
d. Data and space

Answer: c. Time and space

23. Can we apply Binary search algorithm to Sorted linked list?

a. Yes
b. No

Answer: b. No

24. Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?

a. Post-order   
b. In-order
c. Pre-order   
d. None of the above

Answer: b. In-order

25. The number of possible binary trees with 3 nodes is

a. 12   
b. 13   
c. 5
d. 15

Answer: c. 5

26. Divide and conquer strategy is used in Merge sort

a. True
b. False

Answer: a. True

27. How many modifications required to insert a record in a circularly linked list?

a. no pointer   
b. 1 pointer   
c. 2 pointers
d. 3 pointers

Answer: c. 2 pointers