Turn in a one-page synopsis of what you are doing for your Projects B and C.
A so-called Caesar cipher is a simple coding scheme that shifts all the letters of the alphabet by a fixed amount. For example, a Caesar cipher with shift 3 is defined by A->D, B->E, and so on. The end of the alphabet is wrapped around to the beginning, so the word SYZYGY would be transformed to VBCBJB.
Write Maple procedures to implement a Caesar cipher with an
arbitrary shift. That is, one of the input variables should be the
amount k of the shift. You should have a procedure to
encode a message, and a procedure to decode a message.
Hint: do you really need two different procedures?
For simplicity, you may use an alphabet consisting of all capital letters, and you may ignore punctuation.
Illustrate your procedure by encoding a sample message and then decoding it again. Turn in hard copy of your Maple worksheet.
Continue to work on the projects.
Created Oct 13, 1996.
Last modified Nov 6, 1996
by boas@tamu.edu.
URL: /~harold.boas/courses/696-96c/class10/homework.html
Copyright © 1996 by Harold P. Boas.
All rights reserved.