Lesson 4.4.1.10

4.4.1.10 Composition Quiz: AQA Computer Science, Unit 4

20 questions

In partnership with Revision Ninja

Lesson 4.4.1.10, Composition: 20 multiple choice questions for the AQA Computer Science (7517), Unit 4: Theory of computation, written with Revision Ninja.

Host it live on the board and students join with a game code on their own devices, or revise alone with Free Play. The answers are revealed in the game.

Host this setFree Play

The 20 questions

  1. What type of abstraction builds compound procedures by combining simpler procedures?

    • Procedural composition
    • Data abstraction
    • Procedural decomposition
    • Problem reduction
  2. What action demonstrates procedural composition in functional programming?

    • Dividing into subroutines
    • Deleting unused code
    • Declaring local variables
    • Chaining function calls
  3. In the functional composition expression f(g(x)), which function is evaluated first?

    • Function f
    • Both simultaneously
    • Neither function
    • Function g
  4. According to the AQA specification, which data structure is a classic example of data composition?

    • Tree structure
    • Boolean flag
    • Floating-point number
    • Primitive integer
  5. What is created when several different data types are combined into a single record?

    • Atomic data type
    • Compound data object
    • Abstract model
    • Procedural decomposition
  6. How does composition fundamentally differ from procedural decomposition in problem solving?

    • It combines parts
    • It breaks down
    • It removes detail
    • It executes code
  7. A program calculates a total price by first calling a function to find the tax and then a function to add it. Which principle is shown?

    • Bubble sort
    • Representational abstraction
    • Binary search
    • Composition of procedures
  8. Which of the following represents a compound data structure built using data composition?

    • Single character
    • Integer constant
    • Machine instruction
    • Nested list
  9. Implementing a stack using an array and a top pointer is an example of what?

    • Procedural decomposition
    • Automation
    • Functional programming
    • Data composition
  10. If f(x) = x + 3 and g(x) = 2x, what is f(g(5))?

    • 13
    • 16
    • 25
    • 11
  11. Two procedures are composed so that the first returns a list and the second sums it. What is the result for the list [1, 2, 3]?

    • 123
    • [1, 2, 3]
    • 6
    • 3
  12. What is the main purpose of composition abstraction in computer science?

    • Removing unnecessary details
    • Breaking down problems
    • Executing compiled code
    • Combining simpler components
  13. Which process builds compound procedures or data from simpler components?

    • Composition
    • Generalisation
    • Automation
    • Decomposition
  14. A procedure is built from a sequence of smaller procedures, each used once. Which abstraction is this?

    • Representational abstraction
    • Information hiding
    • Sorting
    • Composition of procedures
  15. What type of abstraction is formed by combining data objects into a tree structure?

    • Procedural abstraction
    • Data abstraction
    • Functional abstraction
    • Control abstraction
  16. Combining multiple procedures to form a single compound procedure is an example of what?

    • Procedural decomposition
    • State transition
    • Data modelling
    • Procedural composition
  17. What is formed when multiple procedures are combined using composition?

    • Compound procedure
    • State machine
    • Abstract data type
    • Decomposed module
  18. Combining a parser function and a validator function into one single function demonstrates what?

    • Decomposition
    • Composition
    • Encapsulation
    • Automation
  19. Given square(x) = x * x and add1(x) = x + 1, what is square(add1(2))?

    • 5
    • 4
    • 6
    • 9
  20. Combining two data items together into a single structure creates what type of data?

    • Compound data
    • Decomposed data
    • Atomic data
    • Primitive data

All AQA Computer Science quizzes