Select all the statements below which are TRUE for the Direct-Address Table (DAT

Question

Select all the statements below which are TRUE for the Direct-Address Table (DAT) data structure: The space is not wasted if the number of keys in the set of actual keys (K) is much smaller than the number of keys in the universe of keys (U). Search and delete operations take theta(1) time, while the insert operation takes theta(n) because we need to check whether the element is already in the table. If |U| is large, then storing the table T[0..m-1] is impractical or even impossible. DAT table T[0..m-1] has one slot for each possible key in U Select all the statements below which are TRUE about hash tables - open addressing. Insert operation inserts the key in the first available slot, starting with the probe number 0. If the slot is occupied, then the probe number is incremented, and a new slot is computed. If all the slots are found to be occupied then a "hash table overflow" error message is returned. The hash function h must satisfy the following property: for any key k in U, is a permutation of . Each entry in the table is a linked-list with elements from the dynamic set. For any key K summation U, if I,j summation{0,1,2,...,m - 1} and i not equal to j, then h(k,i) must be different than h(k,j)

Explanation / Answer

5.
Searching and delete operations take theeta(1) time,while the insert operation take Theeta(n)
because we need to check whether the element is already in the table.

6.
2nd one is the answer

Related Questions

Navigate

• Browse (All)
• Browse S
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.