2.1 Algorithms MCQs L1-5

Which of these describes a linear search?

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

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

• Check each item in turn. Elements do not need to be in order.

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

Define the term computational thinking

• Using a computer
• Developing an algorithm to solve a problem
• Making a computer use artificial intelligence
• Google is computational thinking

Which of the following is not a component of computational thinking?

• Abstraction
• Typing
• Decomposition
• Algorithmic thinking

Define the term abstraction within computational thinking?

• Adding numbers together
• Taking a real world problem and designing a computer program that exactly replicates every part of that problem in the computer
• Performing multiple calculations on a list of variables
• Representing real world problems in a computer program, using symbols and removing unnecessary elements

Define the term decomposition within computational thinking

• The breaking down of a program until it no longer exists
• The creation of music that can be played on a computer
• The breaking down of a problem into smaller problems
• The breaking down of waste to make compost

Identify which statement describes algorithmic thinking

• Thinking like a computer
• Writing binary numbers
• Identifying the steps involved in solving a problem
• Identifying what problems need to be solved

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

A binary search is to be performed on the list:
3  5  9  10  23
How many comparisons would it take to find the number 9?

• 0-1
• 2-3
• 4-5
• It can't find the number 9

A binary search is to be performed on the list:

1 5 10 13 48 68 100 101

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

• 0-1

• 1-2

• 3-4

• 4-5

Identify the search performed by the following algorithm:
for x = 0 to 9
   if (array[x]==10) then
      print(*Found it")
   endif
next x

• Linear
• Binary
• Both linear and binary
• Neither, it does not work