1. Which of the following statements is TRUE? (a) For all sets A, B, and C, A (B - C) = (A - B) C.

C. (b) For all Sets A, B, and C, (A - B) (C - B) = (A C) B. (c) For all sets A, B, and C, (A - B) (C - B) = A - (B U C). (d) For all sets A, B, and C, if A U C = B U C then A = B. 2. If A = {1, 2} and B = {1,2} {1,2}}, then which of the following is true? (a) A B and A B (b) A B and A B (c) A B and A B (d) A B and A B (e) None o the above 3. Let S be a given set and A = {A 1, A2,Am} where each Aj, i = l, m, is a subset of S and union of A; where i is from l to m and in addition the elements of A which are subsets of S, are mutually disjoint then A is called (a) Union (b) Covering (c) Equivalence relation (d) Partition 4. If we know that R is reflexive, symmetric and transitive, we know all of the following except. (a) R is not irreflexive (b) R is antisymmetric (c) R is an equivalence relation (d) R is not intransitive . 5. Consider the relation R = {<x, y>:x, y N and y = x + 2}. Which of the following properties does R have? (a) Reflexive (b) Symmetric (c) Transitive (d) Intransitive (e) none 6. Consider the relation R = {<x,y>: x, N and y > x + 1}. Which kind of ordering on N is R? (a) Partial ordering (reflexive) (b) Strict partial ordering (c) Linear ordering (reflexive) (d) Strict linear ordering (e) None of the above 7. Exactly which of the relations R1, R2, and R3 on that are given below are antisymmetric? R1 = {(1, 1), (1, 2), (2, 2), (2, 3), (3, 3), (3, 4), (4, 4), (4, 1)}

R2 = {(1, 1), (1, 2), (2, 3), (3, 3), (3, 2), (4, 2)} R3 = A: R1, R3 B: R2, R3 C: R1, R2 D:R2 E: None of above 8. Exactly which of the relations R1, R2 and R3 on Z+ (the positive integers) shown below are antisymmetric? R1 = { (a, b) Z+ x Z+ a2 b2 = 3(a - b)}, R2 = {(a, b) Z+ x Z+ a<=2b}, R3 = {a, b } Z + x Z + | a b | < 4 } A : R1, R3 B : R2., R3 C : R1, R2 C : R1 R2 D: R2 E: None of above

9. Let S = {1, 2, 3, 4}, exactly which of the following relations on A are antisymmetric? (i) {1, 2}} (ii) {(1, 2), (2, 1,)} (iii) {(1, 1) (2, 2)} A. (i) B. (ii) C. (iii) D. (i) (iii) E. (i), (ii) 10. Which f the following statements about sets true. If S T, then (a) Tc S (b) Tc S T (c) T S = (d) TS ST (e) S UT T 11. Let R1 and R2 two equivalence relations on a set. Consider the following assertions i) R1 U R2 is an equivalence relation ii) R1 R2 is an equivalence relation which of the following is correct a) b) c) d) Both assertions are true Assertion i) is true but assertion ii) is not true Assertion ii) is true but assertion I) is not true neither I) nor ii) is true

12. Let R be a symmetric and transitive relation on a set A. Then a) R is reflexive an hence an equivalence relation b) R is reflexive and hence a partial order. c) R is not reflexive and hence not an equivalence relation d) None of the above. 13. Let R be a non-empty relation on a collection of sets defned by A R if and only if A B = then, a) R is reflexive and transitive b) R is an equivalence relation c) R is not reflexive and not symmetric

14. Define an equivalence relation R on the positive integers A = {2, 3, 4 ....., 20} by mRn if the largest prime divisor of m is the same as the largest prime divisor of n. The number of equivalence classes of R is (a) 8 (b) 10 (c) 9 (d) 11 (e) 7 15. Consider the divides relation, m/n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. The cardinally of the covering relation for this partial order relation (i.e., the number of edges in the Hasse diagram) is (a) 4 (b) 6 (c) 5 (d) 8 (e) 7 16. Consider the divides relation, m/n, on the set A = {2, 3, 4, 5, 6, 7, 8, 9, 10}. Which of the following permutations of A is not a topological sort of this partial order relation? (a) 7,2,3,6,9,5,4,10,8 (b) 2,3,7,6,9,5,4,10,8 (c) 2,6,3,9,5,7,4,10,8 (d) 3,7,2,9,5,4,10,8,6 (e) 3,2,6,9,5,7,4,10,8 17. Circle FUN, INJ, SUR, or BIJ (circle a maximum of one) depending on whether each of the following subsets of A x B is only a FUNction, only an INJection (one-to-one), only a SURjection (onto), or a BIJection where A = {a, b, c} and B = {1, 2, 3, 4} 1. {(a, 3), (b, 4), (c, 4), (d, 2)} 2. {(a, 3), (b, 4), (c, 5)} 3. {(a, 3), (b, 4), (c, 1), (d, 2)} 4. {(a, 2), (b, 2), (c, 2), (d, 2)} 5. {(a, 1), (b, 2), (c, 3), (d, 4)} FUN INJ SUR BIJ FUN INJ SUR BIJ FUN INJ SUR BIJ FUN INJ SUR BIJ FUN INJ SUR BIJ

Circle FUN, INJ, SUR, or BIJ (circle exactly one) depending on whether each of the following functions from Z to Z (the integers) is only a FUNction, only an INJection (one-to-one), only a SURjection (onto), or a BIJection. CIRCLE exactly 1 FUN INJ SUR BIJ 1. (n) = n2 + 2 FUN INJ SUR BIJ 2. (n) = n + 2 FUN INJ SUR BIJ 3. (n) = [n / 2] FUN INJ SUR BIJ 4. (n) = n * 2 FUN INJ SUR BIJ 5. (n) = [(2n + 1) / 2]

Answer the question above assuming that (n) is a function from N to N (the natural numbers beginning at 0) Answer the question above assuming that (n) is a function from Z+ to Z+ (the positive integers which begin at 1).

18. If the group G has exactly three elements, then it must be. (a) f is not function from Z Z because n\2 E Z (b) f is a function and is onto and one-to-one. (c) F is a function and is not onto but is one-to-one. (d) F is a function and is onto but not one-to one. 19. Circle all the following function which are onto (surjective). a) f : p - >{0: : : ; ; 9 } maps the set of people who have social-security numbers to the set of possible social-security numbers. F(p) is the s.s number assigned to person p b) f (x) 2X2 + 3X 9 maps real number to real number c) f :S->Z maps the set of finite bit strings to the set of integers. F(s) is the number of one bits possessed by binary string s d) f (s) is the letter grade students s received in a class that had 22 students, and for which every student passed e) none of the above 20. Circle all the following functions which are-to-one (injective). a) f : p - >{0: : : ; ; 9 } maps the set of people who have social-security numbers to the set of possible social-security numbers. F(p) is the s.s number assigned to person p b) f (x) 2X2 + 3X 9 maps real number to real number c) f :S->Z maps the set of finite bit strings to the set of integers. F(s) is the number of one bits possessed by binary string s d) f (s) is the letter grade students s received in a class that had 22 students, and for which every student passed e) none of the above