Data Structure Test 1 Online MCQs

1. The complexity of Bubble sort algorithm is

2. Two main measures for the efficiency of an algorithm are

3. The complexity of linear search algorithm is

4. Which data structure allows deleting data elements from front and inserting at rear?

5. Identify the data structure which allows deletions at both ends of the list but insertion at only one end.

6. The operation of processing each element in the list is known as

7. Which of the following data structure is not linear data structure?

8. Finding the location of the element with a given value is:

9. Which of the following data structure is non-linear type?

10. Which of the following sorting algorithms has average-case and worst-case running time of O (n log n)?

11. A binary tree whose every node has either zero or two children is called

12. Which of the following case does not exist in complexity theory?

13. The space factor when determining the efficiency of algorithm is measured by

14. The indirect change of the values of a variable in one module by another module is called

15. Arrays are best data structures