What does Stack refer to?
Difficulty: Easy
About this MCQ
This Easy Data Structures question asks: What does Stack refer to? The correct choice is B. A linear data structure that follows the Last-In-First-Out (LIFO) principle.. Read the options below, commit to one, then use the explanation to see why that choice holds and why the others do not.
Data Structures items like this one are written for Pakistan exams such as CSS, FPSC, PPSC, and NTS. The difficulty label is a hint about how much of the topic the stem assumes, not a score. Tags and exam names, when they are present, tell you where else the same idea is tested. Previous and next links stay in Data Structures so you can continue the subject. Related questions point at nearby stems if you want another angle on the same idea.
Treat the explanation as part of the question, not a footnote. If you missed it, reread the stem against the correct option before you open the next Data Structures item. A timed quiz is the same pool with a clock and a score. A past paper is a full sitting rather than this single question.
- A. A self-balancing binary search tree where the height difference between subtrees is at most one.
Why not A: “A self-balancing binary search tree where the height difference between subtrees is at most one.” does not fit this question. The answer is A linear data structure that follows the Last-In-First-Out (LIFO) principle..
- B. A linear data structure that follows the Last-In-First-Out (LIFO) principle. ✓
- C. A binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.
Why not C: “A binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.” does not fit this question. The answer is A linear data structure that follows the Last-In-First-Out (LIFO) principle..
- D. A structure that stores elements in contiguous memory locations, allowing constant-time indexed access.
Why not D: “A structure that stores elements in contiguous memory locations, allowing constant-time indexed access.” does not fit this question. The answer is A linear data structure that follows the Last-In-First-Out (LIFO) principle..
Correct answer
B. A linear data structure that follows the Last-In-First-Out (LIFO) principle.
Explanation
A linear data structure that follows the Last-In-First-Out (LIFO) principle. (option B) is the accepted answer to “What does Stack refer to”. Option A (A self-balancing binary search tree where the height difference between subtrees is at most one.) does not fit this question. Option C (A binary tree in which each node's left subtree contains smaller values and right subtree contains larger values.) does not fit this question. Option D (A structure that stores elements in contiguous memory locations, allowing constant-time indexed access.) does not fit this question. For this Data Structures question, the accepted answer is A linear data structure that follows the Last-In-First-Out (LIFO) principle..
Source: Data Structures Official Reference Guide
Tags: computer science, data structures, algorithms, programming
Submitted by: MCQsHub Editorial
Related MCQs
- 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.
- Which of the following best names the concept in which a data structure that maps keys to values using a hash...