QUESTION $1$

One simple implementation of an ordered map that uses randomization for efficiency as well as a way to achieve search and update times which are O$($log n$)$ on average is known as the $\_\_\_\_\_\_\_\_\_\_\_\_\_\_.$

A$.$

Spring List

B$.$

Hop List

C$.$

Skim List

D$.$

Skip List

$6\mathrm{.}66667$ points

QUESTION $2$

A map data structure is also known as an associative array, associate store or associative container.

True

False

$6\mathrm{.}66667$ points

QUESTION $3$

The difference between a map and a dictionary data structure is that a dictionary $\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_\_.$

A$.$

is in sorted order alphabetically

B$.$

allows for multiple entries to have the same key

C$.$

doesn't store key$-$value pairs called entities

D$.$

contains entries called definitions

$6\mathrm{.}66667$ points

QUESTION $4$

What is the below being used for when it is being used with a priority queue?

public Object delete$\_$key$()$

$\{$

if$($count $==0)$

$\{$

System.out.println$("$Q is empty"$)$;

System.exit$(0)$;

$\}$

else

$\{$

Node cur $=$ head.getNext$()$;

Node dup $=$ cur.getNext$()$;

Object e $=$ cur.getEle$()$;

head.setNext$($dup$)$;

count$--$;

return e;

$\}$

$\}$

A$.$

To delete the second element in the list

B$.$

To return but not delete the second element in the list

C$.$

To delete the first element in the list

D$.$

To return but not delete the first element in the list

$6\mathrm{.}66667$ points

QUESTION $5$

A heap exhibits a property of a binary tree?

True

False

$6\mathrm{.}66667$ points

QUESTION $6$

If all of the elements to be stored in a heap are unknown in advance, a bottom$-$up heap construction can be used that runs in O$($n$)$ time.

True

False

$6\mathrm{.}66667$ points

QUESTION $7$

A hash table is composed of a hash function and a $\_\_\_\_\_\_\_\_\_\_\_\_.$

A$.$

binary tree

B$.$

decreasing order array

C$.$

stack

D$.$

bucket array

$6\mathrm{.}66667$ points

QUESTION $8$

What is the time complexity to insert a node based on a key$/$s value in a priority queue built using a singly linked list $($worst case$)?$

A$.$

O$($n$)$

B$.$

O$($log n$)$

C$.$

O$($n$2)$

D$.$

O$($n log n$)$

$6\mathrm{.}66667$ points

QUESTION $9$

Which of the following is NOT a compression function used with hash tables?

A$.$

the division method

B$.$

the subtract, add and divide $($or $$SAD$)$ method

C$.$

the multiply, add and divide $($or $$MAD$)$ method

$6\mathrm{.}66667$ points

QUESTION $10$

Which of the following strategies is NOT considered an "open$-$addressing" method or scheme in hashing?

A$.$

Separate Chaining

B$.$

Linear Probing

C$.$

Double Hashing

D$.$

Quadratic Probing