CS IGCSE Y2- FA-Algorithm Design and Problem Solving

Identify the description of a linear search

• Put the elements in order, compare to the middle value, split the list in order and repeat

• Put the elements in order, check each item in turn

• Elements do not need to be in order, check each item in turn

• Elements do not need to be in order, compare to the middle value, split the list in order and repeat

Define the term decomposition within computational thinking

• The breaking down of a program until it no longer exists

• The breaking down of waste to make compost

• The breaking down of a problem into smaller problems

• The creation of music that can be played on a computer

A linear search is to be performed on the list: 12, 6, 8, 1, 3.

How many comparisons would it take to find the number 1?

• 1

• 2

• 3

• 4

Identify the search performed by the following algorithm:

for x = 0 to 9

    if (array[x]==10) then 

        OUTPUT(“Found it”)

endif 

next x

• Neither, it does not work

• Both linear and binary

• Linear

• Binary

Which sorting algorithm is described by: moving through a list repeatedly, swapping elements that are in the wrong order.

• Merge

• Insertion

• Bubble

• Not bubble, insertion or merge.

Identify the purpose of the following flowchart symbol:

• Input/Output

• Output

• Decision

• Start/Stop

Identify the purpose of the following flowchart symbol:

• Input/Output

• Process

• Decision

• Sub program

Identify the purpose of the following flowchart symbol:

• Subroutine

• Input/Output

• Decision

• Process

Identify the purpose of the following flowchart symbol:

• Subroutine

• Input/Output

• Decision

• Process

Identify the purpose of the following flowchart symbol:

• Subroutine

• Input/Output

• Decision

• Process