a.
Explanation of Solution
Program:
File name: “Die.java”
//Define a class named Die
public class Die
{
//Declare the private variables and initialize the value
private int value;
private static final int HIGHEST_DIE_VALUE = 6;
private static final int LOWEST_DIE_VALUE = 1;
//Define a Die method
public Die()
{
//Calculate the value
value = ((int)(Math.random() * 100) % HIGHEST_DIE_VALUE +
LOWEST_DIE_VALUE);
}
//Define a getValue method
public int getValue()
{
//Return the value
return value;
}
}
File name: “FiveDice2.java”
//Define a class named FiveDice2
public class FiveDice2
{
//Define a main method
public static void main(String[] args)
{
//Declare a variable and initialize the value
final int NUM = 5;
//Store the five dice rolled value for computer
Die[] comp = new Die[NUM];
//Store the five dice rolled value for player
Die[] player = new Die[NUM];
//Declare a variable
int x;
//For loop to be executed until x exceeds NUM
for(x = 0; x < NUM; ++x)
{
//Allocating memory for the array objects
comp[x] = new Die();
player[x] = new Die();
}
//Declare the variables
int compMatch, playerMatch;
//Get computer name
String computerName = "Computer";
//Get player name
String playerName = "You";
//Display the message
display(computerName, comp, NUM);
display(playerName, player, NUM);
//Calls the method to find same numbers for computer
compMatch = howManySame(comp, NUM);
//Calls the method to find same numbers for player
playerMatch = howManySame(player, NUM);
//If computer has one of a kind
if(compMatch == 1)
//Print the result
System.out.println("Computer has nothing");
//Else computer has a pair, three, four, or five of a //kind
else
//Print the result
System.out.println("Computer has " + compMatch + " of a kind");
//If player has one of a kind
if(playerMatch == 1)
//Print the result
System.out.println("You have nothing");
//Else player has a pair, three, four, or five of a kind
else
//Print the result
System.out.println("You have " + playerMatch + " of a kind");
//If any higher combination of computer beats a lower //one of player
if(compMatch > playerMatch)
//Print the result
System...
b.
Explanation of Solution
Program:
File name: “Die.java”
//Define a class named Die
public class Die
{
//Declare the private variables and initialize the value
private int value;
private static final int HIGHEST_DIE_VALUE = 6;
private static final int LOWEST_DIE_VALUE = 1;
//Define a Die method
public Die()
{
//Calculate the value
value = ((int)(Math.random() * 100) % HIGHEST_DIE_VALUE +
LOWEST_DIE_VALUE);
}
//Define a getValue method
public int getValue()
{
//Return the value
return value;
}
}
File name: “FiveDice3.java”
//Define a class named FiveDice3
public class FiveDice3
{
//Define a main method
public static void main(String[] args)
{
//Declare a variable and initialize the value
final int NUM = 5;
//Store the five dice rolled value for computer
Die[] comp = new Die[NUM];
//Store the five dice rolled value for player
Die[] player = new Die[NUM];
//Declare a variable
int x;
//For loop to be executed until x exceeds NUM
for(x = 0; x < NUM; ++x)
{
//Allocating memory for the array objects
comp[x] = new Die();
player[x] = new Die();
}
//Declare the variables
int compMatch, playerMatch;
int compHigh, playerHigh;
//Get computer name
String computerName = "Computer";
//Get player name
String playerName = "You";
//Display the message
display(computerName, comp, NUM);
display(playerName, player, NUM);
//Calls the method to find same numbers for computer
compMatch = howManySame(comp, NUM);
//Calls the method to find same numbers for player
playerMatch = howManySame(player, NUM);
//Compute the value
compHigh = compMatch / 10;
playerHigh = playerMatch / 10;
compMatch = compMatch % 10;
playerMatch = playerMatch % 10;
//If computer has one of a kind
if(compMatch == 1)
//Print the result
System.out.println("Computer has nothing");
//Else computer has a pair, three, four, or five of a //kind
else
//Print the result
System.out.println("Computer has " + compMatch + " of a kind");
//If player has one of a kind
if(playerMatch == 1)
//Print the result
System.out.println("You have nothing");
//Else player has a pair, three, four, or five of a kind
else
//Print the result
System.out.println("You have " + playerMatch + " of a kind");
//If any higher combination of computer beats a lower one of player
if(compMatch > playerMatch)
//Print the result
System.out.println("Computer wins");
//Else
else
//If any higher combination of player beats
//a lower one of computer
if(compMatch < playerMatch)
//Print the result
System.out.println("You win");
//Else
else
{
//If values of computer are greater than player's value
if(compHigh > playerHigh)
//Print the result
System...

Trending nowThis is a popular solution!

Chapter 8 Solutions
MINDTAPV2.0 JAVA PROGRAMMING 2021, 1TERM
- Now unmount the filesystem. Create a sparse image file, called book.img, of the 2GiB hard drive. Use a hexdump program to look at book.img and work out the offsets that store the contents of the book youdownloaded. Record the offsets as a sequence of one or more ranges of hexadecimal numbers. For example, in the following hexdump the text The rain in Spain falls mainly on the plain. is stored at 0x10-0x1f, 0x30-0x4b (inclusive). 00000000: 0000 0000 0000 0000 0000 0000 0000 0000 .................00000010: 5468 6520 7261 696e 2069 6e20 5370 6169 The rain in Spai00000020: 0000 0000 0000 0000 0000 0000 0000 0000.................00000030: 6e20 6661 6c6c 7320 6d61 696e 6c79 206f n falls mainly 000000040: 6e20 7468 6520 706c 6169 6e2e 0000 0000 n the plain........ Compress the filesystem using gzip by running: #gzip book.img This should leave you with a file book.img.gz. You will use scp to transfer this file in a later task. Enter your ranges in answers2.json as the answer for question1. To…arrow_forwardTask 4: Examine floppy.img Mount floppy.img at a suitable mountpoint inside your VM. Look inside the mountpoint directory. You should see a number of files in the top-level directory. Look inside your answers2.json at the strings labelled contentA and contentB. Exactly one of those two strings appears as the content of a file in the floppy disk's filesystem. I.e., there is a file that contains contentA or a file that contains contentB but not both. Additionally, the other string has been written into unused space of the floppy disk, so the data is in floppy.img but cannot be seen inside any of the files at the mountpoint. However it can be seen in a hexdump of floppy.img. I.e., if there is a file that contains contentA then contentB has been written into unused space. You must search through your mountpoint directory to find out which of contentA and contentB is stored in a file of the filesystem and which is stored in unused space. Suppose that contentA is stored in a file, and…arrow_forwardDownload your personalized assignment files, answers2.json and floppy.img, into your Kali Linux Vm. Use wget as before. For example, you'd use "wgetarrow_forward
- ▼ description: answer: question2: ▼ description: answer: "What are the offset ranges for the book file content within book.img?" "YOUR ANSWER GOES HERE" "What are the offset ranges for the content in unused space within floppy.img?" "YOUR ANSWER GOES HERE"arrow_forwardTask 3: Creating a Sample Hard Drive Image book.img Add a new (virtual) hard drive of capacity 2GiB to your Kali Linux VM. Create a FAT filesystem on the hard drive using mkfs. fat. Be careful to use your new 2GiB drive! It would be a good idea to use 1sblk to verify the block device name before proceeding. Mount the new hard drive at a mount point of your choice. Find a book from Project Gutenberg by an author whose last name begins with the same letter as your last name (look under "Browsing Options" and then "Authors" A-Z). Download the plain text UTF-8 and ensure it is saved into your mounted drive (it should be saved within the mount point directory). For example, using The Royal Guide to Wax Flower Modelling by Emma Peachey (a cracking read, no doubt) we can download the plain text file using:arrow_forward- Is FD A a partial or transitive dependency?- Is FD B a partial or transitive dependency?- Is FD C a partial or transitive dependency?- In what normal form is the relation Parking Tables?- Convert the relation Parking Tables to a set of 3NF relations.arrow_forward
- What happens to MAC addresses as frames travel from one node (device) to another? What happens to MAC addresses as frames travel from one network to another? What happens to IP addresses as packets travel from one node (device) to another? What happens to IP addresses as packets travel from one network to another?arrow_forwardCan you check if my explation is correct: Challenge: Assume that the assigned network addresses are correct. Can you deduce (guess) what the network subnet masks are? Explain while providing subnet mask bits for each subnet mask. [Hint: Look at the addresses in binary and consider the host ids] To assume that the network addresses are correct, we take a look at the network ID and IP addresses. Take 20.0.0.0/8, we have an /8 prefix which is Class A, that provide us with 255.0.0.0. This means that there are 24 host bits while the network bits are 8. When compared to the IP address 20.255.0.7, we can perform an additional operation with the subnet mask giving us 20.0.0.0. The same happened with 20.0.0.89, which we also got 20.0.0.0. Therefore, these two IP addresses fall within the respective /8 subnet. For 200.100.10.0/30, the /30 is Class C with a subnet mask of 255.255.255.252, meaning 30 network bits and only two host bits. When applying the subnet mask and the IP addresses…arrow_forwardIt is possible to sort an array of n values using pipeline of n filter processes.The first process inputs all the values one at a time, keep the minimum, and passes the others on to the next process. Each filter does the same thing; it receives a stream of values from the previous process, keep the smallest, and passes the others to the next process. Assume each process has local storage for only two values--- the next input value and the minimum it has seen so far. (a) Developcode for filter processes. Declare the channels and use asynchronous message passing. Hint:Define an array of channels value[n] (int), and a set of filter processes Filter[i = 0 ton-1]. Each process Filter[i] (where 0 <= i <= n-2) receives a stream of integers through channelvalue[i], keeps the smallest, and sends all other integers to channel value[i+1]. The last processFilter[n-1] receives only one integer through channel value[n-1] and does not need to send anyinteger further.arrow_forward
- EBK JAVA PROGRAMMINGComputer ScienceISBN:9781305480537Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
- Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:CengageProgramming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage LearningC++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr




