Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle?
Difficulty: Easy
About this MCQ
This Easy Data Structures MCQ checks one syllabus fact.
The question is: “Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle?”
The accepted answer is D. Stack. Stack is the person, body, or term that satisfies “Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle” (option D). Option A (“Trie”) does not match the stem; it is a near-miss used to catch incomplete recall of Stack. Option B (“Binary search tree”) 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. Trie
Why not A: “Trie” is not correct. The accepted answer is D. Stack. Stack is the person, body, or term that satisfies “Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle” (option D). Option A (“Trie”) d
- B. Binary search tree
Why not B: “Binary search tree” is not correct. The accepted answer is D. Stack. Stack is the person, body, or term that satisfies “Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle” (option D). Option A (“Trie”) d
- C. Graph
Why not C: “Graph” is not correct. The accepted answer is D. Stack. Stack is the person, body, or term that satisfies “Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle” (option D). Option A (“Trie”) d
- D. Stack ✓
Correct answer
D. Stack
Explanation
Stack is the person, body, or term that satisfies “Which term refers to a linear data structure that follows the Last-In-First-Out (LIFO) principle” (option D). Option A (“Trie”) does not match the stem; it is a near-miss used to catch incomplete recall of Stack. Option B (“Binary search tree”) 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: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- 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...
- Linked list is best defined as which of the following?
- A tree data structure in which each node has at most two children. What is this concept called?
- Choose the correct description of Binary tree.