MOCK Exam 2

Define what is meant by the term 'algorithm'

• Step by step instructions or rules to solve a problem.
• Code for a specific task.

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

• Unsorted lists or data sets

• Sorted lists or data sets

• Sorted or Unsorted 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

Describe an advantage of a linear search algorithm

• Data does not need to be in order.
• Performs well over large ordered lists.
• Can only work on an ordered list.  If unordered must use a linear search.
• Slow with large data sets.

Describe a disadvantage of a linear search algorithm

• Data does not need to be in order.
• Performs well over large ordered lists.
• Can only work on an ordered list.  If unordered must use a linear search.
• Slow with large data sets.

Breaking a complex problem down into smaller problems and solving each one individually.

• Decomposition
• Abstraction
• Programming
• Algorithmic Thinking

What is abstraction?

• The process of filtering out unnecessary detail.
• The process of filtering out irrelevant characteristics
• The process of filtering out irrelevant characteristics and unnecessary detail.

Which sorting algorithm shifts elements instead of swapping elements if needed in each pass.

• Bubble Sort
• Selection Sort
• Insertion Sort