Prepare for the A Level Computer Science OCR Exam with engaging quiz questions and interactive flashcards. Get ready to excel in your exam with comprehensive study materials designed to bolster your knowledge and confidence.

Each practice test/flash card set has 50 randomly selected questions from a bank of over 500. You'll get a new set of questions each time!

Practice this question and more.


What type of data structure is best when you need a fixed number of elements?

  1. Dynamic array

  2. Static list

  3. Tuple

  4. Dynamic list

The correct answer is: Static list

A static list is optimal when you need a fixed number of elements because it is designed to hold a predefined size of data. Once the size is established, the static list allocates memory for that exact number of elements, making it efficient in terms of memory usage and access speed. In contrast, a dynamic array and a dynamic list can resize, which introduces overhead for managing changes in size and may waste memory if not fully utilized. Tuples, while immutable and also of fixed size, are typically used for different purposes, such as grouping heterogeneous data rather than functioning as a traditional list structure with fixed capacity for more uniform data types. Thus, for applications needing a predetermined number of elements, a static list is the most appropriate choice.