Sei sulla pagina 1di 26

Model Question Paper

Subject Code: BC0039


Subject Name: Discrete Mathematics
Credits: 4 Marks: 140

Part A (One mark questions)
1. If the number of elements in a set is not finite then the set is called an
A) finite set
B) collective set
C) Infinite set
D) arranged set

2. If A = {1,3,5} and B = {1,3,5,7} then A is a .. subset of B
A) smaller
B) proper
C) improper
D) normal

3. Consider the set A = {1, 2, 3}, the power set of A has . elements
A) 2
3



B) 2
2

C) 2
5

D) 2
6


4. The cardinality of the set A= {1, 2, 3, 0, 6, 7, 8, 9} is
A) 7
B) 8
C) 6
D) 2

5. If A is the arithmetic mean between the extremes a and b then A =
A)
2
b a

B)
2
b a +

C)
2
2b a +

D)
2
2b a


6. The n
th
term of an arithmetic progression a + (a + d) + (a + 2d) + . is
A) a + nd
B) a + (n1)d


C) a + (n+1)d
D) 2a + (n+1)d

7. The sum to n terms of a geometric progression is given by
A)
r
r a
S
n
n
+

=
1
) 1 (

B)
r
r a
S
n
n
+
+
=
1
) 1 (

C)
r
r a
S
n
n

=
1
) 1 (

D)
r
r a
S
n
n
+
+
=
1
) 1 (


8. The sum to infinity of a geometric progression is
A)
r
a
1

B)
r
a
+ 1

C)
r
a
+

1

D)
r
a
+ 1
2


9. Combinatorics is the branch of discrete mathematics concerned with .


A) counting problems
B) abstract algebra
C) derivative problems
D) integrated problems

10. If the object A is chosen in m ways and B in n ways then either A or B is chosen in
ways
A)
n
m

B) mn
C) m + n
D) m n

11. The value of
r
n
P =
A)
)! (
!
r n
n
+

B)
)! (
!
r n
n


C)
)! (
)! (
r n
r n

+

D)
)! (
)! 1 (
r n
n





12. Consider n objects of which m
1
are of first kind, m
2
are of second kind,.., m
k
are of k
th

kind, then =

=
k
i
i
m
1

A) n
3

B) n
2

C) n
D) i

13. A recurrence relation of the form ) ( .......
2 2 1 1 0
r f a C a C a C a C
k r k r r r
= + + + +

where s C
i
' are
constants, is called a .
A) Quadratic linear relation
B) Quadratic recurrence relation
C) Linear recurrence relation
D) Cubic recurrence relation

14.
r
r r
a a 2 3 2
1
= +

is a order linear recurrence
A) second
B) first
C) third
D) fourth



15. A . function is a polynomial of the form ...... ..... ) (
2
2 1 0
+ + + + + =
n
n
x a x a x a a x f which
has infinitely many non-zero terms
A) irrecursive
B) recursive
C) implicit
D) generating

16. The generating function of the sequence 1, 2, 3,.of natural numbers is
A) ....... 3 2 1 ) (
2
+ + + = x x x f
B) ....... 3 2 1 ) (
2
+ = x x x f
C) ....... 3 2 1 ) (
2
= x x x f
D) ....... 6 4 2 ) (
2
+ = x x x f

17. The relation R between the sets
n
A A A ......, , ,
2 1
is a subset of
A)
n
A A A + + + ....
2 1

B)
n
A A A ....
2 1

C)
n
A A A ....
2 1

D)
n
A A A ....
2 1


18. A relation means .. on a set S.


A) dual relation
B) binary relation
C) reflexive relation
D) symmetric relation

19. A . is a set S with a relation R on it which is reflexive, anti-symmetric and
transitive
A) equivalent set
B) ordered set
C) implicit set
D) Partially ordered set

20. If S is a poset and a, b are in S such that a > b and there is no c in S such that a > c and c >
b, then we say that .
A) b covers b
B) a covers a
C) a covers b
D) b covers a

21. Let S be a non-empty set, then the operation - on S is said to be associative if for all a, b,
ceS we have
A) c b a c b a - - = - - ) ( ) (


B) b c c b - = -
C) ) ( ) ( b a c b - = -
D) c b a - =

22. Let (A,-) be an algebraic system where - is a binary operation on A. Then (A,-) is called a
semigroup if it satisfies the
A) closure law
B) associative law
C) reflexive law
D) closure and associative law

23. Let N be the set of natural numbers, under the operation -, where } , max{ y x y x = - . Then
the set N is a
A) topogroup
B) multigroup
C) semigroup
D) subgroup

24. The set Z with the binary operation subtraction is .. a subgroup
A) not
B) subset of
C) always


D) superset of

25. If for any ring R, a.b = b.a for all a, beR then R is said to be a ..
A) integer ring
B) commutative ring
C) cyclic ring
D) non-commutative ring

26. A commutative ring is said to be an integral domain if it has no ..
A) zero divisors
B) inverse
C) multiples
D) identity

27. A ring R is said to be a . if x x =
2
for all R xe .
A) permutation ring
B) commutative ring
C) Boolean ring
D) identity ring

28. If R is a Boolean ring then R is a .


A) commutative ring
B) subring
C) integral ring
D) integer

29. Reasoning is a special kind of thinking called as
A) inferring
B) logics
C) bijective
D) contradictive

30. The basic unit of our objective language is called a .
A) prime divisor
B) prime statement
C) bijective statement
D) statement

31. The validity of an argument doesnot guarantee the truth of the ..
A) permutation
B) commutative value
C) conclusion


D) identity value

32. A is a statement which is either true or false, but not both.
A) argument
B) conclusion
C) bi-conditional
D) proposition

33. A function f: A B is said to be if for every yeB there exists atleast one
element xeA such that f(x) = y.
A) surjective
B) bijective
C) injective
D) Automorphism

34. If f is onto then f(A) =
A) o
B) B
C) A
D) A B



35. The set } : { b x a R x < < e is denoted by
A) [a, b)
B) (a, b]
C) (a, b)
D) {a, b}

36. The domain of the function
6 5
) (
2
+
=
x x
x
x f is
A) {2, 3}
B) {3, 2}
C) R {3, 2}
D) R {2, 3}

37. The range of
x
x
x f

=
1
) ( =
A) R {1}
B) R { 1}
C) R {2}
D) R {3}

38. A function f:AB is said to be periodic function if
A) f(x) = f(o)


B) f(x) = f(x o)
C) f(x) = f(x + 2o)
D) f(x) = f(x + o)

39. f(x) = tanx is a periodic function with period ..
A) t
B) 2t
C)
2
t

D) 3t

40. The nth term of the series .... .......... 7 5 5 3 3 1
2 2 2
+ + + is
A)
2
) 1 2 ( ) 3 2 ( + n n
B)
2
) 1 2 ( ) 3 2 ( n n
C)
2
) 1 2 ( ) 1 2 ( + n n
D)
2
) 1 2 ( ) 3 ( + n n
Part B (Two mark questions)
41. = ' U
A) U
B) o


C) u
D) p

42. If A = {2, 3, 4}, B = {4, 5, 6} and C = {6, 7} then = ) ( B C A
A) {(2,7) (3,7) (7,4)}
B) {(2,7) (3,3) (4,7)}
C) {(7,2) (3,7) (4,7)}
D) {(2,7) (3,7) (4,7)}

43. The n
th
term of 1 + 3 + 5 + 7 + .
A) 2n
B) 2n + 1
C) 2n 1
D) 1 2n

44. The nth term of .... .......... 10 7 7 4 4 1 + + +
A) ) 1 3 )( 2 3 ( n n
B) ) 1 3 )( 2 3 ( + n n
C) ) 1 )( 2 3 ( n n
D) ) 1 )( 2 3 ( + n n



45. The number of distinguishable permutations of n objects in which the first object appears in
m
1
ways, second object in m
2
ways, and so on,is
A)
! !...... !
!
2 1 k
m m m
n


B)
! !...... !
!
2 1
2
k
m m m
n


C)
! !...... !
!
2 1
3
k
m m m
n


D)
! ...... ! !
!
2 1
3
k
m m m
n
+ + +


46. =
r
n
C
A)
! )! (
!
r r n
n


B)
! )! (
!
r r n
n
+

C)
! )! (
!
2
r r n
n


D)
! )! (
!
r r n
n



47. If ...... ..... 1 ) (
2
+ + + + + =
n
x x x x f and ..... ) 1 ( ...... 1 ) (
3 2
+ + + + =
n n
x x x x x g then
= ) ( ) ( x g x f
A) ...... 1
6 4 2
x x x


B) ...... 1
6 4 2
+ + x x x
C) ......
6 4 2
+ x x x
D) ...... 1
6 4 2
+ + + + x x x

48. If x = 2.52 then

= 52 . 2
A) 0
B) 1
C) 2
D) 3

49. The elements in level-1 are called
A) electrons
B) atoms
C) neutrons
D) molecules

50. A Poset S is said to be . Set if for a, b in S exactly one of the conditions, a
> b, a = b or b > a holds
A) totally ordered
B) ordered
C) not ordered


D) completely ordered

51. Let (S,-) be a semigroup and let T be a subset of S. If T is closed under the operation - ,
Then (T,-) is called a . of (S,-)
A) semigroup
B) super group
C) subgroup
D) subsemigroup

52. The semigroup S/R is called the ..
A) totally ordered
B) quotient semigroup
C) not ordered
D) completely ordered

53. A finite integral domain is a .
A) subfield
B) vector
C) field
D) ring



54. An integral domain D is said to be of characteristic 0 if the relation 0 = ma where D ae = 0
and m is an integer, can hold only if
A) m = 0
B) m =1
C) m = 2
D) m = 1

55. P.Q is called the of P and Q.
A) conditional
B) conjunction
C) bi-conditional
D) disjunction

56.In the implication Q P , P is called the .
A) consequent
B) premise
C) conditional
D) statement

57. If A = {2, 3, 5} and B = {4, 6, 9} then if R is defined as } / ) , {( b divides a B A b a R e = then
the set R =
A) )} 9 , 3 ( ), 4 , 3 ( ), 6 , 2 ( ), 4 , 2 {(


B) )} 9 , 3 ( ), 6 , 3 ( ), 6 , 2 ( ), 4 , 2 {(
C) )} 9 , 3 ( ), 6 , 3 ( ), 9 , 2 ( ), 4 , 2 {(
D) )} 9 , 3 ( ), 6 , 3 ( ), 6 , 2 ( ), 2 , 4 {(

58. If R = {(2,1), (3,1), (5,1), (5,4)} then R
-1
=
A) {(2,1), (3,1), (5,1), (4,5)}
B) {(2,1), (3,1), (5,1), (5,4)}
C) {(1,2), (1,3), (1,5), (4,5)}
D) {(2,1), (3,1), (5,1), (4,5)}

59. If 4
th
, 7
th
and 10
th
terms of G.P. are a, b, c respectively then
A)
2 2
ac b =
B) c a b + =
2

C)
2 2 2
c a b =
D) ac b =
2


60. = + + + + n .... 3 2 1
A)
2
) 1 ( + n n

B)
2
) 1 ( n n



C)
2
) 1 (
2
+ n n

D)
2
) 1 (
2 2
+ n n

Part C (Four mark questions)
61. A relation R on a set A is said to be symmetric if eR b a ) , (
A) R a b e ) , (
B) R a b e ) , (
2 2

C) R y x e ) , (
D) R x y e ) , (

62. Consider the set of all straight lines in a plane. If the relation R is defined as
parallel to then R is
A) reflexive
B) symmetric
C) transitive
D) A), B) and C)

63. = + + + +
2 2 2 2
.... .......... 3 2 1 n
A)
6
) 1 2 )( 1 ( + + n n n



B)
6
) 1 2 )( 1 ( + n n n

C)
6
) 1 2 )( 1 ( + n n n

D)
6
) 1 2 )( 1 (
2
+ n n n


64. The value of =
+
+ +

+
) 2 3 ( ) 1 3 (
1
........
11 8
1
8 5
1
5 2
1
m m

A)
4 6
2
m
m

B)
4 6 + m
m

C)
4 6
2
2
m
m

D)
4 6
2
2
+ m
m


65. = + + + .......
3 2
t t t
A)
t
t
1

B)
t
t

1

C)
1 t
t



D)
t
t

1


66. The next permutation to 4123 in the reverse Lexicographic order is
A) 3412
B) 3421
C) 2413
D) 4312

67.

= x
A)

1
B)

x
C)

2
x
D)

( )
2
x

68. The solution of the recurrence relation 4 , 1 , 2 , 6 5
1 0 2 1
= = > =

a a given n a a a
n n n
is
A) ) 3 ( 2 2
n n
n
a + =
B) ) 3 ( 2 2
n n
n
a =
C) ) 3 ( 2 2
n n
n
a =


D) ) 3 ( 2 2
n n
n
a + =

69. Let ) , , ( v . L be an algebraic lattice and xeL then = .x x
A) x
B)
2
x
C)
3
x
D)
x
1


70. If L is a finite lattice then L is
A) supremum
B) infimum
C) bounded
D) unbounded

71. If H is a subgroup of G and a, beG. Then aH = bH if and only if
A) H b a e
1 1

B) H abe
C) H ab e
1

D) H b a e
1




72. If o is a homomorphism of G into G' with kernel K then K is a of G
A) normal subgroup
B) subgroup
C) bounded subgroup
D) unbounded subgroup

73. If R R ' : o is a homomorphism then ) ( a o
A) ) (
2
a o
B) ) (a o
C) ) (a o
D) a

74. A field F is said to have . if there exist a positive integer n such that
nx = 0 for all xeF
A) characterstic
B) finite characteristic
C) finite bound
D) least upper bound



75.The compound proposition p q p p v v . )] ( [ is a
A) contradiction
B) tautology
C) neither (a) nor (b)
D) predicate



















Answer Keys
Part - A Part - B Part - C
Q. No. Ans. Key Q. No. Ans. Key Q. No. Ans. Key Q. No. Ans. Key
1 C 21 A 41 B 61 A
2 B 22 D 42 D 62 D
3 A 23 C 43 C 63 A
4 B 24 A 44 B 64 B
5 B 25 B 45 A 65 A
6 B 26 A 46 D 66 C
7 C 27 C 47 D 67 B
8 A 28 A 48 C 68 A
9 A 29 A 49 B 69 A
10 C 30 B 50 A 70 C
11 B 31 C 51 D 71 D
12 C 32 D 52 B 72 A
13 C 33 A 53 C 73 C
14 C 34 B 54 A 74 B
15 D 35 C 55 B 75 B
16 A 36 D 56 B
17 C 37 B 57 B
18 B 38 D 58 C
19 D 39 A 59 D
20 C 40 C 60 A

Potrebbero piacerti anche