Question 1

Which searching algorithm iterates through each item until it finds the right one?

Accepted Answer

Linear

Answer

Bubble sort

Answer

Binary search

Answer

Selection sort

Question 2

Which sorting algorithm requires the list to be sorted prior to running?

Accepted Answer

Binary search

Answer

Linear

Answer

Insertion sort

Answer

Selection sort

Question 3

Which sorting algorithm starts by selecting the first value in the list?

Accepted Answer

Selection sort

Answer

Linear

Answer

Insertion sort

Answer

Bubble sort

Question 4

What does the binary search algorithm require before running?

Accepted Answer

Requires the list to be sorted

Answer

Requires the list to be shuffled

Answer

Requires the list to be in reverse order

Answer

Does not require any preparation

Question 5

How does the selection sort algorithm work?

Accepted Answer

Finds the smallest value in the unsorted section and swaps it with the first item

Answer

Randomly shuffles the list

Answer

Takes the largest value and swaps it with the first item

Answer

Swaps the first and last item in the list

Question 6

What does the bubble sort algorithm do?

Accepted Answer

Checks two items beside each other and swaps them if necessary

Answer

Randomly swaps elements

Answer

Reverses the list

Answer

Selects the largest value and moves it to the end

Question 7

What is the key concept in linear search algorithm?

Accepted Answer

Iterates through each item until it finds the right one

Answer

Divides the list in half for search

Answer

Randomly picks an item from the list

Answer

Sorts the list first before searching

Question 8

How does the insertion sort algorithm start sorting?

Accepted Answer

Starts at second and works towards the right

Answer

Starts at the middle of the list

Answer

Starts at the last item of the list

Answer

Randomly selects a starting point

Question 9

What is the main difference between linear search and binary search?

Accepted Answer

Linear search goes through each item sequentially, while binary search divides the list in half for search

Answer

Binary search checks two elements at a time

Answer

Linear search is faster than binary search

Answer

Linear search requires the list to be sorted first

Question 10

Which sorting algorithm checks two adjacent elements and swaps them if necessary?

Accepted Answer

Bubble sort

Answer

Selection sort

Answer

Insertion sort

Answer

Quick sort

Question 11

In binary search, what does the algorithm find first before proceeding with the search?

Accepted Answer

First and last index

Answer

Middle index

Answer

Largest value

Answer

Smallest value

Question 12

Which sorting algorithm starts with the second element and shifts elements if necessary?

Accepted Answer

Insertion sort

Answer

Merge sort

Answer

Selection sort

Answer

Bubble sort

Question 13

How does the selection sort algorithm find the smallest value in the unsorted section?

Accepted Answer

Takes the first value and compares it with the remaining items

Answer

Randomly selects an item for comparison

Answer

Takes the last value and compares it with the remaining items

Answer

Uses a separate list for comparison

Question 14

What is quicksort?

Accepted Answer

A Sorting algorithm based on the Divide and Conquer algorithm that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array.

Answer

Starting at the beginning of the data set, each item of data is examined until a match is made. Once the item is found, the search ends.

Answer

Iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list.

Answer

repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity is quite high.

Related quizzes

Related quizzes