Unit 2.1 Computational Thinking & Searching Algorithms MCQs L1-2

Identify the description of a linear search (4-5) 

• Put the elements in order, check each item in turn 
• Put the elements in order, compare to the middle value, split the list in order and repeat 
• 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 

Identify the description of a binary search (4-5) 

• Put the elements in order, check each item in turn 
• Put the elements in order, compare to the middle value, split the list in order and repeat 
• 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 computational thinking (1-2) 

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

Which of the following is not a component of computational thinking? (1-2) 

• Abstraction 
• Typing 
• Decomposition 
• Algorithmic thinking 

Define the term abstraction within computational thinking (4-5)

• Adding together numbers

• 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 (1-2) 

• 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 (1-2) 

• 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 nd the number 1? (6-9) 

• 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 nd the number 9? (4-5) 

• 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 the nd the number 101? (4-5) 

• 0-1
• 1-2
• 3-4
• 4-5