This preview shows page 1. Sign up to view the full content.
Unformatted text preview: CONCORDIA UNIVERSITY DEPARTMENT OF COMPUTER SCIENCE & SOFTWARE ENGINEERING COMP 232/2 Mathematics for Computer Science FALL 2010 Tutorial Problems (Section DD) : Week 3 3-1. The logical operators ( nand ), ( nor ), and ( nimp ) are defined as follows. P Q P Q P Q P Q T T F F F T F T F T F T T F F F F T T F a) Assume $ is a binary logical operator, i.e. , one of the following. Show that ( p $ q ) ( q $ p ) T if and only if $ is the conditional operator. Hint: How are the truth tables of p $ q and q $ p related? b) Suppose F ( p, q ) is a logical expression involving only the propositional variables p and q . i) What can you conclude about F ( p, q ) if F ( p, q ) F ( q, p ) T ? ii) What can you conclude if F ( p, q ) F ( q, p ) 6 T ? c) Write the following sentence (based on experiences driving on the Metropolitan Autoroute) in logical form....
View Full Document
This note was uploaded on 11/15/2010 for the course ENCS COMP 232 taught by Professor Ford during the Fall '10 term at Concordia CA.
- Fall '10