Question

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) - (III), (B) - (IV), (C) - (II), (D) - (I)
• (A) - (IV), (B) - (III), (C) - (II), (D) - (I)
• (A) - (I), (B) - (II), (C) - (IV), (D) - (III)
• (A) - (II), (B) - (I), (C) - (III), (D) - (IV)

Answer 1

The Correct Option is A

To correctly associate List-I items with List-II items, we will define each term:

1. Prefix notation, or Polish notation, places the operator before the operands. Therefore, (A) Prefix aligns with (III).
2. Postfix notation, also known as Reverse Polish notation, places the operator after the operands. Accordingly, (B) Postfix matches with (IV).
3. A Queue is a linear data structure adhering to the First In First Out (FIFO) principle, meaning the first element added is the first element removed. Consequently, (C) Queue corresponds to (II).
4. A Stack is a linear data structure operating on the Last In First Out (LIFO) principle, where the first element added is the last element removed. Thus, (D) Stack is matched with (I).

The definitive pairings are: (A) - (III), (B) - (IV), (C) - (II), (D) - (I)