Let the message be M : 1001 0001 and the generator function is G : 1001
Solution :
CRC sender
<u> </u>
1001 | 1001 0001 000
<u> 1001 </u>
<u> 0000 0001 </u>
1000
<u> 1001 </u>
0001 000
<u> 1 001 </u>
0001
Here the generator is 4 bit - 1, so we have to take three 0's which will be replaced by reminder before sending to received--
eg 1001 0001 001
Now CRC receiver
<u> </u>
1001 | 1001 0001 001
<u> 1001 </u>
0000 0001
<u> 1001 </u>
1000
<u> 1001 </u>
0001 001
<u> 0001 001 </u>
0000
No error
Answer:
A b output 0110111111001111
Answer:
The output is attached below
Explanation:
d = {}
while True:
line = input("Enter line: ")
if len(line)==0:
break
token = line.split(' ')
for var in token:
try:
if len(var)==0:
continue
count = d[var]
d[var] = count + 1
except KeyError:
d[var] = 1
pass
for word in sorted(d):
print(word , d[word])
------------------
Answer:
yessss I tooo have a fire at my home
lolololololololololo
ok have a great day what is your name ?
