Which data structure is most suitable for implementing recursion?
Difficulty: Easy
About this MCQ
This Easy Data Structures MCQ checks one syllabus fact.
The question is: “Which data structure is most suitable for implementing recursion?”
The accepted answer is B. Stack. Stack is the person, body, or term that satisfies “Which data structure is most suitable for implementing recursion” (option B). Option A (“Queue”) does not match the stem; it is a near-miss used to catch incomplete recall of Stack. Option C (“Heap”) does not match the stem; it is a near-miss used to catch incomplete recall of Stack. Remaining alternatives (Graph) fall outside the same rule and should be eliminated once Stack is identified. Data Structures questions of this type reward precise definitions rather than approximate associations. Data Structures recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
- A. Queue
Why not A: “Queue” is not correct. The accepted answer is B. Stack. Stack is the person, body, or term that satisfies “Which data structure is most suitable for implementing recursion” (option B). Option A (“Queue”) does not match the stem; it is a
- B. Stack ✓
- C. Heap
Why not C: “Heap” is not correct. The accepted answer is B. Stack. Stack is the person, body, or term that satisfies “Which data structure is most suitable for implementing recursion” (option B). Option A (“Queue”) does not match the stem; it is a
- D. Graph
Why not D: “Graph” is not correct. The accepted answer is B. Stack. Stack is the person, body, or term that satisfies “Which data structure is most suitable for implementing recursion” (option B). Option A (“Queue”) does not match the stem; it is a
Correct answer
B. Stack
Explanation
Stack is the person, body, or term that satisfies “Which data structure is most suitable for implementing recursion” (option B). Option A (“Queue”) does not match the stem; it is a near-miss used to catch incomplete recall of Stack. Option C (“Heap”) does not match the stem; it is a near-miss used to catch incomplete recall of Stack. Remaining alternatives (Graph) fall outside the same rule and should be eliminated once Stack is identified. Data Structures questions of this type reward precise definitions rather than approximate associations. Data Structures recall of this distinction is a regular item in FPSC, PPSC, NTS, and CSS papers.
Source: Computer Science Reference Guide
Tags: data structures, stack, recursion
Submitted by: MCQsHub Editorial
Related MCQs
- Sample Computer Science MCQ #486: Which option is correct regarding Data Structures?
- Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle?
- What does Stack refer to?
- What is the name for a linear data structure that follows the First-In-First-Out (FIFO) principle?
- Which of the following best describes Queue?
- Identify the correct concept described as: a data structure where elements are stored in nodes, each pointing...