
Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
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
1 / 1
This page cannot be seen from the preview
Don't miss anything!

Fall 1997 Examination 1 CMSC 203
1. Circle T if the statement is true or F if the statement is false.
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 set of prime numbers and the set of composite numbers partition the set of positive integers.
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 + x ’ y ’ z ’.
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).
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.
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 4: The difference of the squares of successive integers is an odd integer.