* AHPA #5: Caesar's Cipher * * Open the file "clearMessage.txt". * * Read each character of text using fgetc. * * Convert each ASCII character to its numeric equivalent. * * Apply the Caesar Cipher and increment each character by 3. * * Only convert alphabetic characters – leave all other characters * unchanged. * * Convert each character back to its ASCII value. * * Write the encoded message out to the file "secretMessage.txt". use c language

* AHPA #5: Caesar's Cipher * * Open the file "clearMessage.txt". * * Read each character of text using fgetc. * * Convert each ASCII character to its numeric equivalent. * * Apply the Caesar Cipher and increment each character by 3. * * Only convert alphabetic characters – leave all other characters * unchanged. * * Convert each character back to its ASCII value. * * Write the encoded message out to the file "secretMessage.txt". use c language

EBK JAVA PROGRAMMING

9th Edition

ISBN:9781337671385

Author:FARRELL

Publisher:FARRELL

Chapter13: File Input And Output

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

13. The reciprocal Fibonacci constant y is defined by the infinite sum: Σ. where F, are the Fibonacci numbers 1, 1, 2, 3, 5, 8, 13, ... . Each element in this sequence of numbers is the sum of the previous two. Start by setting the first two elements equal to 1, then F, = F-1+ Fn-2. Write a MATLAB pro- gram in a script file that calculates y for a given n. Execute the program for n = 10, 50, and 100. 14. The value of t can be estimated from: (-1)" 32 n=0 (2n+1)* Write a program (using a loop) that determines t for a given n. Run the pro- gram with n = 10, n = 100, and n = format long.) 1,000. Compare the result with pi. (Use
Instructions in python: Create a compression algorithm that will compress the text "nnneennwnneeeennwwnneeeessseeenneeesswsswwwsssswww" in the parchment piece into a smaller form. The algorithm must include simple instructions of no more than 1 or 2 sentences. It is recommended that you use basic ASCII characters, as the focus here is the algorithm rather than the physical space occupied by the result. Create a copy of this spreadsheet to organize your results and calculate the compression ratios. After working for about 10 minutes, you can access a clue: 2D Map. After another 10 minutes, you can view the 2D Map with Terrain. There are many correct answers to this exercise.
Implement the following programs in cpp code; Write a program to convert all the characters in uppercase in a file txt. Write a program to find a string “is” from a file txt. Write a program that takes input in 100 students(id, name, age, gender) and write their data in file student.txt and find from file how many students are of age 18. Write a program that takes input in 50 employees(id, name, salary, age) and write their data in file employee.txt and find from file salary of an employee with id 13.
9. You want to know how many people there are in the US with your last name. So fromthe government’s census site (http://www.census.gov/) you have downloaded last namestatistics and put them in the file last.txt. Each line contains a last name (in all upper case)and a percentage. Here is the beginning of the file:SMITH 0.88085JOHNSON 0.68844WILLIAMS 0.56866BROWN 0.51162...Each line contains a last name and the percentage of Americans with that last name. Forexample, 0.88085% of all Americans have SMITH as their last name. Write a functionfreq() that uses the statistics in file last.txt to compute and return the approximatenumber of people in the US having your last name. You can assume that the current USpopulation is roughly 300,000,000 (= 3*10**8).>>> freq('Smith')264255000>>> freq('Perkovic')Note that if the name is not on the list, the program doesn’t have to return anything. Yourfunction should not be case-sensitive.
Write in Golang code Using GO as the programming language --use a input file find the number of Unique words in file.text find the number of lines in file.text find the number of Empty lines in file.text find the number of punctuation in file.text How do I find the number of words in file.text How to print the first 10 and last 10 words in the file
he file “foo.txt” is exactly 16 bytes long, and contains the 16ASCII characters “Now is the time.” in that order. Suppose the code below is executed.
Using Python: Write a program that inputs a text file then counts the unique words in the file. Output each unique word and the number of times it occurs in the input file. Remove any spaces and punctuation from the data and convert each word to lowercase. https://rose.instructure.com/courses/11779/files/1799063? verifier=PeDzy 7Z2p3NhCztKp6oaEJKkUa0z7vmWRyWQFchh&wrap=1 Sample Output: a 7 above 1 add 1 advanced 1 ago 1 all 1 altogether 1 and 6 any 1 are 3
In this assignment you will write a program that encrypts a text file. You will use the following encryption scheme. 1. Ask the user for the name of the original file. 2. Ask the user for the name of the output file. 3. Ask the user for the encryption key, n. 4. Read n² characters from the file into the n rows and n columns of a 2-dimensional array row by row. 5. Write the characters from the array to an output file column by column. 6. Repeat steps 4-6 until the entire input file has been read. This same program can be used to decrypt a file that has been encrypted in this way. Your program should have functions for performing the following tasks. 1) Reading the characters from the file into the array. This function should be passed the file stream, the array and the key. 2) Writing the characters from the array to the file. This function should be passed the file stream, the array and the key. Your main function should get the filenames, open the files, get the key, dynamically…
Huffman Codes The following table gives the frequencies of each character in a file with 1,000 characters. ß ठ 3 400 50 300 a 10 Y 80 € 20 n 100 codeword). C. How many bits do we need to store the file with this Huffman code? Assume now that all the characters have the same frequency of 125. e 40 A. How many bits do we need to store the file if using a fixed-length code? B. Show the code built by the Huffman algorithm, both as a tree and a list (character,
There are six strings of length 4 which cannot be produced by the following regular expression over the alphabet Σ = {a, b}. What are they? (a+bb)*(ab+ba) (aa + b)* Please select file(s) Select file(s)
Write a python code that reads a file (contents of the file pasted below) and shows the average of all values shown in the last column. File Name: data.txt File Contents (of data.txt): Admin 100 300 tmp 20 Admin 100 300 tmp 30 Admin 100 300 tmp 20 Admin 100 300 tmp 10 Admin 100 300 tmp 60 Admin 100 300 tmp 95 Admin 100 300 tmp 100 Admin 100 300 tmp 24 Admin 100 300 tmp 99 Admin 100 300 tmp 50
3) in python Copy the Plain Text UTF-8 version of Bram Sroker’s Dracula from the site:http://www.gutenberg.org/ebooks/345 into a text document called ‘dracula.txt’. Write pythoncode that reads the text document and counts the unique words and stores the words and countsinto a dictionary. Write the words and counts into a text file called ‘dracula words.txt’ by usingthe Python file handle method seen in class. Generate a list called ‘sorted counts’ that containsthe value and key pairs as tuples that are sorted in descending order based on the frequencies ofthe words. For example, it should be in the form:[(7423, ‘the’),(5640, ‘and’),(4499, ‘I’),(4462, ‘to’),(3673, ‘of’),(2891, ‘a’),(2384, ‘in’),(ect.) Here, the word ‘the’ occurs the most frequently. Output the top 10 most frequently occurringwords. How often does the word ‘Dracula’ come up in the entire Novel?Hint: use list comprehension. For the dictionary ‘counts’ the command ‘counts.items()’ returns anobject of type dict items that…