Blog

Which of the following class headers will require the concrete Airplane to satisfy the requirements for interfaces Flyable and Boardable?

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]

Complete the main method below so that it reads in a file named FileIn.txt (assume this exists in the same directory where you are running your program). The method should output each line to another file named FileOut.txt, replacing each ODD line with “This was an odd line X”, where X is the line number (starting with 1). Look closely at the example output for more clarification. Notice that the output file has the SAME number of lines as the input file. HINT: Store each line from the input file into a String variable BEFORE testing if it is an even or odd line number. import java.io.*;import java.util.Scanner;public class FileIO { public static void main(String[] args) { /* Your implementation here */ }} Example input and output files: FileIn.txt FileOut.txt Here is  some texteven more This was an odd line 1isThis was an odd line 3even more   Make sure to select the ‘Preformatted’ style from the dropdown so your code is formatted clearly. DO NOT USE THE TAB KEY WHEN WRITING CODE AS YOU MAY ACCIDENTALLY SUBMIT YOUR EXAM. USE THE SPACE BAR INSTEAD.

Given the code below, what gets printed? Assume that Misc 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) {         Misc miscException = new Misc(“Misc Thrown”);           try {           throw miscException;        } catch (Misc m) {            System.out.println(m.getMessage());         } catch (Exception e) {             System.out.println(“Exception Thrown”);         } finally {             System.out.println(“Is this printed?”);         }     } } 

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=100; i>1; i–) {   // do some stuff…   for(int j=1; j

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? [64, 81, 6, 4, 79, 61, 59, 43]

Select the best code to utilize generics so that the class implements the Comparable interface correctly. public class Burrito implements 1  { private int jalepenos; /* valid constructor */ public int compareTo( 2 arg) {   /* valid implementation */ }}    1   : [1]   2   : [2]

Facultative intracellular parasites

Which of the following chemical disinfectants maintains high activity in the presence of organic matter?

Facultative intracellular parasites