BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 13, Problem 26PE
Program Plan Intro

Puzzles

Program plan:

Filename: “PartialSolution.java”

This code snippet creates a class “PartialSolution”. In the code,

  • Define a class “PartialSolution”.
    • Declare the class variables.
    • Define the constructor “PartialSolution”.
      • Set the class member values.
    • Define the parameterized constructor “PartialSolution”.
      • Set the class member values.
    • Define the method “examine()”.
      • Define a string array “values”.
      • If the condition is true,
        • Return the value “CONTINUE”.
          • Set the value of “v0”.
          • Set the value of “v1”.
          • Set the value of “v2”.
          • If the condition is true,
            • Return the value of “ACCEPT”.
          • Else,
            • Return the value of “ABANDON”.
    • Define the method “extend()”.
      • Define an array list “sol”.
      • Iterate a “for” loop,
        • If the condition is true,
          • Add values to “sols”.
              • Return the values of “sols”.
    • Define a method “toString()”.
      • Set the array “values[]”.
      • Return elements of “values[]”.

Filename: “Puzzle.java”

This code snippet creates a class “Puzzle”. In the code,

  • Define a class “Puzzle”.
    • Define the class member “pieces[]”.
    • Define a constructor “Puzzle ()”.
      • Set the element of “pieces”.
      • Iterate a “for” loop,
        • Set the values of “pieces[]”.
    • Define the method “values()”.
      • Define a string array “result[]”.
      • Iterate a “for” loop,
        • Iterate inner “for” loop,
          • Get a character to variable “c”.
          • Define a Boolean variable “found”.
          • Iterate a “for” loop,
            • If the value of “c” is equal to “letterForDigit[j]”,
              • Set “found” equal to true.
              • Set the value of “result[p]”.
          • If the condition is true,
            • Set the value of “result[p]”.
      • Return the value of “result”.
    • Define the method “letters()”.
      • Define a string variable “result”.
      • Iterate a “for” loop,
        • Iterate inner “for” loop,
          • Get a character to variable “c”.
            • If the condition is true,
              • Set the value of “result”.
          • If the condition is true,
            • Set the value of “result[p]”.
      • Return the value of “result”.

Filename: “SummationPuzzle.java”

This code snippet creates a class “SummationPuzzle”. In the code,

  • Import the required packages.
  • Define a class “SummationPuzzle”.
    • Define the “main” method.
      • Prompt the user to enter the puzzle.
      • Define the object of class “Scanner”.
      • Scan for the input.
      • Print new line.
      • Call the method “solve()”.
    • Define the method “solve()”.
      • Define the variable “exam”.
      • If the value of “exam” equal to “ACCEPT”,
        • Print the value of “sol”.
          • Else if, the value of “exam” is “ABANDON”,
            • Iterate a “for” loop,
              • Call the method “solve()”.

Blurred answer
Students have asked these similar questions
Using the notation

you can select multipy options
For each of the following, decide whether the claim is True or False and select the True ones: Suppose we discover that the 3SAT can be solved in worst-case cubic time. Then it would mean that all problems in NP can also be solved in cubic time. If a problem can be solved using Dynamic Programming, then it is not NP-complete. Suppose X and Y are two NP-complete problems. Then, there must be a polynomial-time reduction from X to Y and also one from Y to X.
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