Blog

Selection sort has O(n2) complexity. If a computer can sort 1,000 elements in 4 seconds, approximately how many seconds will it take the computer to sort 1,000 times that many, or 1,000,000 elements?

What is the preferred way to implement event listeners?

Which of the following statements about white space in Java is correct?

An algorithm that tests whether the first array element is equal to any of the other array elements would be an ____ algorithm.

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); }

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?

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?