Exam 7: Sets and Maps
Exam 1: Object-Oriented Programming and Class Hierarchies41 Questions
Exam 2: Lists and the Collections Framework35 Questions
Exam 3: Testing and Debugging25 Questions
Exam 4: Stacks and Queues28 Questions
Exam 5: Recursion25 Questions
Exam 6: Trees25 Questions
Exam 7: Sets and Maps27 Questions
Exam 8: Sorting25 Questions
Exam 9: Self-Balancing Search Trees28 Questions
Exam 10: Graphs25 Questions
Exam 11: Introduction to Java25 Questions
Exam 12: Overview of UML25 Questions
Select questions type
The problem with ____________________ probing is that it tends to form clusters of keys in the table, causing longer search chains.
(Short Answer)
4.8/5
(43)
Which of the following is a commonly used method of the Set interface?
(Multiple Choice)
5.0/5
(37)
Sets contain no pair of elements e1 and e2 such that e1.equals(e2), and at most one null element.
(True/False)
4.8/5
(31)
In ____________________ addressing, each hash table element (type Object) references a single key-value pair.
(Short Answer)
4.9/5
(32)
An addressing technique in which each table element references a linked list that contains all the items that hash to the the same table index is referred to as _________________________.
(Short Answer)
4.9/5
(37)
The Java API implements the Set using a(n) ____________________.
(Short Answer)
4.9/5
(41)
One requirement on the key-value pair for a Map object is to implement the interface ____________________, which is an inner interface of interface Map.
(Short Answer)
4.8/5
(32)
Showing 21 - 27 of 27
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)