Scribd
Upload
294 views

Discrete Mathematics - Exercises

This document contains a problem solving session with multiple choice and essay questions related to logic, sets, and quantifiers. The multiple choice section tests concepts like logical equivalences, set operations, and quantifier logic. The essay questions involve tasks like writing negations of statements, proving logical equivalences, manipulating sets using operations like union and intersection, and representing statements without negations on quantifiers.

Uploaded by

fadlallah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
294 views

Discrete Mathematics - Exercises

This document contains a problem solving session with multiple choice and essay questions related to logic, sets, and quantifiers. The multiple choice section tests concepts like logical equivalences, set operations, and quantifier logic. The essay questions involve tasks like writing negations of statements, proving logical equivalences, manipulating sets using operations like union and intersection, and representing statements without negations on quantifiers.

Uploaded by

fadlallah
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

M131 Problem Solving Session #1

Part 1: MULTIPLE CHOICE QUESTIONS


1. The converse of the proposition p q is
a) p q
b) q p
c) q p
d) p q
e) None of the above

2. The negation of If is Friday, then it is cold is


a) If it is not Friday, then it is not cold
b) It is not Friday or it is cold
c) It is Friday and it is not cold
d) If it is cold, then it is Friday
e) None of the above
3. The negation of the statement All animals can fly i
a) All animals cannot fly.
b) Some animals can fly.
c) Some animals cannot fly.
d) There exist an animal that can fly.
e) None of the above.
4. If S = {1, 1, 1, 2, 3, 4, 4}, then |P(S)| =
a) 8
b) 16
c) 64
d) 256
e) None of the above
5. If C = {m, o, h, a, m, e, d}, then |P(C)| =
a)
b)
c)
d)
e)

6.
a)
b)
c)
d)
e)

32
49
128
64
None of the above

Which of the following is always true?


A B = A B, then A = B
A C = B C, then A = B
A C = B C, then A = B
There is a set A such that P (A) = 12.
None of the above

M131 Problem Solving Session #1

7. The converse of p q is
a) p q
b) p q
c) q p
d) q p
e) None of the above

8.
a)
b)
c)
d)
e)

0
1
2

None of the above

9.
a)
b)
c)
d)
e)

The inverse of the statement If you practice well, you will win the game is:
If you dont practice well, you will win the game.
You will win the game if you practice well.
If you dont win the game, then you did not practice well.
If you win the game, then you must have practiced well.
None of the above

10. Let S={a,b,c,d}, then |P(S)|:


a) 4
b) 8
c) 16
d) 20
e) None of the above

M131 Problem Solving Session #1


Part 2: ESSAY QUESTIONS

1. [3+5 marks]
a) Write the negation of the following statements:
i. It is neither cold nor dry.
ii. If it is rainy, then we go to the movies.
b) Show that (P Q) R and P (Q R) are logically equivalent.

2. [2+3+3 marks]
a) Consider the following predicates C(x): x is a check, T(x): x has been cashed within 30
days and V(x): x is void. Write every check is void if it has not been cashed for 30
days in terms of a quantifier and logical connectives.
b) Suppose U = {x: x is integer and 1 x 9}, A = {2, 4, 6, 8}, B = {3, 6, 9} and C = {3, 4,
5, 6, 7}. Find
i. C (B A).
ii. A B C .

c) Show that ( B A) (C A) ( B C) A .
3. [3+5 Marks]
a) Determine whether each of the following is TRUE or False:
i.
ii. 3 > 5 is sufficient for 1 + 1 = 2.

iii. x x x , domain is the set of real numbers.


2

b) Using logic laws show that the proposition p q q p is a tautology.


4. [2+6 marks]
a) Let I(x) and E(x) be the statements "x is an integer" and "x is even", respectively, domain
is the set of real numbers. Write Some integers are not even using quantifiers and logical
connectives.
b) Let A = {a, b, c}. Determine whether each of the following is TRUE or FALSE:
iii. {a, b} A A .
iv. {a, b} P A .
v.

{a, b} P A .

P A 8 .
vii. A A .
viii. P A A 9 .
vi.

5.
a. [51 Marks] Determine whether each of the following is TRUE or FALE:
i. If (1 + 1 = 3), then (1 > 2 or 1 + 2 = 4).
ii. (21 mod 4 = 2) and (4 | 16).
iii.

x 1 x 1 x , domain is the set of integers.

M131 Problem Solving Session #1

x3 2 x x

iv.
, domain is the set of integers.
v. 1100 0011 1111 .
b. [5 Marks] Using the truth table, determine whether the propositions

p q r and p r q are logically equivalent.

6.

(a) (2 marks) Show that the statement p q p q is a tautology


(b) (3 marks) Write the converse, inverse, and contrapositive of the statement:
If x 2 then x 2 4
(c) (3 marks) Determine the truth value of each of the statements below:
(i)
-2 > 0 whenever 25 4 mod 3
(ii)
(iii)

xx 2 4 x 3 0 where x is an integer.
p t s where p and s are true and t is false.

7.
(a) (6 marks) Consider the universal set U= {x | x is an integer: 1 x 10 } and the subsets
A, B, and C defined by:
A= x U | x is a prime number
B= x U | x is a power of 2

C= {3,6,9}
(i)
Write A and B in roster notation.
(ii)
(iii)

Find A B C , B A , and C A B .
Find the set D with a bit string representation: 0011101110

8. (2 marks) Prove using De Morgans Laws that: A C B A B C B


9.
a. (5 marks)
(i) Find the universal set U and the subsets A, and B if:

A B {1,5}

A {2,6,7,8,10}
B {2,3,9,10} (Hint: Use a Venn Diagram)
(ii)

Find the bit string representation of the set A B .


b. (3 marks) Re-write the following without any negations on quantifiers:

M131 Problem Solving Session #1

xy( x y)

(ii)

((x 3) ( y 4))

You might also like