Basic Data Structure in Data Structure

@T-Bone

This question paper focuses on the "Basic Data Structure" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

This question paper focuses on the "Basic Data Structure" of Data Structure. These Multiple Choice Questions (mcq) should be practiced to improve the Data Structure skills required for various interviews (campus interview, walk-in interview, company interview), placement, entrance exam and other competitive examinations.

Questions

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

5. What is true about Interface in data structure?

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

11. An algorithm should have _________ well-defined outputs

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

16. O(1) means computing time is __________________

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

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

Mark the correct option

25. The [] notation is

Mark the correct option

Index of Questions