You are on page 1of 4

1. Which of the following statements is TRUE? (a) For all sets A, B, and C, A – (B - C) = (A - B) – 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)}

R3 = {a. If S  T. 1) (2. Let R1 and R2 two equivalence relations on a set. R2 D:R2 E: None of above 8. a) R is reflexive and transitive b) R is an equivalence relation c) R is not reflexive and not symmetric . Let S = {1. then (a) Tc  S (b) Tc  S  T (c) T – S =  (d) T–S S–T (e) S UT  T 11. Let R be a symmetric and transitive relation on a set A. 2).b)}. 2)} A. 3). 2. (ii) 10. b)  Z+ x Z+ a2 – b2 = 3(a . (iii) D. (2. (2. R3 C: R1. R2 and R3 on Z+ (the positive integers) shown below are antisymmetric? R1 = { (a. exactly which of the following relations on A are antisymmetric? (i) {1. 1).)} (iii) {(1. 2}} (ii) {(1. 3). 1. (i) (iii) E. R3 B: R2. R2 C : R1 R2 D: R2 E: None of above 9. 4}.R2 = {(1. (3. R3 C : R1. (i) B. (ii) C. Exactly which of the relations R1. Let R be a non-empty relation on a collection of sets defned by A R if and only if A  B =  then. c) R is not reflexive and hence not an equivalence relation d) None of the above. (i).. 3. 2)} R3 =  A: R1. Then a) R is reflexive an hence an equivalence relation b) R is reflexive and hence a partial order. 2). R2 = {(a. b)  Z+ x Z+ a<=2b}. R3 B : R2. 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. 2). Which f the following statements about sets true. b }  Z + x Z + | a – b | < 4 } A : R1. (4. (1. 13. (3.

9. {(a.6. 20} by mRn if the largest prime divisor of m is the same as the largest prime divisor of n. SUR.8 (d) 3. 2). (b.10. Consider the divides relation. INJ. 6. 4).2.4.6.8 (b) 2.3.5. 3). only a SURjection (onto). The number of equivalence classes of R is (a) 8 (b) 10 (c) 9 (d) 11 (e) 7 15. CIRCLE exactly 1 FUN INJ SUR BIJ 1. 10}. (n) = n * 2 FUN INJ SUR BIJ 5. or a BIJection. 2)} 2.4. Which of the following permutations of A is not a topological sort of this partial order relation? (a) 7. (c. 2). 1). (c. (b. (c. 3. (d. INJ.. 2)} 4. 4). SUR. (n) = n + 2 FUN INJ SUR BIJ 3.6 (e) 3. m/n.3. 9. 2). 5)} 3. (b.5. (n) = [(2n + 1) / 2] . 4).14.. (d. {(a.3. m/n.. 3). 6. 4. 4)} FUN INJ SUR BIJ FUN INJ SUR BIJ FUN INJ SUR BIJ FUN INJ SUR BIJ FUN INJ SUR BIJ Circle FUN.. 2).9. 2)} 5.9. 8. 4} 1. 3. {(a. 10}. on the set A = {2. only an INJection (one-to-one).7. 3.4. or BIJ (circle a maximum of one) depending on whether each of the following subsets of A x B is only a FUNction. (n) = n2 + 2 FUN INJ SUR BIJ 2.4. (b. on the set A = {2. 5. (c. {(a.8 17. b.10. (c.. (n) = [n / 2] FUN INJ SUR BIJ 4. 9.6.e. (b. the number of edges in the Hasse diagram) is (a) 4 (b) 6 (c) 5 (d) 8 (e) 7 16.10. (d.7.9. 3). Circle FUN. 7.6. 5.10. or BIJ (circle exactly one) depending on whether each of the following functions from Z to Z (the integers) is only a FUNction. or a BIJection where A = {a. 1).5. Define an equivalence relation R on the positive integers A = {2. {(a.5. 3). 2. only an INJection (one-to-one). 7.8.8 (c) 2. 4 . The cardinally of the covering relation for this partial order relation (i.7.2.5.9. 4. 4). (d. Consider the divides relation.7. 3.2.10. only a SURjection (onto).4. 8. c} and B = {1..

then it must be.>{0: : : .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. (d) F is a function and is onto but not one-to –one. . Circle all the following functions which are-to-one (injective). and for which every student passed e) none of the above . a) f : p . F(p) is the s. (c) F is a function and is not onto but is one-to-one.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). a) f : p . 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. 19. 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. (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. Circle all the following function which are onto (surjective). 9 } maps the set of people who have social-security numbers to the set of possible social-security numbers. 9 } maps the set of people who have social-security numbers to the set of possible social-security numbers. and for which every student passed e) none of the above 20. . If the group G has exactly three elements. 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.>{0: : : . 18.