Computing

Question 1

1Space complexity measures

Hard

A. the number of lines of code B. how fast the CPU is C. the screen size D. how much memory an algorithm needs

Question 2

2Divide and conquer algorithms

Hard

A. only work on text B. split a problem into smaller sub-problems, solve them and combine the results C. solve problems at random D. never use recursion

Question 3

3A sort that keeps equal items in their original order is ___.

Hard

Your answer (fill in the blank)

Question 4

4The Big-O complexity of binary search is O(___ n).

Hard

Your answer (fill in the blank)

Question 5

5A disadvantage of merge sort compared with bubble sort is that it

Hard

A. is always slower B. needs extra memory to hold the halves C. only works on sorted lists D. cannot sort numbers

Question 6

6A stable sort is one that

Hard

A. uses no memory B. only sorts numbers C. never changes the list D. keeps equal items in their original relative order

Question 7

7The time complexity of a linear search in the worst case is

Hard

A. O(1) B. O(log n) C. O(n) D. O(n²)

Question 8

8After the first pass of bubble sort on [6, 2, 9, 4, 1] (ascending), the list is

Hard

A. [2, 6, 9, 4, 1] B. [6, 2, 4, 1, 9] C. [2, 6, 4, 1, 9] D. [1, 2, 4, 6, 9]

Question 9

9Binary search requires the data to be sorted.

Easy

A. True B. False

Question 10

10Insertion sort is efficient when

Hard

A. the list is empty only B. the list has strings only C. the list is small or already nearly sorted D. the list is huge and random