Big Java Late Objects
Big Java Late Objects
2nd Edition
ISBN: 9781119330455
Author: 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
1. Complete the routing table for R2 as per the table shown below when implementing RIP routing Protocol? (14 marks) 195.2.4.0 130.10.0.0 195.2.4.1 m1 130.10.0.2 mo R2 R3 130.10.0.1 195.2.5.1 195.2.5.0 195.2.5.2 195.2.6.1 195.2.6.0 m2 130.11.0.0 130.11.0.2 205.5.5.0 205.5.5.1 R4 130.11.0.1 205.5.6.1 205.5.6.0
Analyze the charts and introduce each charts by describing each. Identify the patterns in the given data. And determine how are the data points are related.   Refer to the raw data (table):
3A) Generate a hash table for the following values: 11, 9, 6, 28, 19, 46, 34, 14. Assume the table size is 9 and the primary hash function is h(k) = k % 9. i) Hash table using quadratic probing ii) Hash table with a secondary hash function of h2(k) = 7- (k%7) 3B) Demonstrate with a suitable example, any three possible ways to remove the keys and yet maintaining the properties of a B-Tree. 3C) Differentiate between Greedy and Dynamic Programming.
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