Question
Computer Science Question on Stack
Match List-I with List-II:List-I (Term) | List-II (Description) |
---|---|
(A) Prefix | (I) In this, the element entered first will be removed last |
(B) Postfix | (II) In this, the element entered first will be removed first. |
(C) Queue | (III) In this, the operator is placed before the operands. |
(D) Stack | (IV) In this, the operator is placed after the operands. |
A
(A) - (III), (B) - (IV), (C) - (II), (D) - (I)
B
(A) - (IV), (B) - (III), (C) - (II), (D) - (I)
C
(A) - (I), (B) - (II), (C) - (IV), (D) - (III)
D
(A) - (II), (B) - (I), (C) - (III), (D) - (IV)
Answer
(A) - (III), (B) - (IV), (C) - (II), (D) - (I)
Explanation
Solution
Prefix notation places operators before operands, postfix places them after, queue follows FIFO, and stack follows LIFO.