1. Which of the following are advantages of using a hash table to store large amounts of data? Assume the hash table use

[answerhappygod]

1. Which of the following are advantages of using a hash table
to store large amounts of data? Assume the hash table uses a good
hash function and has a low load factor. Select all that apply.
The following checkbox options contain math elements, so you may
need to read them in your screen reader's “reading” or “browse”
mode instead of “forms” or “focus” mode.
a.It has O(1)O(1) time to access specific elements in
the average case
b.It is space efficient (no wasted memory)
c. It allows you to quickly find the smallest element in a
collection
2.
Which of the following are advantages of using a doubly linked
list (with head and tail pointers) to implement the List interface
over using an array to implement the List interface? Select all
that apply.
a.Inserting at the front of the Linked List is faster than
inserting at the front of an array.
b.Inserting at the end of a Linked List is faster than inserting
at the end of an array (assuming the array has empty space).
.cLinked Lists are more memory efficient than arrays.
d.Linked Lists never get full (until your computer runs out of
memory); while arrays can get full and need resize.
3. Which of the following are advantages of using a min-heap
over a binary search tree?
a.It is faster to find the minimum element in the heap
b.A heap can be compactly represented in an array, while a
binary search tree generally cannot.
c.It is faster to traverse the items in the heap in sorted
order.
d.Inserting into a heap is O(logN) in the worst case, while
inserting into an arbitrary Binary Search Tree is O(N) in the worst
case.