Exam 2: Lists and the Collections Framework
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 Collection interface is the root of the collection hierarchy.
Free
(True/False)
4.9/5
(41)
Correct Answer:
False
____ testing refers to testing the smallest testable piece of software.
Free
(Multiple Choice)
4.8/5
(29)
Correct Answer:
C
The ____________________ interface is used to pass collections of data as a method parameter in the most general way.
Free
(Short Answer)
4.8/5
(36)
Correct Answer:
Collection
To obtain a ListIterator, you call the ____________________ method of the LinkedList class.
(Short Answer)
4.9/5
(32)
The language feature introduced in Java 5.0 called generic collections is also known as ___________________.
(Short Answer)
4.8/5
(40)
You could create a circular list from a single-linked list by executing the statement ____.
(Multiple Choice)
4.8/5
(50)
A Node is generally defined inside another class, making it a(n) _____________ class.
(Short Answer)
4.8/5
(37)
A(n) ____________________ is a statement of any assumptions or constraints on the method data before the method begins execution.
(Short Answer)
4.9/5
(42)
____ testing is system testing designed to show that the program meets its functional requirements.
(Multiple Choice)
4.7/5
(33)
The ArrayList<E> has the limitation that the add and remove methods operate in O(n2) time.
(True/False)
4.8/5
(37)
The ____ method, of the ArrayList<E> class, creates a new array that is twice the size of the current array and then copies the contents of the current array into the new one.
(Multiple Choice)
4.9/5
(37)
The Node class for a double-linked list has references to the data and to the next and previous nodes.
(True/False)
4.8/5
(38)
A(n) ____ is an indexed data structure, which means you can select its elements in arbitary order as determined by the subscript value.
(Multiple Choice)
4.9/5
(38)
____________________ types allow us to define a collection such as an ArrayList of a specific type.
(Short Answer)
4.7/5
(35)
If you want to remove two consequtive elements in a list, a separate call to ____________________ must occur before each call to remove.
(Short Answer)
4.9/5
(43)
The replacement for a method that has not yet been implemented or tested is called a(n) ____________________.
(Short Answer)
4.9/5
(36)
The ArrayList<E> class is part of the package called ____________________.
(Short Answer)
4.9/5
(42)
Showing 1 - 20 of 35
Filters
- Essay(0)
- Multiple Choice(0)
- Short Answer(0)
- True False(0)
- Matching(0)