Introduction To Data Structures - Study Mode
[#46] Assume that the operators +,-, x are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x, +, -. The postfix expression for the infix expression a + b x c - d ^ e ^ f is?
Correct Answer
(A) a b c x + d e f ^ ^ -
[#47] The essential condition which is checked before insertion in a linked queue is?
Correct Answer
(B) Overflow
[#48] What is a memory efficient double linked list?
Correct Answer
(A) Each node has only one pointer to traverse the list back and forth
[#49] The prefix form of A-B/ (C * D ^ E) is?
Correct Answer
(C) -A/B*C^DE
[#50] In case of insertion into a linked queue, a node borrowed from the . . . . . . . . list is inserted in the queue.
Correct Answer
(A) AVAIL