Author: Anonymous

Which of the sorts in the textbook can be characterized by the fact that even in the worst case the running time will be O(n log(n)))? I     quicksort II    selection sort III   merge sort

Insert the missing code in the following code fragment. This fragment is intended to read all words from a text file named dataIn.txt. File inputFile = new File(“dataIn.txt”); Scanner in = new Scanner(inputFile); while (____________) { String input = in.next(); System.out.println(input); }

Consider the following code snippet: public class Motorcycle extends Vehicle { private String model; . . . public Motorcycle(int numberAxles, String modelName) { model = modelName; super(numberAxles); } } What does this code do?

Consider the following class: public class Stock implements Comparable { private String name; private double price; // other methods go here public int compareTo(Object otherObject) { Stock otherStock = (Stock) otherObject; __________________________________; } } Which is the best statement to use to complete the compareTo() method?

What is the term used for a subclass that defines a method with the same name as a method in its superclass, but with different parameter types?

Which nodes need to be updated when we insert a new node to become the fourth node from the beginning of a doubly-linked list?

Select an appropriate expression to complete the header for the method below. public void openFile(String inputFile) ______________________________ { File theFile = new File(inputFile); Scanner data = new Scanner(theFile); // additional statements to input data from file }

If the current method in a program will not be able to handle an exception, what should be coded into the method?

Consider the following code snippet. File inputFile = new File(“dataIn.txt”); Scanner in = new Scanner(inputFile); while (in.hasNext()) { String input = in.next(); } Which of the following statements about this code is correct?

The method checkArray examines an array arr: public static boolean checkArray(int[] arr) { if (arr[0] >= arr[arr.length -1]) { return true; } return false; } What can you conclude about the running time of this section of code?