4.2.1.1 Data structures and abstract data types Quiz: AQA Computer Science, Unit 2

The 20 questions

1. Which term describes a specialised format for organising, processing, and storing data in computer memory?

   • Data type
   • Data structure
   • File format
   • Control structure

2. Which term describes a data model defined by its operations, independent of implementation?

   • Abstract data type
   • Physical data structure
   • Primitive data type
   • Static data structure

3. Which characteristic distinguishes a static data structure from a dynamic data structure?

   • Pointers between nodes
   • Fixed memory size
   • Variable memory size
   • Automatic growth

4. Which of the following is an example of a dynamic data structure?

   • Linked list
   • Static array
   • Record
   • Tuple

5. What is a key disadvantage of using a static data structure?

   • High memory overhead
   • Wasted memory space
   • Complex memory allocation
   • Slow access speed

6. What is a primary advantage of using a dynamic data structure?

   • Predictable memory usage
   • Flexible memory size
   • Simple index searching
   • Faster element access

7. Which of these is an ADT that uses a first-in, first-out order?

   • Tree
   • Stack
   • Graph
   • Queue

8. Which of these ADTs uses last-in, first-out order?

   • Stack
   • Hash table
   • Dictionary
   • Queue

9. Which abstract data type stores data as a collection of key-value pairs?

   • List
   • Queue
   • Stack
   • Dictionary

10. Which ADT is best suited to storing a set of key-value pairs such as a phone book, where each name gives a number?

    • Stack
    • Dictionary
    • Binary file
    • Queue

11. Which data structure is typically used to represent a one-dimensional vector?

    • One-dimensional array
    • Binary tree
    • Linked list
    • Two-dimensional array

12. What does an abstract data type define compared to its implementation?

    • Operations and behaviour
    • Source code syntax
    • Hardware execution speed
    • Memory address allocation

13. Which built-in data structure is commonly used to implement a stack?

    • Binary tree
    • Graph
    • Array
    • Hash table

14. Which two main components form the structure of a graph data structure?

    • Rows and columns
    • Vertices and edges
    • Nodes and pointers
    • Keys and values

15. A program stores the items in a shopping list in the order they were entered and removes the first item bought. Which ADT suits this?

    • Queue
    • Tree
    • Stack
    • Hash table

16. Which function maps a key directly to a storage location in a hash table?

    • Search function
    • Pointer function
    • Hash function
    • Index function

17. What main characteristic distinguishes a dynamic data structure from a static one?

    • Fixed memory size
    • Faster access time
    • Fixed maximum capacity
    • Dynamic size changes

18. A data structure must store an unknown number of items that change frequently. Which kind is most suitable?

    • Fixed-length array
    • Static
    • Dynamic
    • Constant

19. Which ADT uses a parent-child structure with a single root node?

    • Queue
    • Stack
    • Dictionary
    • Tree

20. What defines how data in an abstract data type can be accessed and modified?

    • Data types
    • Memory addresses
    • Defined operations
    • Hardware buses

Related quizzes

• Single- and multi-dimensional arrays Quiz · 4.2.1.2 · 20 questions
• Reading and writing text and binary files Quiz · 4.2.1.3 · 20 questions
• Linear, circular and priority queues Quiz · 4.2.2.1 · 20 questions
• Stack operations Quiz · 4.2.3.1 · 20 questions
• Graphs: weighted, directed and adjacency representations Quiz · 4.2.4.1 · 20 questions
• Trees and binary trees Quiz · 4.2.5.1 · 20 questions
• Hash tables, hashing and collisions Quiz · 4.2.6.1 · 20 questions
• Dictionaries and key-value pairs Quiz · 4.2.7.1 · 20 questions
• Vectors and vector operations Quiz · 4.2.8.1 · 20 questions
• Data types Quiz · 4.1.1.1 · 20 questions