Examination 1 for CMSC 203: Logic and Set Theory, Exams of Discrete Structures and Graph Theory

Fall 1997 examination 1 for cmsc 203, which covers topics in logic and set theory. Various statements and problems that require the application of logical concepts and set theory principles. Students are expected to determine the truth value of statements, use the euclidean algorithm to find the greatest common divisor, rewrite and negate statements, and prove theorems using given methods. The document also includes examples of boolean polynomials and circuits, as well as set operations.

Typology: Exams

2012/2013

Uploaded on 04/27/2013

ashay
ashay 🇮🇳

4.1

(15)

196 documents

1 / 1

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
Fall 1997 Examination 1 CMSC 203
Symbols: N denotes the Natural Numbers, Z denotes the Integers, Q denotes the Rational Numbers, I denotes
the Irrational Numbers, and R denotes the Real Numbers, P(A) is the Power Set of a set A.
1. Circle T if the statement is true or F if the statement is false.
TFR Z = I.
TF P({}). .
T F The inverse of the statement, I finished my work implies I went to a movie
is the statement, I did not go to a movie implies I did not finish my work.
T F The following is a valid argument: ~p q
~p (r s)
s ~q
r t
t
T F If A = {0,1}, then A × A = {00, 01, 10, 11}.
TFIf Σ = {goo, ga} is an alphabet, then googoogaga ∈ Σ10.
T F The set of prime numbers and the set of composite numbers partition the set of positive integers.
T F If A, B, and C are sets, then (A B C)c = Ac Bc Cc .
T F If a,b,q, and r are integers with 0 < r < b and a = bq + r, then gcd(a,b) = gcd(b,r).
T F The Disjunctive Normal Form of the Boolean Polynomial F(x, y, z) = x is F(x, y, z) = xyz + xyz’.
2. Use the Euclidean Algorithm to find gcd(330, 210).
3. Given the informal language statement: Every prime number is odd
a. Rewrite the statement in formal language as a Universal Conditional.
b. Find the negation of the statement (in either formal or informal language).
4. Show, without using truth tables, that p (q r) (p q) (p r).
5. Find the Boolean polynomial representing a circuit of four switches controlling a light bulb in such a way that
if the middle two switches are the opposite of the first and last, then the bulb turns on.
6. For the sets A = {a,b,c,d}, B = {a,c,e} and Y = {0,1}, verify that (A B) × Y = (A × Y) (B × Y)
7. Prove 2 of the 4 theorems below, using the indicated method:
Theorem 1: For all integers, n, if n3 is odd, then n is odd. (By the Method of Contraposition)
Theorem 2: If a, b and c are positive integers such that a = b + c, then gcd(a,b) = gcd(b,c).
Theorem 3: If A, B, and C are sets, then (A B) C = (A C) (B C).
Theorem 4: The difference of the squares of successive integers is an odd integer.
Docsity.com

Partial preview of the text

Download Examination 1 for CMSC 203: Logic and Set Theory and more Exams Discrete Structures and Graph Theory in PDF only on Docsity!

Fall 1997 Examination 1 CMSC 203

Symbols: N denotes the Natural Numbers, Z denotes the Integers, Q denotes the Rational Numbers, I denotes

the Irrational Numbers, and R denotes the Real Numbers, P(A) is the Power Set of a set A.

1. Circle T if the statement is true or F if the statement is false.

T F R − Z = I.

T F ∅ ∈ P({∅})..

T F The inverse of the statement, I finished my work implies I went to a movie is the statement, I did not go to a movie implies I did not finish my work.

T F The following is a valid argument: ~ p ∧ q

~ p → ( r ∨ s )

s → ~ q

r → t

∴ t

T F If A = {0,1}, then A × A = {00, 01, 10, 11}.

T F If Σ = { goo , ga } is an alphabet, then googoogaga ∈ Σ^10.

T F The set of prime numbers and the set of composite numbers partition the set of positive integers.

T F If A, B, and C are sets, then (A ∩ B ∩ C) c^ = A c^ ∪ Bc^ ∪ C c^.

T F If a,b,q, and r are integers with 0 < r < b and a = bq + r, then gcd(a,b) = gcd(b,r). T F The Disjunctive Normal Form of the Boolean Polynomial F( x, y, z ) = x is F( x, y, z ) = xyz + xyz ’.

2. Use the Euclidean Algorithm to find gcd(330, 210). 3. Given the informal language statement: Every prime number is odd a. Rewrite the statement in formal language as a Universal Conditional. b. Find the negation of the statement (in either formal or informal language).

4. Show, without using truth tables, that p → ( q ∧ r ) ≡ ( p → q ) ∧ ( p → r ).

5. Find the Boolean polynomial representing a circuit of four switches controlling a light bulb in such a way that if the middle two switches are the opposite of the first and last, then the bulb turns on.

6. For the sets A = { a,b,c,d }, B = { a,c,e } and Y = {0,1}, verify that (A − B) × Y = (A × Y) − (B × Y)

7. Prove 2 of the 4 theorems below, using the indicated method: Theorem 1: For all integers, n , if n^3 is odd, then n is odd. (By the Method of Contraposition)

Theorem 2: If a , b and c are positive integers such that a = b + c , then gcd( a,b ) = gcd( b,c ).

Theorem 3: If A, B, and C are sets, then (A ∪ B) − C = (A − C) ∪ (B − C).

Theorem 4: The difference of the squares of successive integers is an odd integer.

Docsity.com