MindTapV2.0 for Farrell's Java Programming with 2021 Updates, 9th Edition [Instant Access], 1 term
MindTapV2.0 for Farrell's Java Programming with 2021 Updates, 9th Edition [Instant Access], 1 term
9th Edition
ISBN: 9780357505540
Author: Farrell; Joyce
Publisher: Cengage Learning US
bartleby

Videos

Expert Solution & Answer
Book Icon
Chapter 8, Problem 2GZ

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...

Blurred answer
Students have asked these similar questions
This is a question that I have and would like someone who has experiences with scene graphs and entity component systems to answer.For context, I am currently implementing a game engine and currently I am debating on our current design.Our current design is we have a singular game component class that every component inherits from. Where we have components like SpriteRendererComponent, Mehs Component, etc. They inherit from this GameComponent class. The point of this is being able to have O(1) access to the scene to being able to modify components to attach more components with the idea of accessing those components to specific scene objects in a scene.Now, my question is what kinds of caveauts can this cause in terms of cache coherence? I am well aware that yes its O(1) and that is great but cache coherence is going to be really bad, but would like to know more explicit details and real-life examples such as write in RAM examples on how this is bad. A follow-up question that is part…
Q4: Consider the following MAILORDER relational schema describing the data for a mail order company. (Choose five only). PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP CODES(Zip, City) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) (10 Marks) I want a detailed explanation to understand the mechanism how it is Qoh stands for quantity on hand: the other attribute names are self-explanatory. Specify and execute the following queries using the RA interpreter on the MAILORDER database schema. a. Retrieve the names of parts that cost less than $20.00. b. Retrieve the names and cities of employees who have taken orders for parts costing more than $50.00. c. Retrieve the pairs of customer number values of customers who live in the same ZIP Code. d. Retrieve the names of customers who have ordered parts from employees living in Wichita. e. Retrieve the names of customers who have ordered parts costing less…
Q4: Consider the following MAILORDER relational schema describing the data for a mail order company. (Choose five only). (10 Marks) PARTS(Pno, Pname, Qoh, Price, Olevel) CUSTOMERS(Cno, Cname, Street, Zip, Phone) EMPLOYEES(Eno, Ename, Zip, Hdate) ZIP CODES(Zip, City) ORDERS(Ono, Cno, Eno, Received, Shipped) ODETAILS(Ono, Pno, Qty) Qoh stands for quantity on hand: the other attribute names are self-explanatory. Specify and execute the following queries using the RA interpreter on the MAILORDER database schema. a. Retrieve the names of parts that cost less than $20.00. b. Retrieve the names and cities of employees who have taken orders for parts costing more than $50.00. c. Retrieve the pairs of customer number values of customers who live in the same ZIP Code. d. Retrieve the names of customers who have ordered parts from employees living in Wichita. e. Retrieve the names of customers who have ordered parts costing less than$20.00. f. Retrieve the names of customers who have not placed…
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781305480537
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
EBK JAVA PROGRAMMING
Computer Science
ISBN:9781337671385
Author:FARRELL
Publisher:CENGAGE LEARNING - CONSIGNMENT
Text book image
Microsoft Visual C#
Computer Science
ISBN:9781337102100
Author:Joyce, Farrell.
Publisher:Cengage Learning,
Text book image
Programming Logic & Design Comprehensive
Computer Science
ISBN:9781337669405
Author:FARRELL
Publisher:Cengage
CPP Function Parameters | Returning Values from Functions | C++ Video Tutorial; Author: LearningLad;https://www.youtube.com/watch?v=WqukJuBnLQU;License: Standard YouTube License, CC-BY