Search Algorithms and Computational Thinking

Identify the search algorithm.

• Random search

• Binary search

• Denary search

• Next Item search

Which of the following is not a sorting algorithm?

• Bubble

• Insertion

• Binary

• Merge

Which sorting algorithm is described by: split a list into individual lists, then combine these, two lists at a time?

• Merge

• Bubble

• Insertion

• None of the above

Which sorting algorithm is described by: take each item in turn, compare it to the items in the sorted list and place it in the ordered position in the sorted list?

• Merge

• Bubble

• Insertion

• None of the above

The following list is to be sorted using a bubble sort: 12, 6, 8, 1, 3. What will the list look like after the first iteration through the list?

• 6, 8, 1, 3, 12

• 6, 12, 1, 8, 3

• 1, 3, 6, 8, 12

• 6, 8, 1, 12, 3

How many arrows should come out of a decision symbol in a flowchart?

• 0

• 1

• 2

• 3

The following algorithm should take as input one number, and output the 12 times table for that number. Identify the correct algorithm.

• number = input("Enter a number") for x = 1 to 12 print(number * x) next x

• number = input("Enter a number") for x = 0 to 12 print(number * x) next x

• number = input("Enter a number") for x = 1 to 12 print(number X x) next x

• number = input("Enter a number") for x = 1 to 12 print(number * number) next x

Identify the search algorithm.

• Random search

• Binary search

• Denary search

• Next Item search

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

• Abstraction

• Typing

• Decomposition

• Algorithmic thinking

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

• 0-1

• 2-3

• 4-5

• It can't find the number 9