Top 50+ Solved Linear Data Structures -Stacks and Queues MCQ Questions Answer
Q. In a stack, if a user tries to remove an element from empty stack it is called
a. Underflow
b. Empty collection
c. Overflow
d. Garbage Collection
Q. Pushing an element into stack already having five elements and stack size of 5, then stack becomes
a. Overflow
b. Crash
c. Underflow
d. User flow
Q. Entries in a stack are “ordered”. What is the meaning of this statement?
a. A collection of stacks is sortable
b. Stack entries may be compared with the ‘<‘ operation
c. The entries are stored in a linked list
d. There is a Sequential entry that is one by one
Q. Which of the following is not the application of stack?
a. A parentheses balancing program
b. Tracking of local variables at run time
c. Compiler Syntax Analyzer
d. Data Transfer between two asynchronous process
Q. The postfix form of the expression (A+ B)*(C*D- E)*F / G is?
a. AB+ CD*E – FG /**
b. AB + CD* E – F **G /
c. AB + CD* E – *F *G /
d. AB + CDE * – * F *G /
Q. The data structure required to check whether an expression contains balanced parenthesis is?
a. Stack
b. Queue
c. Array
d. Tree
Q. What data structure would you mostly likely see in a non recursive implementation of a recursivealgorithm?
a. Linked List
b. Stack
c. Queue
d. Tree
Q. The process of accessing data stored in a serial access memory is similar to manipulating data on a
a. Heap
b. Binary Tree
c. Array
d. Stack
Q. Which data structure is needed to convert infix notation to postfix notation?
a. Branch
b. Tree
c. Queue
d. Stack