Question: Given this empty shell code I need help with this problem. Language is C++ please, thank you. // Place your information here #include int main()
Given this empty shell code I need help with this problem. Language is C++ please, thank you.
| // Place your information here | |
| #include | |
| int main() { | |
| return 0; | |
| } |
|
|
Part B: Rot13 Encoding/decoding (rotl3.cpp) - Milestone Part B Obiective: The goal of part B is to create a program to encode files and strings using the rot13 encoding method. Information about the rot13 method can be found at http://www.rot13.com Implement the rot13 algorithm using functions, strings and file l/O. You program should use at least 3 to 4 functions. It should be able to read in a text file from a specified filename, encode using rot13, and write it to a specified file. It should be able to decrypt it in the same way. The starter code for rot13 is rot13.cpp which is mostly an empty shell. You will need to provide the file I/O and the functions that implements the rot13 algorithm. Note: rot13 is very specific version of the Caesar cipher. The rot13 algorithm just simply rotates each individual alphabetic character by 13 characters. It leaves the numbers, punctuation, etc alone. To "encrypt" you just rotate each character by 13 characters. To "decrypt" you just rotate (in either direction) the characters by 13 as well. Please preserve the case of the rotated letter. You may want to convert all lowercase to uppercase characters before performing math on them to avoid overflows. You will want to convert them back to lowercase when done. Example 1: Given the letter 'a' the encrypted letter becomes 'a' 13 110 or 'n' Given encrypted letter 'n' than 'n'13 (or 123) is greater than 'z' so it wraps around (in this case back to 'a If using a char data type, the above would "overflow" and become a negative number. It is suggested that you convert lowercase characters to uppercase before performing the rotation
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts


