You are on page 1of 6

1. Let A and B be sets and Ac and Bc denote the = complements of the sets A and B.

The set (A-B) U (B-A) U (A)B) is = equal to: Ans:-A U B 2. The number of elements in the power set, P(S) of the set, S =3D { = { _}, 1, (2, 3} } is: Ans:-8 3. Let S be an infinite set and S1, S2, = S3, ......., Sn be sets such that S1 U S2 = U S3 U ....... U Sn =3DS . Then, Ans:-At = least one of the sets Si is an infinite set 4. Let A and B are two sets such that |A| =3D m and |B| =3D n. The = number of relations from A to B is: Ans:-2 mn 5. The number of binary relations on a set with 'n' element is: = Ans:-

6. Algebraic System contains

1. One or more Unary Operations 2. One or more Binary Operation 3. None

6. The binary relations S =3D {_ }on a set A =3D {1, 2, 3} is: Ans:-Transitive and symmetric 7. Let R be a symmetric and transitive relation on a set A. Then: = Ans:- R is not reflexive and hence not an equivalence relation 8. Let S(w) denote the set of all the letters in w, where w is an = English word. Which of the following is NOT true? Ans:- ( S(dumb) U = S(deaf) ) =3D ( S(mud) U S(beaf) ) 9. How many irreflexive relati ons are there on a set with 'n' = elements? Ans:- 2 n(n-1) 10. If the power set of A has 256 elements, then the number of = elements in A is: Ans:-8 11.How many 20 similar books can be placed on 8 different shelves. 1. 27c20 2. 28c20 3. 24c20 4. None 12. Let A and B be any two sets. The symmetric difference of A and B = is defined by 12. A B=3D(A-B) (B-A).Which of the following = is false? Ans:-A B =3D (A Y B) Y(B Y A) 13. Let Z be an empty set and P(Z) is power set of Z. = The number of elements in P(P(Z)) is: Ans:-2 14. The number of relations from A =3D {a, b, c} to B =3D{1, 2, 3, 4} = is: Ans:-4096 15. How many reflexive relations are there on a set with 'n' elements? = Ans:- 2 n(n-1) 16. The binary relation R =3D {(1, 1), (2, 1), (2, 2), (2, 3), (2, 4), = (3, 1), (3, 2), (3, 3), (3, 4)} on the set A =3D {1, 2, 3, 4, 5} is: = Ans:-neither reflexive nor i rreflexive, but transitive 17. How many relations are there on a set with 'n' elements that are = reflexive and symmetric? Ans:-2n(n-1)/2 18. Let the relation R =3D {(a, b), (b, c), (c, a)} on the set {a, b, = c}. The reflexive transitive closure of R, denoted by R* is: Ans:-{(a, b), = (b, c), (c, a), (a, c), (b, a), (c, b), (a, a), (b, b), (c, c)} 19. Let the relation R =3D { (a, d), (b, a), (b, c), (c, a), (c, d), = (d, c) } on the set {a, b, c, d}. The transitive closure of R is: Ans:-(A X A) = - { (a, b), (b, b), (c, b), (d, c) } 20. Let the relation R =3D { (a, b), (a, c), (b, c), (c, d), (d, b), = (d, e), (e, a) } on the set {a, 1. A permutation is a ________made from a group of objects in an ordered manner. 1. Arrangement 2. Selection 3. Condition 4. Alternative b, c, d, e}. The transitive closure of R is: = Ans:-A X A 21. Given the relation R =3D { (1, 2), (2, 3) }. The minimum number of = ordered pairs that must be added to this set so that the enlarged relation is reflexive, symmetric and transitive is: Ans:-7 22. Let the relation on A =3D{1, 2, 3} defined by R=3D{ (1, 1), (1, = 2), (2, 3) }. Which of the following relations represent the symmetric closure of R? = Ans:- { (1, 1), (1, 2), (2, 1), (2, 3), (3, 2) }

23. Let the relation R =3D {(a, b), (b, c), (d, c), (d, a)} on the set = {a, b, c, d}. The reflexive transitive closure of R is: Ans:- {(a, a), (a, = b), (a, c), (b, c), (b, d), (c, d), (d, a), (d, b), (d, c), (d, d)} 24. Let R be the relation on the set of integers defined by ''x =13 y = is divisible by 5''. How many equivalence classes are there on R? = Ans:-5 25. Let S be the finite non-empty set with 'n' elements. The number of = elements in the largest equivalence relation of A is: = Ans:-n2 1. The coefficient of x5 in (a+bx+cx2)10 1. 360a7bc2+840a6b3c+252a5b 2. 36a7bc2+80a6b3c+252a5b 3. 30a7bc2+40a6b3c+252a5b 4. None 26. The number of equivalence relations on a set, S =3D { 1, 2, 3, 4 } = is: Ans:-15 27. The relation R is defined in N X N, such that (a, b) R (c, d) if = and only if a+d =3D b+c. The relation R is: Ans:- R is an equivalence = relation 28. The relation R is defined as xRy, if x \ y. This relation R = is: Ans:-R is symmetric but not reflexive 29. The number of equivalence relations on a set, S =3D { 1, 2, 3 } = is: Ans:-5 30. The relation R is said to be compatible, if: Ans:-R is = reflexive and symmetric, but not transitive 1. P(n; q1,q2) = C(n, q1) = C(n,q2). Is is Correct. 1. True 2. False 31. Let A =3D {1, 2, 3}, B =3D {a, b, c} and C =3D {x, y, z}. The = relati on R from A to B is {(1, b), (2, a), (2, c)} and the relation S from B to C is = {(a, y), (b, x), (c, y), (c, z)}. The composition relation, R0S is: Ans:- = {(1, x), (2, y), (2,z)} 32. Let the relation R =3D {(1, 2), (2, 3), (2, 4)} on the set {1, 2, = 3, 4}. The transitive closure of R, denoted by R+ is: Ans:-{(1, 2), (2, 3), = (2, 4), (1, 3), (1, 4)} 33. Consider the relation R =3D { (1, 2), (2, 1) } on the set {1, 2, = 3}. Which of the following relations represent the reflexive closure of R? = Ans:-{ (1, 2), (2, 1), (1, 1), (2, 2), (3, 3) } 34. Let the relation R =3D {(1, 1), (1, 3), (2, 2), (3, 1), (3, 2) } = on the set {1, 2, 3}. The transitive closure of R is: Ans:-(A X A) - { (2, = 1), (2, 3) } 35. Let S =3D {1, 2, 3}. How many different Hasse diagrams are there = on S? Ans:-5 36. Which of the following is not a partial ordering relation? = Ans:- The relation'divides' on the set of all integers 37. Let X =3D ,2, 3, 6, 12, 24-. The number of edges in the Hasse = diagram of lattice, (X, T), where a T b if and only if a divides b, = is: Ans:-4 38. A relation R on a set A is called a partial order, if R is: Ans:Reflexive, Antisymmetric and Transitive 39. Let X =3D ,1, 2, 3, 4, 6, 8, 12-. The number of edges in the Hasse = diagram of lattice, (X, T), where a T b if and only if a divides = b, is: Ans:-8 40. Let A =3D {1, 2, 3}. How many different partial orderings are = there on A? Ans:-19 1. Solution to the recurrence relation ak+kak-1=0 with a0=1 1. (-3)k k! 2. (-3)k (k+1)! 3. (-2)k k! 4. All the above 41. Which of the following is not a POSET? Ans:-The set of all = integers with relation < 42. Which of the following is both a parti al ordered set and a totally = ordered set, where P(U) is the power set of an arbitrary set U =3D { a, b }? = Ans:-{ D8 ; | } 43. Let f be a function from the set A to the set B. Let S and T be = subsets of A. Consider the statements, S1: if f is one -to-one, then f(S = T) =3D f(S) f(T) and S2: if f is on-to but not one-to-one, then f(S T)=3D = f(S) f(T). Which of the following is true? Ans:-S2 S1 is true andis false 44. Which of the following is true? Ans:- The domain of f(x) =3D = 1/( = ) is ( -^ , 0) 45. How many on-to functions are there from a set with six elements to = a set with 3 elements? Ans:-540

46. How many on-to functions are there from a set with 5 elements to a = set with 4 elements? Ans:-240 47. Suppose X and Y are sets and |X | and |Y | are their respective cardinalities. It is given that there are exactly 97 functions from X = to Y. From this one can conclude that: Ans:-|X | =3D 01 and |Y | =3D 97 = 48.Which of the following is not true? Ans:-f: A ( B is = one-to-one |A |=3D| B| 49.Which of the following is not true? Ans:-Every constant = function is a surjection 50.Consider the following functions from Z to Z, S1: f(x) = =3Dx3 is one -to-one, but not on-to S2:f(n) =3D = is on-to, but not one-to-one. Which of the following is true? Ans:- S1 is = true and S2 is true 51.Let A =3D R-{3}and B =3D R-,1-. Let f: A ( B is defined by = f(x) =3D (x-2)/(x-3). Then, which of the following is not true? Ans:- f is a bijection = 52.Which of the following functions have inverse defined on their = ranges? Ans:- f(x) =3D ex, x R 53.The largest and smallest values of the function f(x) =3D = x3 + 5x2 - x - 5 in the interval -8 T x T 2 is: = Ans:21, -189 54.What is the maximum value of the function f(x) =3D 2x2 = =13 2x + 6 in the interval [0,2]? Ans:-10 55.The number of functions from an 'm' element set to an 'n' element = set is: Ans:-nm 56.The number of functions on to the set A =3D {1, 2, 3, 4}are: = Ans:- 256 57.Let A and B be two sets with cardinalities 'm' and 'n' = respectively. The number of onetoone mapping (injections) from A to B (when m < n) = is: Ans:58.If A =3D {a, b, c, d, e}, then the number of one-to-one function = from A to A is: Ans:120 59.Which of the following is not true? Ans:- Every equivalence = relation on A is a function on A 60 .Which of the following is a function from R to R? Ans:-f(x) = =3D |x|

61 Following is not a planar graph

1. K4 2. K3,3 3. C6 4. W6 60 A graph is said to be planar if it does not contain any crossed edges. a. True b. False 61.Given f : A ( B and g : B ( C, which of the following = is not true? Ans:-If gof is on-to, then g is on-to 62.Let f and g are functions defined by f(x) =3D x/(x+1) and g(x) =3D = x/(1-x), then (fog)-1 x is: Ans:-X 63.If f(x) =3D 1/(1-x), then which of the following is false? = Ans:- fofof is an identity function on its domain 64.The range of the function: f(x) =3D = is: Ans:- [0, 1/2] 65.The domain of the function: f(x) =3D sin log{ = /(1-x)} is: Ans:-(-2, 1) 66.Let f: A ( B is a bijection, then which of the following is = false? Ans:-fof -1 =3D IA 67.Let f(x) =3D x2 + x and g(x) =3D x + 1, then fog is: Ans:-x2 + 3x + 2 68.Consider the Ackermann's function definition: If m =3D 0, then = A(m, n) =3D n + 1; If m \ 0 and n =3D 0, then A(m, n) =3D A(m-1, 1); If m = \ 0 and n \ 0, then A(m, n) =3D A(m69.DFS uses ______ 70.Following is used to represent a graph in the computer. a. Adjacency Matrix b. Identity Matrix c. Unit Matrix d. All the above 1, A(m, n-1) ). The value of A(1, 3) is: Ans:-5 69.Let A=3D{1, 2, 3, 4}, B=3D{a, b, c}and C=3D,w, x, y, z- with f: A = ( B and g: B ( C given by f =3D {(1, a), (2, a), (3, b), (4, c)}and g =3D {(a, x), = (b, y), (c, z)}. The composite function, denoted by gof, is: Ans:-gof =3D {(1, = x), (2, x), (3, y), (4, z)} 70.Consider the Ackermann=19s f unction definition: If m =3D 0, then = A(m, n) =3D n

+ 1; If m \ 0 and n =3D 0, then A(m, n) =3D A(m-1, 1); If m = \ 0 and n \ 0, then A(m, n) =3D A(m-1, A(m, n-1) ). The value of A(1, 1) is: Ans:-3 71.Consider the recursive function definition: If x < y, then f(x, = y) =3D 0; If y T x, then f(x, y) =3D f(x-y, y) + 1. The value of f(5861, = 7) is: Ans:-837 72.Let R =3D { (1, 1), (3, 1), (2, 3), (4, 2) }.Which of the = following represents R2, where R2 is R composite R? = Ans:- { (1, 1), (2, 1), (4, 3), (3, 1) } 73.Consider the recursive function definition: If b =3D 0, then f(a, = b) =3D 1; If a < b, then f(a, b) =3D 0; If a > b, then f(a, b) =3D f(a-1, b) = + Ff(a-1, b-1). The value of A(3, 2) is: Ans:-3 74.Consider the recursive function definition: If x < y, then f(x, = y) =3D 0; If y T x, then f(x, y) =3D f(x-y, y) + 1. The value of f(14, 6) = is: Ans:-2 75.Consider the recursive function definition: If x < y, then f(x, = y) =3D 0; If y T x, then f(x, y) =3D f(x-y, y) + 1. The value of f(12, 5) = is: Ans:-2 76.Following is the algorithm used for finding minimum spanning tree of a graph. 1. DFS 2. BFS 3. Prims 4. All the above 77.Let f: A ( B and g: B( C . The composite function, = denoted by gof, is: Ans:-A ( C 76.Consider the recursive function definition: If x < y, then f(x, = y) =3D 0; If y T x, then f(x, y) =3D f(x-y, y) + 1. The value of f(4, 7) = is: Ans:-0 77.Which of the following POSET is not a lattice? Ans:-{{1, 3, 6, = 9, 12}, | } 78.Consider the lattice defined by the Hasse diagram given below. How = many complements does the element 'e' have? Ans:-3 79.For the lattice {P(A); }, where A=3D{a, b, c} the = complement of 'a' is: Ans:- {b, c} 80.Consider the POSET, P =3D {a, b, c, d, e} shown below 81. Any two simple connected graphs with n vertices, all of degree 2 are________ 82.Chromatic number of a complete graph Kn is _____ 83.A connected graph G is an Euler graph iff all vertices of G are of ___ degree. 81.Which of the following statements is false? Ans:-The subset {b, c, d, e} of = P is a lattice 82.Let the lattice be *P(A) ; T+. Which of following statements = is false? Ans:-The lower bound of *N ; T + is 0 83.Which of the following is false? Ans:-Every distributive = lattice is a complemented lattice 84.Consider the following lattices L1*, L2*. = 85.Which of the following is true? Ans:-Both lattices are not distributive 86.Which of the following is not a distributive lattice? Ans:- = {{1, 2, 3, 5, 30}, | } 87.Which of the following is not true? Ans:-{Z, | } is not a = lattice 88.Which of the following is not true for the lattice = {D12; | }? Ans:-Complement of 2 is 6 89.Consider the lattice { P(A) ; }. Which of following = statements is false? Ans:-The lower bound of , N; T - is 0 90.A self-complemented, distributive lattice is called: = Ans:-Boolean Algebra 91.Every finite subset of a lattice has: Ans:-A LUB and GLB 92.Suppose 50 chairs are arranged in a rectangular array of 5 rows = and 10 columns and 41 students seated randomly in the chairs. Which of the = following is false? Ans:Some column contains at least 9 students 93.The minimum number of cards to be dealt from an arbitrary shuffled = deck of 52 cards to guarantee that 3 cards are from same suit is: = Ans:-9 94.Suppose there are 26 students and 7 cars to transport them. Then, = at least one car must have: Ans:-4 or more students 95.If 7 colours are used to paint 50 houses, then: Ans:-at least = 8 or more houses must have the same colour

96.If 'K' pigeons are assigned to 'N' pigeon holes, then one of the = pigeon holes must contain at least: Ans:- = pigeons 97.If 'N' pigeon holes are occupied by 'KN + 1' pigeons, then at = least one pigeon hole are occupied by: Ans:-K+1 pigeons 98.If 50 pigeon holes are occupied by 51 pigeons, then at least one = pigeon hole is occupied by: Ans:-2 pigeons 99.Consider the exponential operation a*b =3D ab , on the = set N of positive integers. The operation is: Ans:-Non-associative and non-commutative 100.An operation * on a set is said to be commutative for any elements = a, b in S if: Ans:a * b =3D b*a 101.Let S =3D { a, b, c, d }. The operation * can be defined by the = formula x * y =3D x, where x and y are any elements of S. Then, the value of c * d = is: Ans:-c 102.If the binary operation * can be defined on set of ordered pairs = of real numbers as (a, b ) * (c, d) =3D (ad + bc, bd) and is associative, then = the value of : (1, 2) * (3, 5) * (3, 4) is: Ans:-(74, 40) 103.Which of the following is NOT an example of Algebraic System? Ans:-Finite Theory DEINITIONS Cutset. EULER GRAPH Hamiltonian Circuit. KURTOWSKIS GRAPH Bipartite graph. PLANAR GRAPH a complete graph of 6 vertices. Grinbergs theorem. EULERS FORMULA

You might also like