T-Level DPDD: Searching & Sorting Algorithms Quiz

What is the simplest method of searching a data set, often referred to as a 'serial' search?

• Binary search

• Linear search

• Hash search

• Tree search

In a linear search, what happens if the item being searched for is not found in the data set?

• The search continues indefinitely

• The algorithm must be able to deal with this

• The search starts over from the beginning

• The search ends immediately

Which of the following is a benefit of using a linear search?

• The list must be ordered

• It is very slow when searching lists with vast quantities of data items

• It can carry out a search on any type of data

• It requires complex program code

What is a key requirement for a binary search to work as intended?

• The data should be in a sorted format

• The data should be in a random format

• The data should be in a reverse order

• The data should be in a tree structure

In a binary search, what happens if the search value is lower than the middle of the array interval?

• The interval is changed to the upper half of the array

• The interval is changed to the lower half of the array

• The search ends immediately

• The search starts over from the beginning

Which of the following is a drawback of using a binary search?

• Faster performance than a linear search

• Data must be sorted (ordered) first

• Can carry out a search on any type of data

• Simpler to write program code

Which of the following is a benefit of using a binary search over a linear search?

• The list does not have to be ordered

• It is very slow when searching lists with vast quantities of data items

• Faster performance because the data that requires searching is halved at each stage

• It requires complex program code

What is the primary operation performed by the bubble sort algorithm?

• Inserting elements into their correct position

• Repeatedly swapping adjacent elements that are out of order

• Dividing the array into smaller sub-arrays

• Merging sorted sub-arrays

In the first pass of the bubble sort example, what is the order of the array after comparing the first two elements (57 and 32)?

• 57, 32, 83, 28, 7

• 32, 57, 83, 28, 7

• 32, 83, 57, 28, 7

• 57, 83, 32, 28, 7

What is the main difference between bubble sort and insertion sort?

• Bubble sort divides the array into sub-arrays, while insertion sort merges them.

• Bubble sort repeatedly swaps adjacent elements, while insertion sort inserts elements into their correct position.

• Bubble sort uses a pivot element, while insertion sort does not.

• Bubble sort is a recursive algorithm, while insertion sort is not.