1) What does 'algorithym' mean? a) A clear set of instructions b) Breaking something down into smaller parts c) Taking out the unnecessary detail 2) What does 'decomposition' mean? a) A clear set of instructions b) Breaking something down into smaller parts c) Taking out the unnecessary detail 3) Which algorithm is the most precise? a) Draw a mall circle b) Draw a small circle in the middle of your page c) Draw a small, beautiful circle on your page 4) What is a 'loop'? a) A repeat b) An algorithm c) A knot 5) What repeat/loop could be used for this algorithm? a) Repeat 2 b) Repeat 3 c) Repeat 4 6) What does 'abstraction' mean? a) Drawing in patterns b) Removing unnecessary detail c) A clear set of instructions 7) Which example does not use abstraction? a) London underground map b) Map of a zoo c) Library book 8) What do we call the process of fixing an error in an algorithm or program? a) Abstraction b) Debugging c) Decomposition 9) Debug this algorithm. Which steps are in the wrong order?  a) Steps 1 and 2 b) Steps 3 and 4 c) Steps 5 and 6

Computing Y2 U2: Algorithyms and debugging

бойынша
Басып шығару
Ендіру

Көшбасшылар тақтасы

Визуалды стиль

Опциялар

Үлгіні ауыстыру

Өңдеуді жалғастыру: ?