MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 6 Mcqs, each offering curated multiple-choice questions to sharpen your Data Structure knowledge and support exam preparation. Choose a topic below to get started.
| 1. |
Here is an infix expression: 4 + 3*(6*3-12). Suppose that we are using the usual stack algorithm to convert the expression from infix to postfix notation. The maximum number of symbols that will appear on the stack AT ONE TIME during the conversion of this expression? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 |
| Answer» E. | |
| 2. |
What is the value of the postfix expression 6 3 2 4 + *? |
| A. | 1 |
| B. | 40 |
| C. | 74 |
| D. | -18 |
| Answer» E. | |
| 3. |
Consider the usual algorithm for determining whether a sequence of parentheses is balanced. The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes: (()(())(()))? |
| A. | 1 |
| B. | 2 |
| C. | 3 |
| D. | 4 or more |
| Answer» D. 4 or more | |
| 4. |
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 |
| Answer» E. | |
| 5. |
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 |
| Answer» B. Crash | |
| 6. |
In a stack, if a user tries to remove an element from an empty stack it is called _________ |
| A. | Underflow |
| B. | Empty collection |
| C. | Overflow |
| D. | Garbage Collection |
| Answer» B. Empty collection | |