Question 1

Consider the following state of a linked list of ints.
BEFORE: $\rightarrow$ 45 $\rightarrow$ 9 $\rightarrow$
Assume that a Node class has been coded with the appropriate constructors and the methods setNext, getNext, setData, and getData. The data inside the Node class is an integer. The Node variable current is a reference to the Node containing 45. Write a few statements so that after execution of these statements, 58 and 23 have been added between 45 and 9:
AFTER: $\rightarrow$ 45 $\rightarrow$58 $\rightarrow$ 23 $\rightarrow$9 $\rightarrow$

Accepted Answer

The answer of Consider the following state of a linked...

Question 2

Consider the following state of a linked list of ints.
BEFORE: $\rightarrow$ 45 $\rightarrow$ 58 $\rightarrow$ 23 $\rightarrow$9 $\rightarrow$
Assume that a Node class has been coded with the appropriate constructors, and the methods setNext, getNext, setData, and getData. The data inside the Node class is an integer. The Node variable current is a reference to the Node containing 45. Write a few statements so that after execution of these statements, 58 and 9 have been deleted from the list:
AFTER: $\rightarrow$ 45 $\rightarrow$23 $\rightarrow$

Accepted Answer

The answer of Consider the following state of a linked...

Question 3

Assume that a PlayerNode class has been coded with the appropriate constructors and the methods setNext, getNext, setPlayer, and getPlayer. The data inside the PlayerNode class is a Player. Assume that a LinkedList class (encapsulating a list of Players) has been coded, and it has a head instance variable as a reference to the first PlayerNode in the list. Write a method inside the LinkedList class that deletes the last item in the list, returns true if this was successful, and returns false otherwise. Assume that your LinkedList class does not include the number of items as an instance variable.

Accepted Answer

The answer of Assume that a PlayerNode class has been...

Question 4

Assume that a PlayerNode class has been coded with the appropriate constructors and the methods setNext, getNext, setPlayer, and getPlayer. The data inside the PlayerNode class is a Player. Assume that a LinkedList class (encapsulating a list of Players) has been coded, and has a head instance variable as a reference to the first PlayerNode in the list. Write a method inside the LinkedList class that outputs every other Player in the list, starting with the first one. Assume that your LinkedList class does not include the number of items as an instance variable.

Accepted Answer

The answer of Assume that a PlayerNode class has been...

Question 5

Here is an example of a stack of integers represented by an array of five elements:
  A. How many elements are on the stack?
B. Show the stack after attempting to pop three times from the stack. Be sure to give the value of top.

Accepted Answer

The answer of Here is an example of a stack...

Question 6

In the code below, how many times will EXAM be printed?
for ( int i = 0; i < 5; i++ )
{
for ( int j = 0; j < 10; j++ )
{
System.out.println( "EXAM" );
}
}

Accepted Answer

The answer of In the code below, how many times...

Question 7

A method is coded as follows:
public static int foo( int n )
{
if ( n <= 0 )
return 0;
else
return ( foo( n - 1 ) + foo( n - 1 ) );
}
What is the running time of this method? Show your work.

Accepted Answer

The answer of A method is coded as follows:
public static...

Question 8

An algorithm has the following formula for its running time:
T(n) = T(n / 4) + 2
T(1) = 1
What is the running time of the algorithm in Big-Oh notation? Show your work.

Accepted Answer

The answer of An algorithm has the following formula for...

Question 9

A method is coded as follows:
public static int foo( int n )
{
if ( n < 0 )
return 0;
else
return ( 2 * foo( n - 10 ) );
}
What is the running time of this method? Show your work.

Accepted Answer

The answer of A method is coded as follows:
public static...

Question 10

Here is the code for a recursive method for binary search that is searching a sorted array of ints. The array is assumed to be sorted in ascending order.
// we are looking for the value stored in the parameter key
public static int binarySearch ( int [ ] arr, int key, int start,
int end )
{
System.out.println( "Start = " + start + "; end = " + end );
if ( start <= end )
{
int middle = ( start + end ) / 2;
if ( arr[middle] == key ) // found it at index middle
return middle;
else if ( arr[middle] > key ) // look left
return binarySearch( arr, key, start, middle - 1 );
else // look right
return binarySearch( arr, key, middle + 1, end );
}
else // not found
return -1;
}
We are running the following code:
int [ ] numbers = { 4, 6, 8, 10, 11, 12, 14, 16, 18 };
int found = binarySearch( numbers, 10, 0, 8 );
What is the output? Show what the output statement in the binarySearch method outputs. The question is not about the value of found; the value of found is 3.

Accepted Answer

The answer of Here is the code for a recursive...

Quiz 16: RGB Colors, Decimal Conversion, Java Naming, and Random Number Generation

Here is an example of a stack of integers represented by an array of five elements: A. How many elements are on the stack? B. Show the stack after attempting to pop three times from the stack. Be sure to give the value of top.

In the code below, how many times will EXAM be printed? for ( int i = 0; i < 5; i++ ) { for ( int j = 0; j < 10; j++ ) { System.out.println( "EXAM" ); } }

A method is coded as follows: public static int foo( int n ) { if ( n <= 0 ) return 0; else return ( foo( n - 1 ) + foo( n - 1 ) ); } What is the running time of this method? Show your work.

An algorithm has the following formula for its running time: T(n) = T(n / 4) + 2 T(1) = 1 What is the running time of the algorithm in Big-Oh notation? Show your work.

A method is coded as follows: public static int foo( int n ) { if ( n < 0 ) return 0; else return ( 2 * foo( n - 10 ) ); } What is the running time of this method? Show your work.