Given Information : A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Question

7. See the code below and solve the following. public class Test { public static void main(String[] args) { int result = 0; } result = fn(2,3); System.out.println("The result is: + result); // fn(x, 1) = x // fn(x, y) = fn(x, y-1) + 2, when y>1 public static int fn(int x, int y) { if (x <= 1) return x; else return fn(x, y-1) + 2; } } 7-1. This program has a bug that leads to infinite recursion. Modify fn(int x, int y) method to fix the problem. (2 point) 7-2. Manually trace the recursive call, fn(2,3) and show the output (step by step). (2 point) 7-3. Can you identify the Base Case in recursive method fn(int x, int y)? (1 point)

Answer 1

Question

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Students have asked these similar questions

7. See the code below and solve the following. public class Test { public static void main(String[] args) { int result = 0; } result = fn(2,3); System.out.println("The result is: + result); // fn(x, 1) = x // fn(x, y) = fn(x, y-1) + 2, when y>1 public static int fn(int x, int y) { if (x <= 1) return x; else return fn(x, y-1) + 2; } } 7-1. This program has a bug that leads to infinite recursion. Modify fn(int x, int y) method to fix the problem. (2 point) 7-2. Manually trace the recursive call, fn(2,3) and show the output (step by step). (2 point) 7-3. Can you identify the Base Case in recursive method fn(int x, int y)? (1 point)

6. See the code below and solve the following. import java.io.*; public class DataStream { } public static void main(String[] args) } DataOutputStream output = new DataOutputStream(new FileOutputStream("temp.dat")); output.writeUTF("Book1"); output.writeInt(85); output.writeUTF("Book2"); output.writeInt(125); output.writeUTF("Book3"); output.writeInt(70); output.close(); // ToDo: Read all data from temp.dat and print the data to the standard output (monitor) 6-1. This program has a compile error, and the message is “Unhandled exception type FileNotFoundException". How do you fix this error? (1 point) 6-2. Is FileNotFoundException a checked exception or an unchecked exception? (1 point) 6-3. What is the difference between checked exception and unchecked exception? (1 point) 6-4. Please complete the above program by reading all data from temp.dat and print the data to the standard output (monitor) by using System.out.print, System.out.println or System.out.printf method. (2 points)

Write a program that reads a list of integers from input and determines if the list is a palindrome (values are identical from first to last and last to first). The input begins with an integer indicating the length of the list that follows. Assume the list will contain a maximum of 20 integers. Output "yes" if the list is a palindrome and "no" otherwise. The output ends with a newline. Hints: - use a for loop to populate the array based on the specified size (the first number entered) - use a for loop to check first value with last value, second value with second from end, etc. - if the values do not match, set a Boolean variable to flag which statement to output (yes or no) Ex: If the input is (remember to include spaces between the numbers): 6 1 5 9 9 5 1 the output is: yes Ex: If the input is: 5 1 2 3 4 5 the output is: C++ coding

Answer 2

Question

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Answer 3

Question

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Answer 4

Question

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Expert Solution & Answer

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Answer 5

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Answer 6

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Answer 7

Chapter 6.4, Problem 6.11PP

A.

Program Plan Intro

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Answer 8

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Answer 9

B.

Program Plan Intro

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Answer 10

Expert Solution & Answer

Answer 11

Expert Solution & Answer

Answer 12

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Answer 13

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Answer 14

Trending nowThis is a popular solution!

See solution

Check out sample textbook solution

Answer 15

Trending nowThis is a popular solution!

Answer 16

Trending nowThis is a popular solution!

Answer 17

Trending nowThis is a popular solution!

Answer 18

Trending now

Answer 19

This is a popular solution!

Answer 20

See solution

Check out sample textbook solution

Answer 21

Ch. 6.1 - Prob. 6.1PP Ch. 6.1 - Prob. 6.2PP Ch. 6.1 - Prob. 6.3PP Ch. 6.1 - Prob. 6.4PP Ch. 6.1 - Prob. 6.5PP Ch. 6.1 - Prob. 6.6PP Ch. 6.2 - Prob. 6.7PP Ch. 6.2 - Prob. 6.8PP Ch. 6.4 - Prob. 6.9PP Ch. 6.4 - Prob. 6.10PP

Given Information : A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Solution Summary: The author describes a hypothetical cache that uses the high order "s" bits of an address as the set index.

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Chapter 6 Solutions

Given Information : A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Solution Summary: The author describes a hypothetical cache that uses the high order "s" bits of an address as the set index.

Given Information: A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Given Information: The following code is given: //traverse the array for(i=0;i<4096;i++) { //add array elements sum+=array[i]; } The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).

Chapter 6 Solutions

Given Information:

A hypothetical cache that uses the high order “s” bits of an address as the set index is given. For such a cache, the contiguous chunks of memory blocks are mapped to the same cache sets.

Given Information:

The following code is given:

//traverse the array

for(i=0;i<4096;i++)

{

//add array elements

sum+=array[i];

}

The code runs on a system with cache of the form(S,E,B,m)= (512,1,32,32).