Computing

Question 1

1An advantage of linear search is that

Medium

A. it works on unsorted lists B. it only works on numbers C. it is always the fastest D. it needs the list sorted

Question 2

2After one full pass of bubble sort (ascending) on [5, 3, 8, 1], the largest number is

Hard

A. removed B. in the middle C. at the end of the list D. at the start

Question 3

3Descending order means from smallest to largest.

Easy

A. True B. False

Question 4

4Sorting names alphabetically from A to Z is

Easy

A. binary order B. ascending order C. descending order D. random order

Question 5

5Bubble sort compares neighbouring items and swaps them when needed.

Medium

A. True B. False

Question 6

6The sorting algorithm that repeatedly swaps neighbouring items is ___ sort.

Medium

Your answer (fill in the blank)

Question 7

7In bubble sort, the algorithm repeatedly

Medium

A. deletes the largest item B. compares neighbouring items and swaps them if they are in the wrong order C. picks a random item D. splits the list into halves only

Question 8

8Which real-life activity is most like a binary search?

Medium

A. Checking every shelf in a shop one by one B. Throwing dice C. Counting all the pages D. Looking for a word in a dictionary by opening near the middle

Question 9

9A binary search works only when the list is

Medium

A. sorted B. unsorted C. empty D. made of strings only

Question 10

10Binary search is usually faster than linear search on a long sorted list.

Medium

A. True B. False