Match the LIST-I with LIST-II LIST-I LIST-II A. Breadth First Search I. LISP…
2025
Match the LIST-I with LIST-II
LIST-I | LIST-II |
A. Breadth First Search | I. LISP |
B. Depth First Search | II. Syntax tree |
C. Prefix | III. Stack |
D. Infix | IV. Queue |
Choose the correct answer from the options given below:
Answer: D. A-IV, B-III, C-I, D-II — ConceptA matching question is solved by identifying the standard association for each item independently, then selecting the single mapping that contains all…
- A.
A-III, B-IV, C-I, D-II
- B.
A-III, B-IV, C-II, D-I
- C.
A-IV, B-II, C-III, D-I
- D.
A-IV, B-III, C-I, D-II
Attempted by 484 students.
Show answer & explanation
Correct answer: D
Concept
A matching question is solved by identifying the standard association for each item independently, then selecting the single mapping that contains all associations together.
Breadth-first traversal processes vertices level by level with a queue, while depth-first traversal follows a path and backtracks with a stack. Prefix notation places an operator before its operands and is characteristic of LISP expressions; infix expressions are represented structurally by syntax trees.
Application
List-I item | List-II match |
|---|---|
A. Breadth First Search | IV. Queue |
B. Depth First Search | III. Stack |
C. Prefix | I. LISP |
D. Infix | II. Syntax tree |
Contrast and cross-check
The mapping A-III, B-IV, C-I, D-II reverses the data structures used by breadth-first and depth-first traversal.
The mapping A-III, B-IV, C-II, D-I reverses both traversal structures and the notation associations.
The mapping A-IV, B-II, C-III, D-I keeps the queue association for breadth-first traversal but conflicts with the stack, LISP, and syntax-tree associations.
The mapping A-IV, B-III, C-I, D-II preserves all four independent associations.
Therefore, the complete matching is A-IV, B-III, C-I, D-II.
A video solution is available for this question — log in and enroll to watch it.