CNIT 176 data format lab

Manas Kota

Since the computer does not have a way to type in the taronite language I am using a system of letters
and numbers corresponding to the placement in the Rosetta stone.

So A1 would correspond to 00001

A2 would correspond to 01110

B1-00010

B2-10000

B3-11111000

C1-00100

C2-10011

C3-11111011

D1-01000

D2-10101

D3-11111101

E1-01011

E2-10110

E3-11111110

F1-01101

F2-11001

G1-11010

a. The message translates to E1,G1,B1,E3,B3,A1,C1

b. Each character uses a 5 bit encoding sequence so after 5 bits the program knows to go to the
next character. The only exception is when there is a series of 5 1’s. When this happens the
program knows to continue until 8 bits.
c. The only parts that still translates is a character in the middle. Translating to D3.
10111/10100/11111101/11110/00000/01001/00
d. The method to see if the entire message has been transmitted is to add a 0 to the end of each
character. Then the program counts the number of bits and divides the number by 3. If the
number is fully divisible by 3 then the entire message has been transmitted.