Unit1 - 7.Comparing algorithms

Multiple Choice

Why is it important to choose the most appropriate algorithm for a given problem?

• It saves time and resources by increasing efficiency.

• It makes the code look more complex.

• It always guarantees the shortest code.

• It ensures the program will never have errors.

Multiple Choice

The following lists represent 3 passes of a sorting algorithm. Which algorithm is being used to sort the list?
 
4    5    9    6    2    7
4    5    6    2    7    9 
4    5    2    6    7    9

• Bubble Sort
• Merge Sort

• Binary Sort

Multiple Choice

Merge Sort is?

• When a list is kept as one and compared
• List is split into 2 and merged together
• List is split into 2 and kept seperate
• Nothing

Multiple Choice

What is a disadvantage of bubble sort?

• It is slow and inefficient
• It doesn't do anything in sorted lists
• It doesn't work on unsorted lists
• None of the provided options

Multiple Choice

What is the maximum number of comparisons a linear search algorithm could make while searching a 100 item list?

• 50
• 51
• 100
• 101

Multiple Choice

A Linear search algorithm requires data to be ordered.

• True
• False

Multiple Select

Which of the following statements are true about binary search (Select three answers)?

• It requires the list to be sorted.

• It is ideal for large data sets.

• It can ignore half the values during each step.

• It works best with unsorted data.

Multiple Choice

What does a linear search do?

• Looks at the first item of data, then each one in turn, until it finds the data item requested
• Organises the data into alphabetical order
• Splits the data until the requested data is found

Multiple Choice

Identify the INCORRECT statement about searching

i. Binary search starts by testing the largest data

ii. Linear search can be done for unsorted data only

iii. Linear search starts by testing data at the middle of list

iv. Binary search can be done for sorted homogeneous data

• i, ii and iii

• ii, iii and iv

• i, iii and iv

• i, ii, iii and iv

Match

Match the following

• Simple; does not need list to be sorted first

• Simple, slow algorithm, ideal for small data sets

• Very efficient; can ignore half the values but list must be in order

• Uses divide and conquer method and is more efficient for large data sets

Linear search

Bubble sort

Binary search

Merge sort

• Linear search

• Bubble sort

• Binary search

• Merge sort

Multiple Choice

What is an advantage of the Linear search algorithm?

• Performs well with small sized data sets
• Can be used on data sets with more than a million elements
• Is complicated to code

Multiple Choice

A linear search algorithm is also known as a...

• Binary search algorithm
• Bubble sort algorithm
• Sequential search algorithm

Dropdown

Creating a sort algorithm for number of tackles in a soccer match (22 players)​

Select answer

Adding a ‘sort by times played’ option to a music streaming app (millions of songs)​

Select answer

Multiple Choice

Which of the following is a key characteristic of bubble sort?

• a) Uses divide and conquer

• b) Ideal for large data sets

• c) Repeats the same steps until sort is complete (brute force)

• d) Very efficient

Multiple Choice

You have a list of 22 players’ tackles in a soccer match. Which algorithm would be most appropriate to sort this small data set?

• Bubble Sort

• Merge Sort

• Linear Search

• Binary Search

Drag and Drop

A music streaming app wants to add a ‘sort by times played’ option for millions of songs. Which algorithm would be most appropriate for this large data set?​

Placeholder

A language translation app needs to search a very large, pre-sorted word list for particular words. Which algorithm would be most efficient?​

Placeholder

Drag these tiles and drop them in the correct blank above

Merge Sort

Binary Search

Bubble Sort

Linear Search