BIG JAVA: LATE OBJECTS
BIG JAVA: LATE OBJECTS
2nd Edition
ISBN: 9781119626220
Author: Horstmann
Publisher: WILEY
Question
Book Icon
Chapter 20, Problem 4PP
Program Plan Intro

Playfair cipher

Program plan:

  • In the file PlayfairCipher.java”, import necessary packages and create a class PlayfairCipher”,
    • Declare a string variable, and a 2D array.
    • Define the constructor to initialize the array.
    • Define the method “processStream()” to process the contents of a stream.
    • Define the method “process()” to process a stream.
    • Define the method “makeEncryptionKey()” to make an encryption key.
    • Define the method “found()” to determine if a character is found.
  • In the file Encryptor.java”, import necessary packages and create a class Encryptor”,
    • Define the method “main()”,
      • Initialize the necessary variables.
      • Execute “try” statement,
        • Initialize the variable.
        • Execute “while” loop till the length of the argument,
          • Check if the argument is “-k”,
            • Increment the value by 1.
            • Check the condition,
              • If it is true, set the key.
          • Otherwise, if the input file is null,
            • Get the input file.
          • Otherwise, if the output file is null,
            • Get the output file.
        • If either the input or output or key is null,
          • Print the string.
        • Otherwise,
          • Create the input stream.
          • Create the output stream.
          • Create an object for “PlayfairCipher”.
          • Call the method “processStream()”.
          • Close the input and output file.
      • Catch if exception occur,
        • Handle the exception.

Blurred answer
Students have asked these similar questions
S A B D FL I C J E G H T K L Figure 1: Search tree 1. Uninformed search algorithms (6 points) Based on the search tree in Figure 1, provide the trace to find a path from the start node S to a goal node T for the following three uninformed search algorithms. When a node has multiple successors, use the left-to-right convention. a. Depth first search (2 points) b. Breadth first search (2 points) c. Iterative deepening search (2 points)
We want to get an idea of how many tickets we have and what our issues are. Print the ticket ID number, ticket description, ticket priority, ticket status, and, if the information is available, employee first name assigned to it for our records. Include all tickets regardless of whether they have been assigned to an employee or not. Sort it alphabetically by ticket status, and then numerically by ticket ID, with the lower ticket IDs on top.
Figure 1 shows an ASM chart representing the operation of a controller. Stateassignments for each state are indicated in square brackets for [Q1, Q0].Using the ASM design technique:(a) Produce a State Transition Table from the ASM Chart in Figure 1.(b) Extract minimised Boolean expressions from your state transition tablefor Q1, Q0, DISPATCH and REJECT. Show all your working.(c) Implement your design using AND/OR/NOT logic gates and risingedgetriggered D-type Flip Flops. Your answer should include a circuitschematic.
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