EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
EBK BIG JAVA: EARLY OBJECTS, INTERACTIV
6th Edition
ISBN: 8220102010314
Author: Horstmann
Publisher: YUZU
Question
Book Icon
Chapter 21, Problem 1PP
Program Plan Intro

Random monoalphabet cipher

Program plan:

  • In the file MonoalphabetCipher.java”, import necessary packages and create a class MonoalphabetCipher”,
    • Declare the arrays.
    • Define the constructor to initialize the arrays.
    • Define the method “contains()” that returns true, if there is a specified value otherwise returns false.
    • Define the method “processStream()” to process the contents of a stream.
    • Define the method “process()” to process a byte.
    • Define the method “encryptStream()” to encrypts the contents of a stream.
    • Define the method “decryptStream()” to decrypt the contents of a file.
  • In the file Encryptor.java”, import necessary packages and create a class Encryptor”,
    • Define the method “main()”,
      • Initialize the necessary variables.
      • Execute “try” statement,
        • Execute “while” loop till the length of the argument,
          • If the argument id “d”,
            • Set the Boolean value to true.
          • Otherwise 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.
          • If decrypt,
            • Call the method “decryptStream()”.
          • Otherwise,
            • Call the method “encryptStream()”.
          • Close the input and output file.
      • Catch if exception occur,
        • Handle the exception.

Blurred answer
Students have asked these similar questions
the nagle algorithm, built into most tcp implementations, requires the sender to hold a partial segment's worth of data (even if pushed) until either a full segment accumulates or the most recent outstanding ack arrives. (a) suppose the letters abcdefghi are sent, one per second, over a tcp connection with an rtt of 4.1 seconds. draw a timeline indicating when each packet is sent and what it contains.
Just need some assistance with number 3 please, in C#
How do we find the possible  final values of variable x in the following program.   Int x=0; sem  s1=1, s2 =0;   CO P(s2); P(s1); x=x*2; V(s1); // P(s1); x=x*x; V(s1); // P(s1); x=x+3; V(s2); V(s1); Oc
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