Blog 1: a better way to store *at least* 80 characters worth of data on punch cards
We thought a better way of using punch cards would be as follows. The letters a-j would have the "x" row punched and then the number the letter corresponds with the letter in the sequence. For example the letter "a" would have an "x" punch and the number "1" punched. Letters k-t would be identifiable because they would have the "y" row punched and then the number that corresponds with the letter in the sequence. For example "n" would be represented by a "y" punch and the number "4" punched. The letters u-z would have the "0" row punched plus the number it is represented by in the sequence. For example "w" would be a "o" punch and a "3" punch. Numbers would be represented by single punches of the number itself (0-9) and punctionation marks would be represented with 3 punches, since no letters or numbers have 3 punches in a column.
** the word "lorem" would have a code of (y,2) (y,5) (y,8) (x, 5) (y, 3)**
Blog 2: translate this binary code into text
I searched on googled "ASCII binary code chart" and clicked on the first website (http://www.pcguide.com/res/tablesASCII-c.html). From there, we were able to figure out what letters the sets of bytes represented (8 bits in a byte). There were different codes for different letters, lower and upper case. We also found a calculator that translated our code into text (http://www.roubaixinteractive.com/PlayGround/Binary_Conversion/Binary_To_Text.asp). The binary code we were given tells us to "Be sure to drink your Ovaltine."
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment