DS Self Check

Skip to main content

Section 6.6 Self Check

Checkpoint 6.6.1.

Match the method of finding data to its corresponding Big O.

Review the analysis of each technique

Linear Search
$O (n)$
Binary Search
$O (\log n)$
Hashing
$O (1)$

Checkpoint 6.6.2.

Drag the search method to the type of data that it is more efficient for compared to the other search method.

This is feedback.

Binary Search
ordered data
Linear Search
unordered data

Checkpoint 6.6.3.

What creates hash collisions?

when pairs of different hash values are mapped to the same key.
🔗
Think about what keys refer to and what hash values refer to
when pairs of different hash values do not share the same key.
🔗
Think about what keys refer to and what hash values refer to
when pairs of different keys are mapped to the same hash value.
🔗
Correct!
when pairs of different keys do not share the same hash value.
🔗
Think about what keys refer to and what hash values refer to

You have attempted 1 of 4 activities on this page.