Scribd
Upload
148 views2 pages

CS311: Discrete Math For Computer Science, Spring 2015 Additional Exercises, With Solutions

This document provides additional exercises and solutions for the course CS311: Discrete Math for Computer Science. It contains 7 problems testing concepts like set operations, relations, and counting binary relations. The problems are multiple choice, true/false, or require short justification of answers. The solutions clearly explain the reasoning and provide examples as needed.

Uploaded by

AP
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
148 views2 pages

CS311: Discrete Math For Computer Science, Spring 2015 Additional Exercises, With Solutions

This document provides additional exercises and solutions for the course CS311: Discrete Math for Computer Science. It contains 7 problems testing concepts like set operations, relations, and counting binary relations. The problems are multiple choice, true/false, or require short justification of answers. The solutions clearly explain the reasoning and provide examples as needed.

Uploaded by

AP
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/ 2

CS311: Discrete Math for Computer Science, Spring 2015

Additional Exercises, with Solutions


Justify your answers.
1. In this problem, A = {1, 2, . . . , 10}, B = {10, 11, . . . , 20}, C = {2, 4, 6, . . . 20}. Find
the cardinalities of the sets
(a) A ∪ C,
(b) A ∩ C,
(c) (A ∪ B) \ C,
(d) (A ∩ B) \ C,
(e) (A ∩ B) × C.

Solution:
(a) |A ∪ C| = |{1, 2, . . . , 9, 10, 12, 14, 16, 18, 20}| = 15.
(b) |A ∩ C| = |{2, 4, 6, 8, 10}| = 5.
(c) |(A ∪ B) \ C| = |{1, 3, 5, . . . , 19}| = 10.
(d) |(A ∩ B) \ C| = |∅| = 0.
(e) |(A ∩ B) × C| = |A ∩ B| · |C| = 1 · 10 = 10.

2. Find the cardinality of the set


({1, 2, . . . , 100} × {1, 2, . . . , 101}) \ ({1, 2, . . . , 101} × {1, 2, . . . , 100}).

Solution: Denote
the set {1, 2, . . . , 100} × {1, 2, . . . , 101} by X,
the set {1, 2, . . . , 101} × {1, 2, . . . , 100} by Y.
Set X consists of the pairs hm, ni such that m is between 1 and 100, and n is between 1
and 101; there are 10,100 such pairs. Such a pair hm, ni belongs to Y if n is between 1 and
100; there are 10,000 such pairs. Consequently the cardinality of X\Y is 10, 100−10, 000,
which equals 100.
3. Find sets A and B such that
A \ B = {1, 5, 7, 8},
B \ A = {2, 10},
A ∩ B = {3, 6, 9}.
Answer: A = {1, 3, 5, 6, 7, 8, 9}, B = {2, 3, 6, 9, 10}.
4. Can you conclude that A = B if A, B, C are sets such that

(a) A ∪ C = B ∪ C?

Answer: No. Counterexample: A = {1, 2, 3}, B = {1, 2}, C = {3}.

(b) A ∩ C = B ∩ C?

Answer: No. Counterexample: A = {1, 2, 3}, B = {3, 4, 5}, C = {3}.


5. For any sets A and B, if |A × B| = 91 then at least one of the sets A, B is a singleton.
True or false?
Answer: False. Example: A = {1, 2, . . . , 7}; B = {1, 2, . . . , 13}.
6. Consider the relation x = 2y + 1 between real numbers x, y. Is it reflexive? Is it
symmetric? Is it transitive?
Solution: Denote the given relation by R, so that

xRy ↔ x = 2y + 1.

This relation is not reflexive, because the condition 1R1 does not hold.
This relation is not symmetric, because the condition 1R3 holds, but the condition
3R1 doesn’t.
This relation is not transitive, because the conditions 1R3 and 3R7 hold, but the
condition 1R7 doesn’t.
7. What is the total number of binary relations on the set {1, . . . , 10}? How many of
them are reflexive?
Solution: A binary relation is an arbitrary subset of the set {1, . . . , 10} × {1, . . . , 10}.
So the total number of binary relations is 2100 . Such a subset is a reflexive relation if it
contains 10 pairs of the form hn, ni. So the number of reflexive relations is 290 .

You might also like