Question 4.4. (TCO 6) _____ is not an operation of the hash table data structure

Question

Question 4.4. (TCO 6) _____ is not an operation of the hash table data structure. Week 5 Lecture (Points : 3) Insert Delete Find the maximum Search

Question 5.5. (TCO 6) The hash table allows for insertions, deletions, and searches in _____. Week 5 Lecture (Points : 3) O(n3 ) O(n log n) average constant time O(2n)

Question 6.6. (TCO 6) Linear probing can produce _____. Week 5 Lecture (Points : 3) primary clustering small, occupied portions of space in the hash table a full hash table an empty hash table

Question 7.7. (TCO 6) Searching for an element based on using a unique key is _____. Week 5 Lecture (Points : 3) slower faster and more convenient unusual inefficient

Question 8.8. (TCO 6) One of the main operations associated with the dictionary ADT is _____. Week 5 Lecture (Points : 3) insert a value as the first item in the dictionary given a value, insert or add a new entry to the dictionary given a key and a value, insert or add a new entry to the dictionary return the hash value of a key

Question 9.9. (TCO 6) Given the following dataset stored in a linked list, which searching method would be recommended? Assume that only one search is to be conducted. Week 5 Lecture 1 6 10 8 14 9 (Points : 3) Binary search on an unsorted linked list Binary search on a sorted linked list Sequential search on an unsorted linked list Sequential search on a sorted linked list

Question 10.10. (TCO 6) The worst-case time efficiency of a sequential search on an array a with n elements is _____. Week 5 Lecture (Points : 3) when the item you are searching is not present in the array when the item you are searching is the first item, a[0] when the item you are searching is the second item in the array, a[1] when the item you are searching is the one in the middle of the array, a[n/2]

Question 11.11. (TCO 6) Given the following array, how many comparisons to an array entry are performed to search for the number 22 if you use the binary search algorithm? Week 5 Lecture 11 13 15 19 22 27 31 39 46 (Points : 3) 1 2 4 22

Explanation / Answer

Question 4.4. (TCO 6) _____ is not an operation of the hash table data structure.

Find the maximum

Question 5.5. (TCO 6) The hash table allows for insertions, deletions, and searches in _____

O(2n)

Question 6.6. (TCO 6) Linear probing can produce _____.

primary clustering small

Question 7.7. (TCO 6) Searching for an element based on using a unique key is

faster and more convenient

Question 8.8. (TCO 6) One of the main operations associated with the dictionary ADT is

insert or add a new entry to the dictionary given a key and a value,

Question 9.9. (TCO 6) Given the following dataset stored in a linked list, which searching method would be recommended? Assume that only one search is to be conducted.

Binary search on a sorted linked list Sequential search on an unsorted linked list

Question 10.10. (TCO 6) The worst-case time efficiency of a sequential search on an array a with n elements is _____when the item you are searching is not present in the array

Question 11.11. (TCO 6) Given the following array, how many comparisons to an array entry are performed to search for the number 22 if you use the binary search algorithm?

in worst case 4 comparisions

Related Questions

Navigate

• Browse (All)
• Browse Q
• Subjects

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