Section 1
Preview this deck
Assuming the statement below is valid, and assuming a method named fred() exists in both Class1 and Class 2, which of the following is true? Class1 c = new Class2(1000);
Front
| 5 | 0 | ||
| 4 | 0 | ||
| 3 | 0 | ||
| 2 | 0 | ||
| 1 | 0 |
Active users
0
All-time users
0
Favorites
0
Last updated
4 years ago
Date created
Mar 14, 2020
Cards (60)
Section 1
(50 cards)
Assuming the statement below is valid, and assuming a method named fred() exists in both Class1 and Class 2, which of the following is true? Class1 c = new Class2(1000);
c.fred() will result in a call to the method in Class1 "c.fred() will result in a call to the method in Class2" c.fred() will result in an error
This search algorithm steps sequentially through an array, comparing each item with the search value
sequential search
Given the following class header, which class constructor will execute first? public class Robin extends Bird
Bird
Write a method header for a public method named calculateMean that takes a String argument named filename, and that returns a double, and may generate a FileNotFoundException
public double calculateMean(String filename) throws FileNotFoundException { }
This is one of the methods that is common to both the String and StringBuilder classes
length
These static final variables are members of the numeric wrapper classes and hold the minimum and maximum values for a particular data type
MIN_VALUE & MAX_VALUE
When a class implements an interface, it must
provide all of the methods that are listed in the interface, with the exact signatures and return types
The indexOf and lastIndexOf methods can find characters, but cannot find subStrings.
False
In Java, the first (head) element of a list has
index 0
This key word refers to an object's superclass
super
This is an internal list of all the methods that are currently executing
call stack
You can think of this code as being "protected" because the application will not halt if it throws an exception.
try block
An iterator's remove method can be called more than once between calls to next.
False
In which of the big O notation complexity classes is the sequential search?
O(n) linear time. An increase in input size results in a proportionally large increase in running time.
The startsWith and endsWith method are case-sensitive.
True
Abstract methods must be
overriden
The number of elements actually stored in a list.
size
A list's capacity is less than its size
False
Character testing methods, such as isLetter, accept strings as arguments and test each character of the string.
False
In the __________ algorithm, the smallest value in the array is located and moved to element 0. Then the next smallest value is located and moved to element 1. The process continues until all of the elements have been placed in their proper order
selection sort
Under what conditions should you use StringBuilder objects instead of String objects?
When you want to change the contents of a string without creating a new object
This method converts a character to uppercase.
toUpperCase
If your code does not handle an exception when it is thrown, it is dealt with by this.
default exception handler
This search algorithm is adequate for small arrays but not for large arrays
sequential search
This search algorithm requires that the array's contents be sorted.
binary search
To handle an exception gracefully, you
catch it
This String class method performs the same operation as the + operator when used on Strings.
concat
To add an element e to a linked list, just after a node referenced by ref, you should use the statement:
ref.next = new Node(e, ref.next);
A class can implement only one interface.
False
All exception classes inherit from this class.
Throwable
In which of the big O notation complexity classes does finding the largest value in an unsorted array belong?
O(n) linear time. An increase in input size results in a proportionally large increase in running time.
The indexOf and lastIndexOf methods are members of this class.
String
The recursive RLinkedList class contains all the methods required by the List interface.
False
In which of the big O notation complexity classes is the binary search?
O(log n) logarithmic time. A large increase in input size results in a small increase in running time.
If a subclass constructor does not explicitly call a superclass constructor, Java will call the no-arg superclass constructor.
True
This search algorithm repeatedly divides the portion of an array being searched in half.
binary search
The startsWith, endsWith and regionMatches methods are members of this class.
String
A method in a subclass having the same signature as a method in the superclass is an example of
overriding
To conveniently remove a node that is not the head of a singly-linked list, you need a reference to
the predecessor node
This method can be used to retrieve the error message from an exception object.
getMessage
Each element in a list except the last element has a(n)
successor
The numeric wrapper classes' "parse" methods all throw an exception of this type.
NumberFormatException
If you have an ArrayList<String> named tb that looks like this when printed: [John, Paul, George, Ringo] Who gets removed by the following? Iterator<String> it = tb.iterator(); it.next(); it.next(); it.remove();
Paul
A subclass in a different package from its superclass can access the superclass's fields if they are
protected or public
This is a section of code that gracefully responds to exceptions.
exception handler
When an exception is generated, it is said to have been ____________
thrown
In which of the big O notation complexity classes is the worst case of all 4 sort algorithms we studied?
O(n2) quadratic time, the simplest case of polynomial time. An increase in input size results in a much greater increase in running time.
In which of the big O notation complexity classes does finding the largest value in a sorted array belong?
O(1) constant time (i.e. the time to run the algorithm is constant, not dependent on input size)
Consider the following class header. Which of the following statements is true?
an object of type SubClass inherits a toString method, whether there is one in SuperClass or not SuperClass is the base class SuperClass could be an abstract class. "all of these are true"
Given the following declaration and current contents ["John", "George", "Ringo"], which of the answers uses a standard List method to delete "George"? List<String> theBeatles = new ArrayList<String>(); A) theBeatles.remove("George"); B) theBeatles.remove(1);
A and B
Section 2
(10 cards)