Professional Documents
Culture Documents
Mzumbe University
Faculty of Science and Technology
Ict 215:Discrete Mathematics Tutorial sheet 1
Propositional Logic
1. Translate this proposition into English sentence (p ^ :q) _ q, where p denotes the statement \My program
runs "and q denotes the statement \My program contains bugs ".
2. Express this proposition in symbolic form and hence construct its truth table to show whether it is a tautology
or contradiction or contingency. \If Brian and Angela are not happy, then either Brian is not happy or Angela
is not happy ".
3. Express this proposition into symbolic form and hence construct its truth table to show whether it is a tautology
or contradiction or contingency. \It is raining and windy, and it is not raining ".
4. Show whether the following propositions are logically equivalent or not. \P1 : It is not the case that both the
input le and the output le are not on the disk ", and \P2 : Either the input le or the output le is on the disk ".
5. Write down the English sentence for the converse, inverse and contrapositive of \If 250 is divisible by 4, then
250 is an even number ".
6. Use the laws of logic to simplify the following expression. p _ :(:p ! q).
7. An algorithm contains the following line.
\If not (x > 5 and x 10) then..."
How could this be written more simply?
8. Use the laws of logic to show that [(p ! q) ^ :q] ! :p is a tautology.
9. Determine whether the following argument is valid.
\The le is either a binary or a text le. If it is a binary le, then my program won't accept it. My program will
accept the le. Therefore the le is a text le."
10. Let p and q be the proposition \Swimming at New Jersey shores is allowed "and \Sharks have been spotted near
the shore ", respectively. Express each of these compound propositions as an English sentence.