Unit 5 Lab 1 Review

Which type of lists or data sets are linear searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

Which type of lists or data sets are binary searching algorithms used for?

• Unsorted lists or data sets
• Sorted lists or data sets

Select the best description to explain what a linear search algorithm is.

• Put the elements in order, check each item in turn.
• Put the elements in order, compare with 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

Select the best description to explain what a binary search algorithm is.

• Put the elements in order, check each item in turn.

• Put the elements in order, compare with 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

On average, which searching algorithm is more efficient?

• Binary Search
• Linear Search

An array with 20 elements is input to a binary search algorithm. How many maximum number of comparisons are performed?​

• 20

• 16

• 8

• 5

An array with 20 elements is input to a linear search algorithm. How many maximum number of comparisons are performed?​

• 20

• 16

• 8

• 5

Which type of computing system will take as long as the sum of all the individual steps?

• Distributed Computing

• Parallel Computing

• Multiple Computing

• Sequential Computing

Parallel computing can consist of which types of components? (Select 2 answers)

• Parallel components

• Distributed components

• Calcuolatory components

• Sequential components

True or False?

In a parallel computing system, the process will take as long as the longest task.

• True

• False