Branch Wise MCQComputer Science McqsData Structure 100+ MCQ Data Structure MCQ Page-10 January 26, 2025 DSN MARATHI 91. …….. form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these Answer Option : B 92. ……. form of access is used to add remove nodes from a stack. A. LIFO B. FIFO C. Both A and B D. None of these Answer Option : A 93. What happens when you push a new node onto a stack? A. The new node is placed at the front of the linked list B. The new node is placed at the back of the linked list C. The new node is placed at the middle of the linked list D. No Changes happens Answer Option : A 94. The term push and pop is related to A. Array B. Lists C. Stacks D. Trees Answer Option : C 95. The elements are removal from a stack in ………. order. A. Reverse B. Hierarchical C. Alternative D. Sequential Answer Option : A 96. A pointer variable which contains the location at the top element of the stack is called….. A. Top B. Last C. Final D. End Answer Option : A 97. Before inserting into stack one must check the condition……… A. Overflow B. Underflow C. Maximum elements D. Existing elements Answer Option : B 98. When does Top value of stack change in insertion process? A. Before insertion B. After insertion C. At the time of insertion D. While checking overflow Answer Option : A 99. The term dequeue is the contraction of the name…….. A. Double ended queue B. Double side queue C. Double headed queue D. Double address queue Answer Option : A 100. ………. is a collection of elements such that each element has been assigned a processing priority. A. Priority queue B. Procedure queue C. Main queue D. Interrupt queue Answer Option : A
91. …….. form of access is used to add and remove nodes from a queue. A. LIFO, Last In First Out B. FIFO, First In First Out C. Both a and b D. None of these Answer Option : B
92. ……. form of access is used to add remove nodes from a stack. A. LIFO B. FIFO C. Both A and B D. None of these Answer Option : A
93. What happens when you push a new node onto a stack? A. The new node is placed at the front of the linked list B. The new node is placed at the back of the linked list C. The new node is placed at the middle of the linked list D. No Changes happens Answer Option : A
95. The elements are removal from a stack in ………. order. A. Reverse B. Hierarchical C. Alternative D. Sequential Answer Option : A
96. A pointer variable which contains the location at the top element of the stack is called….. A. Top B. Last C. Final D. End Answer Option : A
97. Before inserting into stack one must check the condition……… A. Overflow B. Underflow C. Maximum elements D. Existing elements Answer Option : B
98. When does Top value of stack change in insertion process? A. Before insertion B. After insertion C. At the time of insertion D. While checking overflow Answer Option : A
99. The term dequeue is the contraction of the name…….. A. Double ended queue B. Double side queue C. Double headed queue D. Double address queue Answer Option : A
100. ………. is a collection of elements such that each element has been assigned a processing priority. A. Priority queue B. Procedure queue C. Main queue D. Interrupt queue Answer Option : A
