Answer:
This is not true
Explanation:
The optimal Huffman code is used to encrypt and compress text files. It uses fixed-length code or variable-length code for encryption and compression of data.
The professor's character code is similar to Huffman's variable-length coding which uses variable length od binary digits to represent the word strings. The file size of the text file above is;
= 6 x 1 + 2 x 2 + 3 x 2 + 2 x 2 + 8 x 1 = 28 bits
This would be the same for both cases.
The encrypt would be the problem as the encoded and decoding of the characters B and E may cause an error.
Answer:
Explanation:
The following code is written in Python and is a function that loops three times asking for the last name and first name. Then it uses this information to create a username. Finally, each of the names and usernames is printed on the screen.
def userName():
for x in range(3):
last_name = input("What is your last name: ")
first_name = input("What is your first name: ")
username = first_name[:3] + "#" + last_name[-3:]
print(last_name + ", " + first_name)
print(username)
hola no conozco el toldo, pero necesito puntos cerebrales tan lo siento
