# Data Structure MCQ SET-4

Data Structure MCQ Questions with Answer In this set we cover all the topic of Data structure like Array, Linked List, Stack, Queue, Tree ,Graph , Time complexity and Space complex complexity of different data structure, Sorting, Searching, Heap etc.

1. Which of the following points is/are true about linked list data structure when it is compared with array ?

2. In the worst case, a binary search tree will take how much time to search an element ?

3. What is the space complexity for deleting a linked list?

4. The situation when in a linked list START-NULL is

5. What would be the asymoptotic time complexity to add a node at the end of singly linked list, if the pointer is initially pointing to the head of the list ?

##### Data Structure MCQ

6. What kind of linked list is best to answer question like
*What is the item at position n*?

7. A variation of linked list is cirular linked list, in which the last node in the list points to first node of the list. One problem with this type of list is

8. Each node in a linked list must contain at least

9. A linear list in which the last node points to the first node is

10. In a linked list, insertion can be done as

##### Data Structure MCQ

11. What is the worst case run-time complexity of binary search algorithm?

12. push() and pop() functions are found in

13. Binary search tree has average case run-time complexity of O(log n). What could be the worst case ?

14. What will be the running-time of Dijkstra’s single-source shortest path algorithm, if the graph G(V,E) is stored in the form of adjacency list and binary heap is used?

15. Tower of Hanoi is a classic example of

##### Data Structure MCQ

16. If locality is a concern, you can use ______ to traverse the graph.

17. Which data structure is used for balancing of symbols?

18. Which data structure is most efficient to find the top 10 largest items out of 1 million items stored in file?

19. A data structure is required for storing a set of integers such that each of the following operations can be done in (log n) time, where n is the number of elements in the set :

• Deletion of the smallest element
• Insertion of an element if it is not already present in the set

• Which of the following can be used?

20. The most appropriate matching for the following pairs is