Big Java, Binder Ready Version: Early Objects
Big Java, Binder Ready Version: Early Objects
6th Edition
ISBN: 9781119056447
Author: Cay S. Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 7, Problem 9PP
Program Plan Intro

Video poker

Program plan:

  • In a file “Card.java”, import necessary packages and create a class “Card”,
    • Declare the variable to number the card is, 1 – 13
    • Declare the variable that suit of the card, 0 - spades, 1 - hearts, 2 - clubs, 3 - diamonds
    • Create random object.
    • Define the constructor,
      • Set the initial values.
    • Define a method “toString()”,
      • Declare string variable .
      • Check whether the number is “1”,
        • Update the output.
          • Check whether the number is “11”,
            • Update the output.
          • Otherwise, check whether the number is “12”,
            • Update the output.
          • Otherwise, check whether the number is “13”,
            • Update the output.
          • Otherwise,
            • Update the output.
          • Check whether the suit is “0”,
            • Update the output.
          • Otherwise, check whether the suit is “1”,
            • Update the output.
          • Otherwise, check whether the suit is “2”,
            • Update the output.
          • Otherwise, check whether the suit is “3”,
            • Update the output.
          • Return the output.
    • Define a method “generateDeck()” to return the deck of cards.
    • Define a method “shuffleDeck()”,
      • Create ArrayList.
      • Execute loop that remove each card randomly and put into another deck,
        • Call the method “add()” to add the removed card into the list.
          • Execute loop to remove each card randomly from the other deck and put back into the original,
            • Call the method “add()” to add the removed card into the deck.
  • In a file “PlayPoker.java”, import necessary packages and create a class “PlayPoker”,
    • Declare ArrayList for deck of cards for the game
    • Declare the tokens the player has remaining.
    • Declare the player's hand of cards.
    • Define the method “displayHand()”,
      • Print the message.
      • Create a loop,
        • Check the condition,
          • Print the value.
              • Check another condition,
                • Print the symbol “|”.
      • Print new line.
    • Define the method “showCardMenu()”,
      • Prompt the user a input.
      • Print the required strings.
      • Get the input from the user and return the action.
    • Define the method “runGame()”,
      • Print the message.
      • Create a loop,
        • Compute the hand.
      • Show players their hand.
      • Get the decision about the card to ignore.
      • Call the method “displayHand()”.
      • Determine tokens gained by resulting hand.
      • Check if hand is flush.
      • Execute for flush,
        • Execute for straight,
          • Check the condition,
            • Return the value “250”.
                • Otherwise,
                  • Return the value “50”.
              • Otherwise, return the value “5”.
      • Check for largest amount of the same number.
      • Return the score based on the largest of the same.
    • Define the method “showGameMenu()”,
      • Print the menu.
      • Get the choice from the user.
      • Return the action.
    • Define the method “main()”,
      • Create “Scanner” object.
      • Create “Card” object.
      • Assign the value returned from the method “generateDeck()”.
      • Call the method “shuffleDeck()”.
      • Execute do- while loop,
        • Construct an object for “PlayPoker”.
        • Assign the value returned from the method “showGameMenu()”.
        • Check if action is “1”,
          • Decrement the token.
          • Assign the value returned from the method “runGame()”.
          • Update the token.
          • Print the output message.
              • Check if token is less than “1”,
                • Print another output message.
                • Set the action to “0”.

Blurred answer
Students have asked these similar questions
Activity No. Activity Time (weeks) Immediate Predecessors 1 Requirements collection 3 2 Requirements structuring 4 1 3 Process analysis 3 2 4 Data analysis 3 2 5 Logical design 50 3,4 6 Physical design 5 5 7 Implementation 6 6 c. Using the information from part b, prepare a network diagram. Identify the critical path.
Given the following Extended-BNF grammar of the basic mathematical expressions:  Show the derivation steps for the expression: ( 2 + 3 ) * 6 – 20 / ( 3 + 1 ) Draw the parsing tree of this expression. SEE IMAGE
Whentheuserenters!!,themostrecentcommandinthehistoryisexecuted.In the example above, if the user entered the command: Osh> !! The ‘ls -l’ command should be executed and echoed on user’s screen. The command should also be placed in the history buffer as the next command. Whentheuserentersasingle!followedbyanintegerN,theNthcommandin the history is executed. In the example above, if the user entered the command: Osh> ! 3 The ‘ps’ command should be executed and echoed on the user’s screen. The command should also be placed in the history buffer as the next command. Error handling: The program should also manage basic error handling. For example, if there are no commands in the history, entering !! should result in a message “No commands in history.” Also, if there is no command corresponding to the number entered with the single !, the program should output "No such command in history."

Chapter 7 Solutions

Big Java, Binder Ready Version: Early Objects

Ch. 7.2 - Prob. 11SCCh. 7.2 - Prob. 12SCCh. 7.3 - Prob. 13SCCh. 7.3 - Prob. 14SCCh. 7.3 - Prob. 15SCCh. 7.3 - Prob. 16SCCh. 7.3 - Prob. 17SCCh. 7.3 - Prob. 18SCCh. 7.3 - Prob. 19SCCh. 7.4 - Prob. 20SCCh. 7.4 - Prob. 21SCCh. 7.4 - Prob. 22SCCh. 7.4 - Prob. 23SCCh. 7.4 - Prob. 24SCCh. 7.5 - Prob. 25SCCh. 7.5 - Prob. 26SCCh. 7.5 - Prob. 27SCCh. 7.5 - Prob. 28SCCh. 7.5 - Prob. 29SCCh. 7.6 - Prob. 30SCCh. 7.6 - Prob. 31SCCh. 7.6 - Prob. 32SCCh. 7.6 - Prob. 33SCCh. 7.6 - Prob. 34SCCh. 7.7 - Declare an array list of integers called primes...Ch. 7.7 - Prob. 36SCCh. 7.7 - Prob. 37SCCh. 7.7 - Prob. 38SCCh. 7.7 - Prob. 39SCCh. 7.7 - Prob. 40SCCh. 7.7 - Prob. 41SCCh. 7.8 - Prob. 42SCCh. 7.8 - Prob. 43SCCh. 7.8 - Prob. 44SCCh. 7 - Prob. 1RECh. 7 - Prob. 2RECh. 7 - Write a program that contains a bounds error. Run...Ch. 7 - Write a loop that reads ten numbers and a second...Ch. 7 - Prob. 5RECh. 7 - Consider the following array: int[] a = { 1, 2, 3,...Ch. 7 - Consider the following array: int[] a = { 1, 2, 3,...Ch. 7 - Prob. 8RECh. 7 - Write Java code for a loop that simultaneously...Ch. 7 - What is wrong with each of the following code...Ch. 7 - Write enhanced for loops for the following...Ch. 7 - Rewrite the following loops without using the...Ch. 7 - Rewrite the following loops using the enhanced for...Ch. 7 - What is wrong with each of the following code...Ch. 7 - For the operations on partially filled arrays...Ch. 7 - Trace the flow of the loop in Section 7.3.4 with...Ch. 7 - Prob. 17RECh. 7 - Prob. 18RECh. 7 - Trace the algorithm for removing an element...Ch. 7 - Give pseudocode for an algorithm that rotates the...Ch. 7 - Prob. 21RECh. 7 - Suppose values is a sorted array of integers. Give...Ch. 7 - A run is a sequence of adjacent repeated values....Ch. 7 - What is wrong with the following method that aims...Ch. 7 - You are given two arrays denoting x- and...Ch. 7 - Solve the quiz score problem described in Section...Ch. 7 - Prob. 27RECh. 7 - Develop an algorithm for finding the most...Ch. 7 - Write Java statements for performing the following...Ch. 7 - Prob. 30RECh. 7 - Section 7.7.7 shows that you must be careful about...Ch. 7 - True or false? All elements of an array are of the...Ch. 7 - How do you perform the following tasks with array...Ch. 7 - Prob. 34RECh. 7 - Prob. 35RECh. 7 - Prob. 36RECh. 7 - Write a program that initializes an array with ten...Ch. 7 - Modify the LargestInArray.java program in Section...Ch. 7 - Write a method sumWithoutSmallest that computes...Ch. 7 - Add a method removeMin to the Student class of...Ch. 7 - Prob. 5PECh. 7 - Write a method that reverses the sequence of...Ch. 7 - Write a program that produces ten random...Ch. 7 - Write a method that implements the algorithm...Ch. 7 - Prob. 9PECh. 7 - Prob. 10PECh. 7 - Consider the following class: public class...Ch. 7 - Add a method public boolean sameValues(Sequence...Ch. 7 - Add a method public boolean sameValues(Sequence...Ch. 7 - Prob. 14PECh. 7 - Prob. 15PECh. 7 - Add a method to the Table class below that...Ch. 7 - Given the Table class of Exercise E7.16, add a...Ch. 7 - Prob. 18PECh. 7 - Prob. 19PECh. 7 - Prob. 20PECh. 7 - Improve the program of Exercise E7.17 by adding...Ch. 7 - Consider the following class: public class...Ch. 7 - Prob. 23PECh. 7 - Prob. 24PECh. 7 - Prob. 1PPCh. 7 - Prob. 2PPCh. 7 - Prob. 3PPCh. 7 - Prob. 4PPCh. 7 - Prob. 5PPCh. 7 - Prob. 6PPCh. 7 - Prob. 7PPCh. 7 - Prob. 8PPCh. 7 - Prob. 9PPCh. 7 - Prob. 10PPCh. 7 - A pet shop wants to give a discount to its clients...Ch. 7 - Prob. 12PPCh. 7 - Prob. 13PPCh. 7 - Prob. 14PPCh. 7 - Prob. 15PPCh. 7 - Prob. 16PPCh. 7 - Prob. 17PPCh. 7 - Prob. 18PPCh. 7 - Prob. 19PPCh. 7 - Prob. 20PPCh. 7 - Prob. 21PPCh. 7 - Prob. 22PPCh. 7 - Prob. 23PPCh. 7 - Prob. 24PPCh. 7 - Prob. 25PP
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education