Searching and Sorting Assessment

Which of the following best describes linear search?

• A method that divides the list in half repeatedly

• A technique that checks every element from start to end sequentially

• An algorithm that jumps ahead by fixed steps

• A process that sorts elements while searching

Binary search can only be performed on:

• Unsorted lists with duplicate elements

• Sorted data structures

• Random access memory only

• Linked lists exclusively

What is the primary advantage of jump search over linear search?

• It works better on unsorted arrays

• It requires less memory

• It checks fewer elements by skipping fixed steps

• It can search backwards efficiently

Which searching algorithm would be most efficient for finding a specific webpage through a search engine?

• Linear search only

• Bubble sort with linear search

• Binary search

• Multiple algorithm combination depending on the data structure

In binary search, how is the search space typically reduced?

• By removing random elements

• By dividing the search space in half

• By jumping fixed steps

• By comparing adjacent elements

What is the primary characteristic of insertion sort?

• It always starts with the largest element

• It requires multiple arrays

• It consumes one element per iteration to find its position

• It only works on strings

Bubble sort functions by:

• Dividing the list into sublists

• Finding the minimum element first

• Comparing and swapping adjacent elements

• Inserting elements in sorted positions

Which sorting algorithm uses a divide-and-conquer approach?

• Bubble sort

• Insertion sort

• Merge sort

• Selection sort

The main principle of selection sort is:

• Swapping adjacent elements

• Finding the minimum/maximum element and placing it in correct position

• Dividing the list recursively

• Inserting elements one by one

In which scenario would linear search be most appropriate?

• Searching through a sorted phone directory

• Finding an element in an unsorted small list

• Searching through a binary tree

• Looking up a word in a dictionary