Branch Wise MCQComputer Science McqsData Structure Data Structure MCQ Page-03 January 26, 2025 DSN MARATHI 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 Option : B 22. In ……………, search start at the beginning of the list and check every element in the list. A. Linear search B. Binary search C. Hash Search D. Binary Tree search Answer Option : A 23. Which of the following is not the internal sort A. Insertion Sort B. Bubble Sort C. Merge Sort D. Heap Sort Answer Option : C 24. In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A. 0 and 1 B. 0 and -1 C. -1 and 0 D. 1 and 0 Answer Option : B 25. In a circular queue the value of r will be .. A. r=r+1 B. r=(r+1)% [QUEUE_SIZE – 1] C. r=(r+1)% QUEUE_SIZE D. r=(r-1)% QUEUE_SIZE Answer Option : C 26. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A. Lists B. Linked Lists C. Trees D. Queues Answer Option : B 27. What will be the value of top, if there is a size of stack STACK_SIZE is 5 A. 5 B. 6 C. 4 D. None Answer Option : C 28. ………… is not the operation that can be performed on queue A. Insertion B. Deletion C. Retrieval D. Traversal Answer Option : D 29. There is an extra element at the head of the list called a ………. A. Antinel B. Sentinel C. List header D. List head Answer Option : B 30. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A. vertices, edges B. edges, vertices C. vertices, paths D. graph node, edges Answer Option : A
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 Option : B
22. In ……………, search start at the beginning of the list and check every element in the list. A. Linear search B. Binary search C. Hash Search D. Binary Tree search Answer Option : A
23. Which of the following is not the internal sort A. Insertion Sort B. Bubble Sort C. Merge Sort D. Heap Sort Answer Option : C
24. In a queue, the initial values of front pointer f rare pointer r should be ….. and …….. respectively. A. 0 and 1 B. 0 and -1 C. -1 and 0 D. 1 and 0 Answer Option : B
25. In a circular queue the value of r will be .. A. r=r+1 B. r=(r+1)% [QUEUE_SIZE – 1] C. r=(r+1)% QUEUE_SIZE D. r=(r-1)% QUEUE_SIZE Answer Option : C
26. The advantage of …………….. is that they solve the problem if sequential storage representation. But disadvantage in that is they are sequential lists. A. Lists B. Linked Lists C. Trees D. Queues Answer Option : B
27. What will be the value of top, if there is a size of stack STACK_SIZE is 5 A. 5 B. 6 C. 4 D. None Answer Option : C
28. ………… is not the operation that can be performed on queue A. Insertion B. Deletion C. Retrieval D. Traversal Answer Option : D
29. There is an extra element at the head of the list called a ………. A. Antinel B. Sentinel C. List header D. List head Answer Option : B
30. A graph is a collection of nodes, called ………. And line segments called arcs or ……….. that connect pair of nodes. A. vertices, edges B. edges, vertices C. vertices, paths D. graph node, edges Answer Option : A
