I have some questions left and i need help.

l) Given a 2D array of ints, find the column with the maximum sum.

m) Given positive integers w and h and an int[] array arr of length w * h, return a 2d array with h rows and w columns that contains the numbers in arr, listed left-to-right and top-to-bottom.

n) Given an integer n, return the smallest prime number that is larger than n. (A number is prime if it is greater than 1 and has no divisors other than 1 and itself.)

o) Given an array of positive integers, "collapse" the array to remove duplicates, and fill in the unused cells at the end with zeros. For example, given the array [5, 4, 5, 6, 4, 2], after this method executes the array should be [5, 4, 6, 2, 0, 0]. The method modifies the given array, and returns void.

p) Given an array of positive integers, return a new array containing the same numbers, in the same order, but without duplicates. For example, given the array [5, 4, 5, 6, 4, 2], the method returns [5, 4, 6, 2].

q) Given an instance of Random, generate a list of numbers between 0 and 99, inclusive, stopping when the same number has appeared more than once. The method returns a list of all the generated numbers. (The ArrayList contains() method might be useful.)

r) Given a string, return a new string with the words in the opposite order. (E.g. given "He's dead, Jim", return "Jim dead, He's".)

s) Given an array of ints, swap the first half with the second half. The method modifies the given array and returns void. If the length is odd, the middle element is not moved. For example, if called on the array [10, 20, 30, 40, 50, 60, 70], after the method executes the array would be [50, 60, 70, 40,10, 20, 30].

2) Write a program that will remove all the //-style comments from a Java file. Your program should prompt the user to enter the name of the input file. The output file should have the same name as the input file but should end with the extension .out instead of .java. The output file should be the same as the input file except that all //-style comments are removed. (You can assume that the sequence // does not occur inside any String literals within the program.)

3) Trace the execution of the call enigma(12,0) and show all output that is produced.

public static void enigma (int x, int y) { while (x > 0){

if (x % 2 == 0){ y = y + 1;

} else {

x = x + 2; }

x = x - y;

System.out.println(x + ", " + y); }

} 4) Given the array: int[] test = {6, 7, 4, 3, 5, 2, 7, 9, 8}; Trace the execution of

the call whatever(test) and show contents of the array after the method returns.

public static void whatever (int[] arr) {

int i = 0; for (int count = 0; count < arr.length; count += 1) {

if (arr[i] % 2 != 0) {

for (int j = i; j < arr.length - 1; j += 1) {

arr[j] = arr[j + 1]; }

arr[arr.length - 1] = 0; }

else {

i += 1; }

} }

5) Write a static method getPassword that will read a users password from System.in. The user has to enter the password twice. The method should iterate the following steps as many times as necessary until the user successfully enters two values that match:

prompt the user and read the password

prompt the user and read the password again

check that the second entry matches the first

(The method has no parameters and should return the entered password as a String.) 6) Suppose that a file contains lines with a name and phone number having the format

name, xxx-xxx-xxxx

a) Create a class Contact suitable for storing a name and phone number (the phone number may be stored as a String). It should include the constructor and methods:

Contact(String givenName, String givenPhoneNumber) String getName() String getPhoneNumber() // returns phone number as String int[] getPhoneNumberArray() // returns phone number as an array of 10 ints

b) Create a class ContactDirectory suitable for storing a list of Contacts. The ContactDirectory should have the methods:

// adds the given contact to the directory void addContact(Contact c)

// add all contacts from a file of the above form void addFromFile(String filename) throws FileNotFoundException

// returns phone number for name, or void if name is not in the list String lookUp(String name)

7. a) Given the method mystery below, determine the output printed by the call mystery(10). (It might be helpful to sketch the call stack as you go.)

public static void mystery(int x) {

if (x == 1) {

System.out.println("pooh"); }

else if (x % 2 == 0) {

System.out.println(x); (**)

mystery(x / 2); (*) }

else {

mystery(x - 1); }

}

b) Suppose we have a method mystery2 that is the same as mystery except that the lines labeled (*) and (**) are switched. Trace the call mystery2(10).

c) What happens when you call mystery(-1) ? Explain.

8. a) A child named Beatrice is jumping along on a floor consisting of rectangular tiles. She can jump one tile, two tiles, or three tiles at a time. Write a recursive method to determine the number of different ways she can cross n tiles.

b) The streets of Manhattan are laid out in a rectangular grid. You need to walk to a destination that is r blocks to the south and c blocks to the east of your current location (where r and c are both non-negative). Assume that you never walk west or north. Write a recursive method that determines how many different routes can you take to your destination. (For example:

whenever r is zero or c is zero, there is only one possible route. If both are nonzero, you can start out going one block east, or going one block south.)

c) Write a method that, given a directory (as a File object), returns a list of names of the files beneath it whose names end with ".java" (within it, within its subdirectories, and so on). It might help to define a recursive helper method of the form

private void findJavaFiles(File file, ArrayList results) Note that the class java.io.File includes the following methods:

String getName() returns the name of this File boolean isDirectory() returns true if this File represents a directory File[] listFiles() returns an array of all items (files and directories) in this File; returns null if this File is not a directory