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 13, Problem 5PP
Program Plan Intro

Permutation of word

Program plan:

Filename: “NumberPermutationIterator.java”

This program file is used to define a class “NumberPermutationIterator”. In the code,

  • Import the required packages.
  • Define a class “NumberPermutationIterator”.
    • Create an integer array “a”.
    • Define the “NumberPermutationIterator()” constructor.
      • Set the size of the array as “n”.
      • Iterate a “for” loop up to “i<n”.
        • Set the value of “i” to array.
    • Define the “nextPermutation()” method.
      • If the length of the array is less than or equal to 1,
        • Return “a”.
      • Iterate a “for” loop,
        • If element at “i-1” is less than element at “i”.
          • Set “length-1” of the array “a”.
          • Iterate a “while” loop,
            • Decrement the value of “j” by 1.
          • Call the method “swap()”.
          • Call the method “reverse()”.
          • Return the value of “a”.
      • Return the value of “a”.
    • Define the “hasMorePermutation()” method.
      • If the length of the array is less than or equal to 1,
        • Return “false”.
      • Iterate a “for” loop,
        • If element at “i-1” is less than element at “i”.
          • Return “true”.
      • Return “false”.
    • Define the “swap()” method.
      • Swap the elements of the array
    • Define the “reverse()” method.
      • While “i” less than “j”,
        • Call the method “swap()”.
        • Increment the value of “i” by 1.
        • Decrement the value of “j” by 1.

Filename: “PermutationIterator.java”

This program file is used to define a class “PermutationIteratorDemo”. In the code,

  • Import the required packages.
  • Define a class “PermutationIteratorDemo”.
    • Define the “main” method.
      • Define the object “iter” of “PermutationIterator”.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.
      • Call the method “nextPermutation()” using “iter” and return the value.
      • Print the expected value.

Blurred answer
Students have asked these similar questions
3. Problem Description: Define the Circle2D class that contains: Two double data fields named x and y that specify the center of the circle with get methods. • A data field radius with a get method. • A no-arg constructor that creates a default circle with (0, 0) for (x, y) and 1 for radius. • A constructor that creates a circle with the specified x, y, and radius. • A method getArea() that returns the area of the circle. • A method getPerimeter() that returns the perimeter of the circle. • • • A method contains(double x, double y) that returns true if the specified point (x, y) is inside this circle. See Figure (a). A method contains(Circle2D circle) that returns true if the specified circle is inside this circle. See Figure (b). A method overlaps (Circle2D circle) that returns true if the specified circle overlaps with this circle. See the figure below. р O со (a) (b) (c)< Figure (a) A point is inside the circle. (b) A circle is inside another circle. (c) A circle overlaps another…
1. Explain in detail with examples each of the following fundamental security design principles: economy of mechanism, fail-safe default, complete mediation, open design, separation of privilege, least privilege, least common mechanism, psychological acceptability, isolation, encapsulation, modularity, layering, and least astonishment.
Security in general means the protection of an asset. In the context of computer and network security, explore and explain what assets must be protected within an online university. What the threats are to the security of these assets, and what countermeasures are available to mitigate and protect the organization from such threats. For each of the assets you identify, assign an impact level (low, moderate, or high) for the loss of confidentiality, availability, and integrity. Justify your answers.

Chapter 13 Solutions

Big Java, Binder Ready Version: Early Objects

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