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 question asks: What is the name for a structure that stores elements in contiguous memory locations, allowing constant-time indexed access? The correct choice is A. Array (contiguous memory). 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. Array (contiguous memory) ✓
- B. Queue
Why not B: “Queue” does not fit this question. The answer is Array (contiguous memory).
- C. Binary tree
Why not C: “Binary tree” does not fit this question. The answer is Array (contiguous memory).
- D. Trie
Why not D: “Trie” does not fit this question. The answer is Array (contiguous memory).
Correct answer
A. Array (contiguous memory)
Explanation
Array (contiguous memory) is the value that answers “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 fit this question. Option C (Binary tree) does not fit this question. Option D (Trie) does not fit this question. For this Data Structures question, the accepted answer is Array (contiguous memory).
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...