Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 22, Problem 4PE
Program Plan Intro

Error checking

Program plan:

Filename: “BankAccount.java”

  • Include the header files in the program
  • Define the “BankService” class
    • Declare the required variables
    • Define the constructor
      • Set the values
    • Define the parameterized constructor
      • Set the value
    • Define the “deposit” method
      • Call the method
      • In “try” block,
        • Calculate the new balance
        • Set the balance
          • In finally block, call the method
    • Define the “withdraw” method
      • Call the method
      • In “try” block,
        • Check the “amount” is greater than “balance”
          • Throw “InsufficientFundsException” exception
        • Check the “amount” is less than 0
          • Throw “InsufficientFundsException” exception
          • Calculate the new balance
          • Set the balance
            • In finally block, call the method
    • Define “getBalance ()” method
      • Return the balance

Filename: “BankService.java”

  • Include the required header files
  • Define the class “BankService”
    • Define the “main” method
      • Declare the required variables.
      • Define the constructor
        • Set the values
      • Define the “run ()” method
        • In try block,
          • Create the objects for “Scanner” and “PrintWriter” class in another “try” block.
            • Call “doService()” method
          • Finally, close the connection
              • In catch block, throw an exception
      • Define the “doService ()” method
        • Execute all command until the QUIT command or the end of input
        • Declare the string variable
        • In “try” block,
          • Call the “executeCommand ()” method and store the result in “response” variable
              • In “catch” block, throw “InsufficientFundsException”, “InvalidCommandException”, and “NoSuchAccountException”.
              • Print the response
      • Define the “executeCommand ()” method
        • Check the condition
          • Throw “InvalidCommandException”
              • Get the account number
              • Check “command” is equal to “DEPOSIT”
                • Get the amount
                • Call “deposit ()” method in “Bank” class
              • Check “command” is equal to “WITHDRAW”
                • Get the amount
                • Call “withdraw ()” method in “Bank” class.
              • Check “command” is equal to “BALANCE”
                • Print the invalid message
                • Call the “getBalance” method and store the result
                • Return the value
              • Print the balance

Filename: “InsufficientFundsException.java”

  • Define the “InsufficientFundsException” class
    • Define the constructor
      • Call the “super” method

Filename: “InvalidCommandException.java”

  • Define the “InvalidCommandException” class
    • Define the constructor
      • Call the “super” method

Filename: “NoSuchAccountException.java”

  • Define the “NoSuchAccountException” class
    • Define the constructor
      • Call the “super” method

Blurred answer
Students have asked these similar questions
1.) Consider the problem of determining whether a DFA and a regular expression are equivalent. Express this problem as a language and show that it is decidable. ii) Let ALLDFA = {(A)| A is a DFA and L(A) = "}. Show that ALLDFA is decidable. iii) Let AECFG = {(G)| G is a CFG that generates &}. Show that AECFG is decidable. iv) Let ETM {(M)| M is a TM and L(M) = 0}. Show that ETM, the complement of Erm, is Turing-recognizable. Let X be the set {1, 2, 3, 4, 5} and Y be the set {6, 7, 8, 9, 10). We describe the functions f: XY and g: XY in the following tables. Answer each part and give a reason for each negative answer. n f(n) n g(n) 1 6 1 10 2 7 2 9 3 6 3 8 4 7 4 7 5 6 5 6 Aa. Is f one-to-one? b. Is fonto? c. Is fa correspondence? Ad. Is g one-to-one? e. Is g onto? f. Is g a correspondence? vi) Let B be the set of all infinite sequences over {0,1}. Show that B is uncountable using a proof by diagonalization.
Can you find the least amount of different numbers to pick from positive numbers (integers) that are at most 100 to confirm two numbers that add up to 101 when each number can be picked at most two times?
Can you find the formula for an that satisfies the provided recursive definition? Please show all steps and justification
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