What does verifying message integrity have to do with boolean simplification and truth tables?

Question

In an assignment, I have the question :

 

“Based on this assignment, I can be more confident in myself.”

Show that the message is not/is corrupted based on the following two scenarios:

1. The same message is received at the destination, and                                      (10 marks)
2. the word “more” in the above message is replaced with the word “less”.           (10 marks)

 

What is this question asking? Perhaps it wants me to convert the message into a boolean expression? Even then, how can I show that its "corrupted" or not. 

Answer 1

The message is considered as "corrupted" if in the destination we do not have the same message. The question is quite simple I believe. Do not overthink :-)