Professional Documents
Culture Documents
Marks: 140
a b
2
b)
ab
2
c)
a 2b
2
d)
a 2b
2
m
n
b) mn
c) m + n
d) m n
d) A1 A2 .... An
11. Let S be a non-empty set, then the operation on S is said to be associative if for all a, b,
cS we have
a) a (b c) (a b) c
b) b c c b
c) (b c) (a b)
d) a b c
12. 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
13. If for any ring R, a.b = b.a for all a, bR then R is said to be a ..
a) integer ring
b) commutative ring
c) cyclic ring
d) non-commutative ring
a) prime divisor
b) prime statement
c) bijective statement
d) statement
19. Any non-empty subset of the set of all positive integers contains a smallest element. This
principle is called as
a) well ordering principle
b) ordering principle
c) grouping principle
d) ungrouping principle
20. If d n , then
n
is called the to d
d
a) addition conjugate
b) subtractive conjugate
c) divisor conjugate
d) multiplicative conjugate
a) logic
b) sets
c) rings
d) groups
24. 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 a
b) a covers b
c) a uncovers b
d) b uncovers a
d) functions
27. Suppose that x1.........xn Z 2n and y y1.............yn Z 2n then the distance between x and y is
a) ( x, y) { j 1,....,n : x j y j }
b) ( x, y) {x 1,....,n : x j y j }
c) ( x, y) { j 1,....,n : x j y j }
d) ( x, y) { y 1,....,n : x j y j }
n
c) p k (1 p) nk
p
n
d) p k (1 p) nk
k
b) 2
c) 2
d) 2
30. Let and be any two fuzzy subsets of a set S. Then is said to be contained in if
..
a) ( x) ( x) x S
b) ( x) ( x) x S
c) ( x) ( x) x S
d) ( x) ( x) x S
31. An edge having the same vertex as both its end vertices is called a .
a) self edge
b) self loop
c) self line
d) self curve
d) 4 complex
35. A given connected graph G is an Euler graph all the vertices of G are of .
a) odd degree
b) even degree
c) odd values less than 100
d) even values greater than 50
36. A simple graph with n vertices and k components can have atmost .. edges
a)
(n k ) (n k 1)
2
b)
(n k ) (n k 1)
2
c)
(n k ) (n k 1)
2
d)
(n k 1)
2
38. A drawing of a geometric representation of a graph on any surface such that no edges
intersect is called an
a) isomorphism
b) homomorphism
c) embedding
d) epimorphism
39. The entries along the principal diagnol of the adjacency matrix are all .
a) unity
b) non-zeroes
c) real numbers
d) zeroes
40. Two graphs G1 and G2 are isomorphic if and only if their incidence matrices I(G1) and I(G2)
differ only by . of rows and columns
a) combinations
b) shuffling
c) permutations
d) cyclic permutation
b) 2n + 1
c) 2n 1
d) 1 2n
43. In how many ways can a lady wear five rings on the fingers (not the thumb) of her right
hand?
a) 6620
b) 6720
c) 6520
d) 6700
d) least element
48. The class of variables which are quantified stand for only those objects that are members of
a particular set and is called the.
a) universe
b) discourse
c) universe of discourse
d) injective of discourse
52. The length of the chain of the sequence of elements a0, a1, a2, ,an is .
a) n 1
b) n
c) n 2
d) n 3
53. Let A = {a, b}, if L1 consists of all words beginning with an a and followed by zero or more
bs, then the language over A is
a) L1 {a, ab, a 2b 2 , .....}
b) L1 {a 2 , ab, ab2 , .....}
c) L1 {a, ab, ab2 , .....}
d) L1 {a 2 , a 2b, a 2b 2 , .....}
55. ( ) =
a)
b)
c)
d) +
n 1
p 1
2
b)
n 1
p
2
c)
n 1
p 1
2
d)
n 1
p 1
2
58. State T or F
i) An Euler graph G is arbitrarily traceable from vertex v in G if and only if every circuit in G
contains v
ii) If a graph has exactly has exactly two vertices of odd degree, then there exists a path joining
these two vertices.
a) i) F ii)T
b) i) T ii)F
c) i) T ii)T
d) i) F ii)F
59. State T or F
i) A Jordan curve is a continuous non-self-intersecting curve whose origin and terminus donot
coincide
ii) A planar graph is denoted by K3, 3
a) i) F ii)T
b) i) T ii)F
c) i) T ii)T
d) i) F ii)F
60. State T or F
i)The reduced incidence matrix of a tree is singular
ii) Each largest non-separable subgraph is called a block.
a) i) F ii)T
b) i) T ii)F
c) i) T ii)T
d) i) F ii)F
63. The language for the grammar G (VT {0,1}, VN {S}, , S ) with the set of productions
: S 11S , S 0 is
66. The word c = 1010110 is transmitted through a binary symmetric. If p = 0.02 is the
probability of incorrect receipt of a signal, then the probability that c is received as.
r = 1011111 is
a) 0.0036
b) 0.000036
c) 0.00036
d) 0.000306
(ii) T
d) (i) F (ii) F
(ii) T
d) (i) F (ii) F
(ii) T
d) (i) F (ii) F
a) (i) T (ii) F
b) (i) F (ii) T
c) (i) T
(ii) T
d) (i) F (ii) F
c) (i) T
(ii) T
d) (i) F (ii) F
0 1 0
72. The graph for the adjacency matrix 1 0 1 is
0 1 0
o
o
a)
b)
o
o
c)
d)
o
o
o
73. State T or F
A digraph D is said to be an arborescence if it satisfy the following two conditions:
i) D contains no circuit (neither a directed circuit nor a semi-circuit).
ii) There exists exactly one vertex v of zero in-degree (this vertex v is called the root of the
arborescence).
a) i) F ii)T
b) i) T ii)F
c) i) T ii)T
d) i) F
ii)F
Answer Keys
Part - A
Q. No.
Ans. Key
Part - B
Q. No.
Ans. Key
Q. No.
21
41
22
3 b
23
4 b
5
Ans. Key
d
Part - C
Q. No.
Ans. Key
61
42 c
62
43
63
24
44
64
25
45
65
26
46
66
27
47
67 a
8 c
28
48 c
68
29
49
69
10
30
50
70
11
31
51
71
12
32
52
72
13
33
53
73
14 a
34
54
74
15
35 b
55
75
16
36
56
17
37
57 a
18 c
38
58
19
39 d
59
20
40 c
60 a