7. Using a BST can help when performing: A) searches on existence tables. B) ins

Question

7.
Using a BST can help when performing:
A) searches on existence tables.
B) insertions into unordered lists.
C) insertions with duplicate keys.
D) searches on unordered lists.
E) searches on string data.

8.
In external searching, the longest processing time is required for:
A) probing the page.
B) accessing specific search items.
C) defining search keys.
D) I/O time to read a block of data.
E) creating the search table.

9.
Separate chaining is part of hashing's:
A) collision-resolution process.
B) occupancy process.
C) hash function.
D) dynamic process.
E) none of the above.

10.
In a BST, the number of comparisons used for a search hit ending at a node equals the:
A) total distance of all nodes to the root, plus 1.
B) average distance of all nodes to the root, plus 1.
C) distance of the node to the root, plus 1.
D) average distance from all nodes to the root, minus 1.
E) distance from the node to the root, minus 1.

11.
An eager key-indexed search is best used with:
A) a large number of key values.
B) infrequent use of a count operation.
C) large data files.
D) a small number of key values.
E) small data files.

12.
A hash function should be implemented in:
A) radix key decomposition.
B) BST counting nodes.
C) the symbol table ADT.
D) a string-index constructor.
E) a user-defined search class.

13.
A skipped list can be represented by a single linked list where each link contains:
A) an array of links.
B) an integer reference.
C) a doubly linked list.
D) a multidimensional array.
E) a symbol table.

Explanation / Answer

7.Using a BST can help when performing: ans : C) insertions with duplicate keys. 8.in external searching, the longest processing time is required for: ans A) probing the page. 9. Separate chaining is part of hashing's: ans : A) collision-resolution process. 10. In a BST, the number of comparisons used for a search hit ending at a node equals the: ans : E) distance from the node to the root, minus 1. 11 An eager key-indexed search is best used with: ans : A) a large number of key values. 12. A hash function should be implemented in: ans : C) the symbol table ADT. 13. A skipped list can be represented by a single linked list where each link contains: ans : A) an array of links.

Related Questions

Navigate

• Browse (All)
• Browse 7
• Subjects

---

---

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