# Data Structure MCQ Questions

This section focuses on "basics" of Data Structure. These Multiple Choice Questions (MCQ) should be practiced to improve the Data Structure skills required for various interviews (campus interviews, walk-in interviews, company interviews), placements, entrance exams and other competitive examinations.

1. How many cases are there, which are used to compare various data structure's execution time in a relative manner?

View Answer

2. Which case of data structure operation takes maximum time?

View Answer

3. In Average case, if operation takes ƒ(n) time in execution, then m operations will take?

View Answer

4. __________ is a single elementary unit of information representing an attribute of an entity.

View Answer

5. What is true about Interface in data structure?

View Answer

6. Which of the following is not a Characteristics of a Data Structure?

View Answer

7. Which characteristics shows that running time or the execution time of operations of data structure must be as small as possible?

View Answer

8. Data items that cannot be divided are called as?

View Answer

9. Which of the following analysis known as theoretical analysis of an algorithm?

View Answer

10. Which of the following analysis known as empirical analysis of an algorithm?

View Answer

11. O(1) means computing time is __________________

View Answer

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

View Answer

13. Which of the following sorting algorithm is of divide-and-conquer type?

View Answer

14. The time factor when determining the efficiency of algorithm is measured by?

View Answer

15. In an array representation of binary tree the right child of root will be at location of?

View Answer

16. The upper bound on the time complexity of the nondeterministic
sorting algorithm is?

View Answer

17. In analysis of algorithm, approximate relationship between the size of the job and the amount of work required to do is expressed by using _________.

View Answer

18. What is the type of the algorithm used in solving the 8 Queens problem?

View Answer

19. Which of the following belongs to the algorithm paradigm?

View Answer

20. The [] notation is

View Answer

21. An algorithm should have _________ well-defined outputs

View Answer

22. __________ of an algorithm represents the amount of memory space required by the algorithm in its life cycle.

View Answer

23. The space required by an algorithm is equal to the sum of the following _______ components.

View Answer

24. Which is the formal way to express the upper bound of an algorithm's running time.

View Answer

25. The Omega notation is the formal way to express the __________ of an algorithms running time.

View Answer

Discussion