Knock out the true statements

Exercise and reference answers

Questions

1. Question

   Eliminate the true statements about searching.

   Choices

   1. Item

      Binary search runs on an unsorted list

      Correct

      Yes

   2. Explanation

      It is exhaustive, comparing each element with the key.

      Item

      Linear search compares every element

   3. Explanation

      One half cannot hold the key, so it is ignored.

      Item

      Binary search discards half each step

   4. Explanation

      An index is computed rather than the list scanned.

      Item

      Hashing makes searching very efficient

Instructions

Remove the statements that are true. One false one should survive.

Explanation