Data Structure – DSN MARATHI

100+ MCQ Data Structure MCQ Page-10

91. …….. form of access is used to add and remove nodes from a queue. A. LIFO, Last In First

81. The easiest sorting is…….. A. quick sort B. shell sort C. heap sort D. selection sort Answer Option :

71. Which of the following is an external sorting? A. Insertion Sort B. Bubble Sort C. Merge Sort D. Tree

61. The list which has its own pointer is called…….. A. pointer list B. self pointer C. free pool D.

51. To insert a new node in linked list free node will be available in…….. A. Available list B. Avail

41. Each node in a linked list must contain at least ….. A. Three fields B. Two fields C. Four

31. A ……….. is a graph that has weights of costs associated with its edges. A. Network B. Weighted graph

21. The number of comparisons done by sequential search is ……………… A. (N/2)+1 B. (N+1)/2 C. (N-1)/2 D. (N+2)/2 Answer

11. Which of the following is not the type of queue? A. Ordinary queue B. Single ended queue C. Circular

1. Which if the following is/are the levels of implementation of data structure A. Abstract level B. Application level C.