MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 4 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. |
The prefix form of an infix expression (p + q) (r * t) is? |
| A. | + pq *rt |
| B. | +pqr * t |
| C. | +pq * rt |
| D. | + * pqrt |
| Answer» D. + * pqrt | |
| 2. |
What is the result of the following operation?Top (Push (S, X)) |
| A. | X |
| B. | X+S |
| C. | S |
| D. | XS |
| Answer» B. X+S | |
| 3. |
What data structure would you mostly likely see in non recursive implementation of a recursive algorithm? |
| A. | Linked List |
| B. | Stack |
| C. | Queue |
| D. | Tree |
| Answer» C. Queue | |
| 4. |
The data structure required to check whether an expression contains a balanced parenthesis is? |
| A. | Stack |
| B. | Queue |
| C. | Array |
| D. | Tree |
| Answer» B. Queue | |