Skip to content

Course home

Constructs for solving problems

Card 1 of 24

An algorithm is a [     ] set of steps; each step must be [     ].

A

An algorithm is an infinite set of steps; each step must be ambiguous.

B

An algorithm is a finite set of steps; each step must be optional.

C

An algorithm is a finite set of steps; each step must be unambiguous.

D

An algorithm is an infinite set of steps; each step must be unambiguous.

Card 1 of 24

Constructs for solving problems Flashcards

  1. GCSE
  2. /Computer Science
  3. /Constructs for solving problems

24 flashcards on Edexcel GCSE Computer Science Constructs for solving problems: the key terms, algorithms and programming syntax you need to recall for Paper 1 and Paper 2.

Flashcards