What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access?
Difficulty: Medium
About this MCQ
This Medium Data Structures MCQ checks one syllabus fact.
The question is: “What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access?”
The accepted answer is A. Array (contiguous memory). Array (contiguous memory) is the fact required by “What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access” (option A). Option B (“Queue”) does not match the stem; it is a near-miss used to catch incomplete recall of Array (contiguous memory). Option C (“Binary tree”) does not match the stem; it is a near-miss used to catch incomplete recall of Array (contiguous memory). Remaining alternatives (Trie) fall outside the same rule and should be eliminated once Array (contiguous memory) 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. Array (contiguous memory) ✓
- B. Queue
Why not B: “Queue” is not correct. The accepted answer is A. Array (contiguous memory). Array (contiguous memory) is the fact required by “What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access” (opt
- C. Binary tree
Why not C: “Binary tree” is not correct. The accepted answer is A. Array (contiguous memory). Array (contiguous memory) is the fact required by “What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access” (opt
- D. Trie
Why not D: “Trie” is not correct. The accepted answer is A. Array (contiguous memory). Array (contiguous memory) is the fact required by “What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access” (opt
Correct answer
A. Array (contiguous memory)
Explanation
Array (contiguous memory) is the fact required by “What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access” (option A). Option B (“Queue”) does not match the stem; it is a near-miss used to catch incomplete recall of Array (contiguous memory). Option C (“Binary tree”) does not match the stem; it is a near-miss used to catch incomplete recall of Array (contiguous memory). Remaining alternatives (Trie) fall outside the same rule and should be eliminated once Array (contiguous memory) 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
- Which term refers to a linked list where each node has pointers to both the next and previous nodes?
- Identify the correct concept described as: a self-balancing binary search tree where the height difference bet...
- Select the accurate description of Circular linked list.
- The following statement describes a specific concept. What is it called? a linked list in which the last node...
- What is Trie primarily used for?
- Which concept is defined as follows: a tree-like data structure used to efficiently store and retrieve strings...