Question
QUESTION 1 STL stack uses deque to implement stack True False QUESTION 2 Nested function calls form a stack True False QUESTION 3 The result
QUESTION 1
STL stack uses deque to implement stack
True
False
QUESTION 2
Nested function calls form a stack
True
False
QUESTION 3
The result evaluating the postfix expression 10 5 + 60 6 / * 8 is
A. | 284 | |
B. | 213 | |
C. | 142 | |
D. | 71 | |
E. | None of the above. |
QUESTION 4
Which of the following statements about stacks is incorrect?
A. | Stacks can be implemented using linked lists. | |
B. | Stacks are first-in, first-out (FIFO) data structures. | |
C. | New nodes can only be added to the top of the stack. | |
D. | The last node (at the bottom) of a stack has a null (0) link. | |
E. | None of the above. |
QUESTION 5
Assume that the operators +, -, are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix expression a + b c d ^ e ^ f is:
A. | abc + def ^ ^ | |
B. | abc + de ^ f ^ | |
C. | ab + c d e ^ f ^ | |
D. | + a bc ^ ^ def | |
E. | None of the above. |
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started