Professional Documents
Culture Documents
Discrete-mathematics [Set 3] (1)
Discrete-mathematics [Set 3] (1)
3 of 5 sets
o m
202. Let (A7, ?7)=({1, 2, 3, 4, 5, 6}, ?7) is a group. It has two sub groups X and Y.
X={1, 3, 6}, Y={2, 3, 5}. What is the order of union of subgroups?
A. 65 . c
B. 5 te
a
C. 32
D. 18
q M
Answer:B c
M
203. A relation (34 × 78) × 57 = 57 × (78 × 34) can have property.
A. distributive
B. associative
C. commutative
D. closure
Answer:B
204. B1: ({0, 1, 2….(n-1)}, xm) where xn stands for “multiplication-modulo-n” and
B2: ({0, 1, 2….n}, xn) where xn stands for “multiplication-modulo-m” are the two
statements. Both B1 and B2 are considered to be
A. groups
B. semigroups
C. subgroups
D. associative subgroup
Answer:B
205. If group G has 65 elements and it has two subgroups namely K and L with
order 14 and 30. What can be order of K intersection L?
A. 10
B. 42
C. 5
D. 35
Answer:C
206. Consider the binary operations on X, a*b = a+b+4, for a, b ? X. It satisfies the
properties of
A. abelian group
B. semigroup
C. multiplicative group
D. isomorphic group
Answer:A
207. Let * be the binary operation on the rational number given by a*b=a+b+ab.
Which of the following property does not exist for the group?
A. closure property
B. identity property
C. symmetric property
D. associative property
Answer:B
208. A group G, ({0}, +) under addition operation satisfies which of the following
properties?
A. identity, multiplicity and inverse
B. closure, associativity, inverse and identity
C. multiplicity, associativity and closure
D. inverse and closure
Answer:B
209. If (M, *) is a cyclic group of order 73, then number of generator of G is equal
to
210. The set of even natural numbers, {6, 8, 10, 12,..,} is closed under addition
operation. Which of the following properties will it satisfy?
A. closure property
B. associative property
C. symmetric property
D. identity property
Answer:A
225. Two groups are isomorphic if and only if is existed between them.
A. homomorphism
B. endomorphism
C. isomorphism
D. association
Answer:C
231. The elements of a vector space form a/an under vector addition.
A. abelian group
B. commutative group
C. associative group
D. semigroup
Answer:A
234. How many different non-isomorphic Abelian groups of order 8 are there?
235. Consider the set B* of all strings over the alphabet set B = {0, 1} with the
concatenation operator for strings
A. does not form a group
B. does not have the right identity element
C. forms a non-commutative group
D. forms a group if the empty string is removed from
Answer:A
243. For the group Sn of all permutations of n distinct symbols, what is the number
of elements in Sn?
A. n
B. n-1
C. 2n
D. n!
Answer:D
245. Does the set of residue classes (mod 3) form a group with respect to modular
addition?
A. yes
B. no
C. can’t say
D. insufficient data
Answer:B
247. If the longest chain in a partial order is of length l, then the partial order can
be written as disjoint antichains.
A. l2
B. l+1
C. l
D. ll
Answer:C
248. Suppose X = {a, b, c, d} and ?1 is the partition of X, ?1 = {{a, b, c}, d}. The
number of ordered pairs of the equivalence relations induced by
A. 15
B. 10
C. 34
249. The inclusion of sets into R = {{1, 2}, {1, 2, 3}, {1, 3, 5}, {1, 2, 4}, {1, 2,
3, 4, 5}} is necessary and sufficient to make R a complete lattice under the partial
order defined by set containment.
A. {1}, {2, 4}
B. {1}, {1, 2, 3}
C. {1}
D. {1}, {1, 3}, {1, 2, 3, 4}, {1, 2, 3, 5}
Answer:C
250. Consider the set N* of finite sequences of natural numbers with a denoting
that sequence a is a prefix of sequence b. Then, which of the following is true?
A. every non-empty subset of has a greatest lower bound
B. it is uncountable
C. every non-empty finite subset of has a least upper bound
D. every non-empty subset of has a least upper bound
Answer:A
251. A partial order ? is defined on the set S = {x, b1, b2, … bn, y} as x ? bi for all i
and bi ? y for all i, where n ? 1. The number of total orders on the set S which
contain the partial order ? is
A. n+4
B. n2
C. n!
D. 3
Answer:C
252. A Poset in which every pair of elements has both a least upper bound and a
greatest lower bound is termed as
A. sublattice
B. lattice
C. trail
D. walk
Answer:B
254. A has a greatest element and a least element which satisfy 0<=a<=1
for every a in the lattice(say, L).
A. semilattice
B. join semilattice
C. meet semilattice
D. bounded lattice
Answer:D
257. The graph is the smallest non-modular lattice N5. A lattice is if and
only if it does not have a isomorphic to N5.
A. non-modular, complete lattice
B. moduler, semilattice
C. non-modular, sublattice
D. modular, sublattice
266. The logic gate that provides high output for same inputs
A. not
B. x-nor
C. and
D. xor
Answer:B
273. The set for which the Boolean function is functionally complete is
A. {*, %, /}
B. {., +, -}
C. {^, +, -}
D. {%, +, *}
Answer:B
276. a ? b =
A. (a+b)(a`+b`)
B. (a+b`)
C. b`
D. a` + b`
Answer:A
281. Simplify the expression XZ’ + (Y + Y’Z) + XY. TOPIC 5.5 MINIMIZATION
OF BOOLEAN ALGEBRA
A. (1+xy’)
B. yz + xy’ + z’
C. (x + y +z)
286. Minimize the following Boolean expression using Boolean identities. F(A,B,C)
= (A+BC’)(AB’+C)
A. a + b + c’
Explanation:- Only this statement has got the truth value which is false.
Explanation:- Compound statement with ‘or’ is true when either of the statement is true. Here the
first part of the statement is true, hence the whole is true.
290. What is the value of x after this statement, assuming the initial value of x is 5?
‘If x equals to one then x=x+2 else x=0’.
A. 1
B. 3
C. 0
D. 2
Answer:C
291. Let P: I am in Bangalore.; Q: I love cricket.; then q -> p(q implies p) is?
A. If I love cricket then I am in Bangalore
B. If I am in Bangalore then I love cricket
C. I am not in Bangalore
D. I love cricket
Answer:A
292. Let P: If Sahil bowls, Saurabh hits a century.; Q: If Raju bowls, Sahil gets out
on first ball. Now if P is true and Q is false then which of the following can be true?
A. Raju bowled and Sahil got out on first ball
B. Raju did not bowled
C. Sahil bowled and Saurabh hits a century
D. Sahil bowled and Saurabh got out
Answer:C
Explanation:- Either hypothesis should be false or both (hypothesis and conclusion) should be true.
Explanation:- The first part of the statement is false, hence whole is true.
Explanation:- The third part of the statement is negated, hence negation operator is used, for (‘or’
–V) is used and for(’but’- ?).
299. If a relation is reflexive, then all the diagonal entries in the relation matrix
must be________.
A. 0
B. 1
C. 2
D. -1