Which term describes a data structure that holds items in a single linear sequence?

Prepare for the IGCSE Algorithms and Pseudocode Exam. Study with comprehensive questions covering key algorithms and pseudocode techniques. Access hints and explanations to gear up for your exam success!

Multiple Choice

Which term describes a data structure that holds items in a single linear sequence?

Explanation:
A data structure that stores items in a single straight line is an array, with the emphasis on a single line of elements described as a one-dimensional array. This term specifically conveys a linear sequence of elements, all accessible by their index in one dimension. It’s more precise than just "arrays" because that could imply multiple dimensions in some contexts, while "one-dimensional arrays" clearly matches the idea of a single linear sequence. The other options aren’t about storage structures: library routines are prewritten functions, and parameters are values passed to functions.

A data structure that stores items in a single straight line is an array, with the emphasis on a single line of elements described as a one-dimensional array. This term specifically conveys a linear sequence of elements, all accessible by their index in one dimension. It’s more precise than just "arrays" because that could imply multiple dimensions in some contexts, while "one-dimensional arrays" clearly matches the idea of a single linear sequence. The other options aren’t about storage structures: library routines are prewritten functions, and parameters are values passed to functions.

Subscribe

Get the latest from Examzify

You can unsubscribe at any time. Read our privacy policy