Ideally the search, insert and search operations will take constant time when using a hash table data structure.

	True
	False

Considering a hash function f(key) = key % 10, and with keys in the range 0 - 100, each bucket will have 10 keys mapped to it.:

	True
	False

The Hash table structure that uses collision resolution with chaining use buckets designated as "Empty Since Start" and "Empty After Removal".

	True
	False

When implementing a queue using a Singly Linked List, the queue operation Enqueue() is implemented by a call to prepend() in the linked list.

	True
	False

Searching for a key in a Singly Linked List will take O(1) in the worst case where n is the number of the elements in the list

	True
	False