Blog

What is the order of the following data after 3 iterations (i.e. passes) of a descending (i.e. greatest-to-least) selection sort algorithm? [32, 33, 2, 97, 83, 95, 27, 53]

How many potential matches are eliminated after the first iteration (i.e. first pass) of the binary search algorithm for the value of 93? [29, 46, 48, 53, 62, 80, 91, 93, 97]

   Geometric mySquare = new Square();  Given the class hierarchy and code statement above, which of the following methods are allowed and are not allowed to be called on the mySquare variable? perimeter() : [1]describe() : [2] For each statement below, indicate which class provides the implementation of each of the methods called. mySquare.draw();    [3]mySquare.toString(); [4]

What is the code to declare an ArrayList of type Taco that can only hold Tacos? 

Identify the Big-O (i.e. worst-case complexity) of each of the following blocks of code (assume the “stuff” being done is some constant time). n is the input size: [block1] for(int i=0; in; k–) {   // do some stuff…  }  [block3] for(int i=0; i

For an interface named Walkable, we can create a new instance with the following statement: Walkable person = new Walkable();

What is the order of the following data after 3 iterations (i.e. passes) of an ascending (i.e. least-to-greatest) selection sort algorithm?  [13, 95, 79, 62, 82, 78, 19, 91] 

Given the code below, what gets printed? Assume that Hello inherits from an appropriate exception class. It is recommended that you trace this on scratch paper and look for your answer in the choices provided. public class Driver {     public static void main(String[] args) {         Hello helloException = new Hello(“Hello Thrown”);         try {           throw helloException;        } catch (Hello h) {            System.out.println(h.getMessage());         } catch (Exception e) {             System.out.println(“Exception Thrown”);         } finally {             System.out.println(“Is this printed?”);         }     } } 

What is the order of the following data after 3 iterations (i.e. passes) of an ascending (i.e. least-to-greatest) insertion sort algorithm? [58, 52, 57, 38, 27, 7, 59, 80]

Given the code below, what gets printed? Assume that Location inherits from an appropriate exception class. It is recommended that you trace this on scratch paper and look for your answer in the choices provided. public class Tester {     public static void main(String[] args) {        Location locException = new Location(“Location Thrown”);         try {           throw locException;       } catch (Location f) {             System.out.println(f.getMessage());         } catch (Exception e) {             System.out.println(“Exception Thrown”);         } finally {             System.out.println(“Is this printed?”);         }     } }