DISCRETE MATHEMATICS

Unit I Course Code: 14MA611

Choose the best answer

1. What is recurrence?
a) way of giving information in terms of prior knowledge
b) way of giving information in terms of posterior knowledge
c) the specification of the initial values
d) the specification of the boundary values
2. Which one of the following is the specification of the initial values?
a) Recurrence b) Iteration c) Induction d) Basis
3. Which one is the recurrence relation for the Fibonacci sequence?
a) n
F  Fn 1  Fn 3 b) Fn  Fn 1  Fn 2 c) n
F  Fn 1  Fn 2 d) n
F  Fn 1  Fn 3
4. What is the basis for Fibonacci sequence?
a) 0
F  F1  0 b) 0
F  F1  1 c) 0
F  0, F1  1 d) 0
F  1, F1  0
5. What is mean by telescopic form?
a) Recursive definition of a constant b) Recursive definition of a polynomial
c) Recursive definition of sequence d) Recursive definition of series
6. Which one of the following is the method of writing a polynomial in recursive form?
a) Telescopic b) Induction c) Hornor d) Iteration
3 2
7. Choose the telescopic form of the polynomial 5 x  4 x  3x  2
a) (((5)x+4)x+3)x+2 b) (((5)x+4)+3)x+2
c) (((5)x+4)x+3)+2 d) (((5)x-4)x-3)x-2
8. How many number of multiplication involved in telescopic form of the polynomial
x 4  2 x 3  3x 2  4 x ?
a) 7 b) 4 c) 6 d) 5
9. Choose the recurrence relation and basis for the sequence 1,3, 32,…
n 1 n 1 n 1 n 1
a) 3a , a0  0 b) 3a , a0  2 c) 3a , a0  3 d) 3a , a0  1
k
10. Which one is the recurrence relation and basis for D( k )  5( 2) , k  0 ?
a) D( k )  2 D( k  2)  0, k  1 and D(0)  2
b) D ( k )  2 D ( k  1)  0, k  1 and D(0)  2
c) D ( k )  2 D ( k  1)  0, k  1 and D(0)  5
d) D( k )  5D( k  1)  0, k  1 and D(0)  5
2
11. What is the order of the recurrence relation T ( n )  2(T ( n  1))  nT ( n  3) ?
a) 1 b) 2 c) 3 d) 4
12. What is the condition for the homogeneous relation?
a) f ( k )  0 k b) f (k )  0 for some k
c) f ( k )  1k d) f ( k )  1 for some k
13. Choose the correct recurrence relation for the sequence S ( k )  2k  9
a) S ( k )  S ( k  1)  0 b) S ( k )  S ( k  1)  1
c) S ( k )  S ( k  1)  4 d) S ( k )  S ( k  1)  2
14. Which one is a closed form expression for the recurrence relation
D( k )  2 D ( k  1)  0, D(0)  5
 k 1 k 2
a) D( k )  5( 2) k  0 b) D( k )  5( 2) k  0
k k
c) D ( k )  5( 2) k  0 d) D ( k )  5( 2) k  1
15. Choose the correct characteristic equation for the relation
J ( k )  4 J ( k  1)  4 J ( k  2)  0 ?
2 2 2 2
a) a  4a  0 b) a  4a  4  0c) a  4a  4  0 d) 4  a  4a  0
16. What is the solution of the recurrence relation S ( k )  10S ( k  1)  9 S ( k  2)  0,
S (0)  3 & S (1)  11 ?
k k 2 k k
a) S ( k )  9  2 b) S (k )  9  2 c) S ( k )  2  9 d) S ( k )  9
17. Which one is the characteristic equation of the recurrence relation
S ( k )  7 S ( k  2)  6S ( k  3)  0
3 3 2 3 2
a) a  7a  6  0 b) a  7a  6a  0 c) a  6a  7  0 d) a  7a  6  0
18. Which is the homogeneous solution for the relation
T ( k )  7T ( k  1)  10T ( k  2)  6  8k ?
k k k k
a) S (k )  b1 2  b2 5 b) S ( k )  b1 7  b2 (10)
k k k k
c) S ( k )  b1 6  b2 8 d) S ( k )  2  5
19. What is the homogeneous solution for the relation S ( k )  S ( k  1)  6 S ( k  2)  30 ?
k k k k
a) S (k )  b1 2  b2 3 b) S ( k )  b1 ( 2)  b2 5
k k k k
c) S ( k )  b1 ( 2)  b2 3 d) S ( k )  b1 ( 2)  b2 ( 5)
20. What is the particular solution for the relation S ( k )  S ( k  1)  6S ( k  2)  30 ?
a) 2 b) 5 c) 10 d)6
21. What is the definition of A(0, y ) in the Ackermann’s function?
a) y  1 b) y c) y  2 d) 1
22. What is the definition of A( x  1,0) in the Ackermann’s function?
a) A(x,0) b) A(x,1) c) A(0,1) d) A(1,1)
23. What is the definition of A( x  1, y  1) in the Ackermann’s function?
a) A( x, A( x, y )) b) A(0, A( x  1, y ))
b) c) A( x, A( x  1, y )) d) A( x, A( x, y  1))
24. What is the basis for nCr ?
a)
nC0  n, nCn  1 b)
nC0  0, nCn  1

c)
nC0  1, nCn  n d)
nC0  1, nC n  1
25. The sequence can be defined by ------ and the ------------.
a) Induction and initial condition b) basis and recurrence relation
c) recurrence relation and iteration d) basis and iteration
26. Which is the correct statement for the recurrence relation
C ( k )  5C ( k  1)  6C ( k  2)  2k  7 ?
a) It is of order 2 and homogeneous b) It is of order 3 and homogeneous
c) It is of order 2 and non-homogeneous d) It is of order 3 and non-homogeneous
27. What is the characteristic equation for Fibonacci numbers?
 2 2 2 2
a) a  a  1  0 b) a  a  1  0 c) a  a  1  0 d) a  a  1  0
f  5 f n 1  6 f n 2  1 ?
28. What is the particular solution for n
1 1
a) 1 b) 0 c) 2 d) 4
k
29. What is the homogeneous solution for the relation S ( k )  3S ( k  1)  4 S ( k  2)  4 ?
k k k k
a) b1 ( 1)  b2 ( 4) b) b1 (1)  b2 ( 4)
k k k k
c) b1 (1)  b2 ( 4) d) b1 ( 1)  b2 ( 4)
30. What is the homogeneous solution for the relation
S ( k )  4 S ( k  1)  4 S ( k  2)  3k  2 k ?
k 2 k
a) (C0  C1k )( 2) b) (C0 k  C1k )( 2)
k k
c) z (C0  C1 )( 2) d) (C0  C1k )( 2)
Unit II
1. The generating function of the sequence S0, S1, S2,… is the power series__________
a) G(S;z)=S0 + S1 + S2 +…. b) G(S;z)=S0z + S1z2 + S2z3 +…. c) G(S;z)= S0 + S1z + S2
z2 +….
d) G(S;z)=S0z1 + S1z2 + S2z3 +….
2. The generating function of the recurrence relation S(k)= 2S(k-1), S(0)=1, is
__________
a) G(S;z)= (1-2z)-1 b) G(S;z)=(1+2z)-1 c) G(S;z)=(1-2z)-2 d) G(S;z)=(1-2z)
3. In finding the generating function of the Fibonacci sequence F(n)=F(n-1)+F(n-2), the
value of n is________
a)n=2b) n  2 c) n  2 d) n  0
4. The generating function of the sequence S(n)= ban is __________
a) G(S;z)= (1-az)-1 b) G(S;z)=(1+az)-1 c) G(S;z)=(1-az)-2 d) G(S;z)=(1-az)
5. The generating function of the sequence S(n)= n is __________
a) G(S;z)= z(1-az)-2b) G(S;z)= z(1-z)-2 c) G(S;z)=z(1-z)2 d) G(S;z)=z(1-z)
6. The generating function of the sequence S(n)= bnan is __________
a) G(S;z)= abz(1-az)-1 b) G(S;z)=ab(1-az)-2c) G(S;z)= abz(1-az)-2 d) G(S;z)=abz(1-
az)
7. The generating function of the sequence S(n)= 1/n! is __________
a) G(S;z)= ez b) G(S;z)=e-z c) G(S;z)=e d) G(S;z)=e-1
8. The generating function of the sequence S(n)= nCk, 0  k  n is __________
a) G(S;z)= (1-az)n b) G(S;z)=(1+az)n c) G(S;z)=(1+z)-2d) G(S;z)= (1+z)n
9. The generating function of the sequence S(n)= n2 is __________
a) G(S;z)= z(z+1)(1-az)-3b) G(S;z)= z(z+1)(1-z)-3 c) G(S;z)=z(z-1)(1-z)-2 d)
G(S;z)=z(z+1)(1-z)3
10. The generating function of the sequence S(n)+5S(n-1)=9, S(0)=6, is __________
3z  6 3z  6 3z  6 3z  6
G ( s; z )  G ( s; z )  G ( s; z )  G ( s; z ) 
a) (1  z )(1  5 z ) b) (1  z )(1  5 z ) c)
d) (1  z )(1  5 z ) (1  z )(1  5 z )
11. If S(k)= k S(k-1), k  1 S(0)=1, then which of the following is true?
a) S(k)=k! b) S(k)=k c) S(k)=1/k d) S(k)=k+1
12. If S(k)= 2 S(k-1),
k k  1 S(0)=1, then which of the following is true?
a) S(k)=2kb) S(k)=2k(k+1)/2 c) S(k)=2(k+1)/2 d) S(k)=2k(k+1)
13. If T(n) denotes the worst time for binary search of a file with n records, then
T(27)=________
 a) 81 b) 3c) 5 d) 9
14. A partial function f from X to Y is a rule which assigns to every element of X
________
a) atmost one element of Y b) atleast one element of Y c) exactly one element
of Y
d) none of the elements of Y
15. A total function f from X to Y is a rule which assigns to every element of X ________
a) atmost one element of Y b) atleast one element of Y c) none of the elements
of Y
d) a unique element of Y
16. The Zero function is given as ________
a) Z(x)=nb) Z(x)=0c) Z(x)=1 d) Z(x)=+∞
17. The Successor function is given as ________
a) S(x)=n+1b) S(x)=x-1c) S(x)=x+1 d) S(x)=x
18. The Predecessor function is given as ________
a) P(x)=x2b) P(x)=x-1c) P(x)=x+1 d) P(x)=x
19. The Projection function is given as ________
n n n
a) U i ( x1 , x2 ,....., xn )  xi b) U i ( x1 , x2 ,....., xn )  xn c) U i ( x1 , x2 ,....., xn )  x1
n
d) U i ( x1 , x2 ,....., xn )  x
20. Which of the following combinations are initial functions?
a) i.Zero function, ii. Successor function, iii.Constant function
b) i.Zero function, ii. Successor function, iii.Exponential function
c) i.Zero function, ii. Successor function, iii.projection function
d) i.Zero function, ii. Successor function, iii.Normal function
21. If f1,f2,….,fk are partial functions of k variables and g is a partial function of n
variables, then the composition of g with f is__________.
a) not a functionb) Zero functionc) constant functiond) a partial function
22. If f1,f2,….,fk are total functions of k variables and g is a total function of n variables,
then the composition of g with f is__________.
a) only a partial functionb) a total functionc) constant function d) zero function
23. A function f defined over N is defined by recursion if there exists a constant k in N
and a function h(x,y) such that_________
a) f(0)=k; f(n+1)= h(n,f(n))b) f(0)=0; f(n+1)= h(n,f(n))c) f(0)=k; f(n+1)=
h(n+1,f(n+1))
d) f(0)=n+1; f(n+1)= h(n,f(n))
24. If n! is defined by recursion, then the result is ________
a) 0b) (n+1)!c) (n-1)! d) n(n+1)
25. A total function is called _________ if i) It is one of the three initial functions or ii)It
can be obtained by composition and recursion of finite number of times of initial
functions.
a) partial functionb) constant functionc) Primitive recursive d) successor function
26. Which of the following functions are primitive recursive?
a) Zero test function b) constant functionover Nc) Predecessorfunctiond) all the
three
27. If f(x,y) defines the remainder upon division of y by x, then it is a ________ function.
a) Zero function b) constant functionc) Primitive recursive d) successor function
28. If g(x1,x2,….xn,y) is a total function over N, then g is called a ________ function if
g(x1,x2,….xn,y0)=0, for some y0 in N.
 a) Zero test function b) constant functionc) Predecessorfunction d) Regular
function
29. If f(x1,x2,….xn) over N is partial, defined over a regular function g(x1,x2,….xn,y) then
f is a ________ function.
a) Total functionb) constant functionc) Predecessorfunction d) Regular function
30. A set A is called Recursive if its _________ function is recursive.
a) Total function b) characteristic function c) partial function d) Regular
function

Unit III

1. Which of the following property is reflexive for a relation R on a non-empty set A ?

a) a R a ∀ a ϵ A b) if a R b and b R a then a = b ∀ a,b ϵ A
c) if a R b then b R a ∀ a,b ϵ A d) if a R b and b R c then a R c ∀ a,b,c ϵ A
2. Which of the following property is symmetric for a relation R on a non-empty set A ?
a) a R a ∀ a ϵ A b) if a R b and b R a then a = b ∀ a,b ϵ A
c) if a R b then b R a ∀ a,b ϵ A d) if a R b and b R c then a R c ∀ a,b,c ϵ A
3. Which of the following property is antisymmetric for a relation R on a non-empty set A ?
a) a R a ∀ a ϵ A b) if a R b and b R a then a = b ∀ a,b ϵ A
c) if a R b then b R a ∀ a,b ϵ A d) if a R b and b R c then a R c ∀ a,b,c ϵ A
4. Which of the following property is transitive for a relation R on a non-empty set A ?
a) a R a ∀ a ϵ A b) if a R b and b R a then a = b ∀ a,b ϵ A
c) if a R b then b R a ∀ a,b ϵ A d) if a R b and b R c then a R c ∀ a,b,c ϵ A
5. If a relation R is reflexive, symmetric and transitive then R is ________ on the set A.
a) partial ordering b) equivalence c) A × A d) none of these
6. If a relation R is reflexive, antisymmetric and transitive then R is ________ on the set A.
a) partial ordering b) equivalence c) A × A d) none of these
7. In a Hasse diagram, if the point b is plotted above the point a then a ≤ b and ___________
a) a = b b) a ≥ b c) a ≮ b d) a ≠ b
8. If X = {1,2,3,4,6,12} and ≤ is ‘divisor of’ then the poset (X,≤) is denoted by
a) D(6) b) D(12) c) D(18) d) D(24)
9. The poset (A,≤) is called a chain if ∀ a,b ϵ A either a ≤ b or _____________
a) a = b b) a ≮ b c) b ≤ a d) a ≠ b
10. If c is an upper bound for a and b in a poset then ___________
a) a ≤ c & b ≤ c b) b ≤ c & c ≤ a c) c ≤ a & c ≤ b d) c ≤ b & a ≤ c
11. If c is a lower bound for a and b in a poset then ___________
a) a ≤ c & b ≤ c b) b ≤ c & c ≤ a c) c ≤ a & c ≤ b d) c ≤ b & a ≤ c
12. In the poset (D(12), ≤) where ≤ is ‘divisor of’ , 2 ∨ 3 = _______
a) 2 b) 3 c) 6 d) 12
13. In the poset (X, ≤) where X = {1,2,3,4,6,12} and ≤ is usual order relation , 2 ∧ 3 =____
a) 2 b) 3 c) 6 d) 12
14. A poset (X, ≤) is said to be a lattice if ∀ a,b ϵ X, __________ exist.
a) a ∨ b b) a ∧ b c) both (a)&(b) d) none of these
15. What is the greatest element of the lattice (D(24), ≤) where ≤ is ‘divisor of’ ?
a) 1 b) 6 c) 12 d) 24
16. What is the least element of the lattice (D(24), ≤) where ≤ is ‘divisor of’ ?
a) 1 b) 6 c) 12 d) 24
17. In the lattice (L, ≤) , the law a ∧ a = a & a ∨ a = a ∀ a ϵ L is known as _________ law.
a) absorption b) idempotent c) commutative d) associative
18. In the lattice (L, ≤) , the dual statement of a ≤ b ⇒ a ∨ b = b is __________
 a) a ≤ b ⇒ a ∧ b = b b) a ≥ b ⇒ a ∨ b = b c) a ≤ b ⇒ a ∨ b = a d) a ≥ b ⇒ a ∧ b = b
19. In the isotone property of a lattice, x ∧ y ≤ x ∧ z ⇒ ____________
a) x ≤ z b) y ≤ z c) x ≤ y d) z ≤ y

20. In the distributive inequality of a lattice, x ∨ (y ∧ z) ≤ ___________

a) (x ∨ y) ∧ (x ∨ z) b) (x ∧ y) ∧ (x ∨ z) c) (x ∨ y) ∨ (x ∧ z) d) (x ∧ y) ∨ (x ∧
z)
21. In the modular inequality of a lattice, x ≤ z ⇒ x ∨ (y ∧ z) ≤ ___________
a) (x ∨ y) ∧ z b) (x ∧ y) ∨ z c) y ∨ (x ∧ z) d) x ∧ (y ∨ z)
22. If L1 & L2 be lattices, f : L1 → L2 be a map and x ≤ y in L1 ⇒ f(x) ≥ f(y) in L2 then f is
____
a) order-preserving b) order-reversing c) both (a)&(b) d) none of these
23. Bijective lattice homomorphism is called lattice ______________
a) monomorphism b) epimorphism
c) isomorphism d) none of these
24. Which one of the following lattices is not modular?
a) chain b) pentagon c) diamond d) distributive
25. In a complemented lattice, if x and y are complements to each other then ___________
a) x ∧ y = 0 b) x ∨ y = 1
c) both (a) & (b) d) neither (a) nor (b)
26. In a complemented distributive lattice L, ∀ a,b ϵ L, a ≤ b ⇒ ________________
a) a ∧ b’ = 1 b) a ∧ b’ = 0 c) a ∨ b’ = 1 d) a’ ∨ b = 0
27. The number of complements to an element in the complemented distributive lattice
is_____
a) 0 b) 1 c) 2 d) 3
28. In a complemented distributive lattice L, ∀ a ϵ L, a ∧ a’ = _________
a) 0 b) 1 c) 2 d) 3
29. In a complemented distributive lattice L, ∀ a ϵ L, a ∨ a’ = _________
a) 0 b) 1 c) 2 d) 3
30. A lattice is said to be bounded if it has __________
a) 0 b) 1 c) both (a) & (b) d) neither (a) nor (b)

Unit IV
BOOLIAN ALGEBRA
1. A _____________ lattice is called a Boolean lattice.
a). complimented distributive b). Complemented
d). distributive c). Commutative
2. In a Boolean algebra L, which if the following is true:
a). (a  b)  a  b b). (a  b)  a  b
c). (a  b)  a  b d). (a  b)  a  b
3. Which of the following statements is true?
a). Every Boolean algebra how atleast one element.
b). Every Boolean algebra has atleast two elements.
c). Any Boolean algebra does not contain 0 and 1.
d). In any Boolean algebra with 0 and 1, 0  0 and 1  1 .
4. Any finite Boolean algebra has ________ elements for some integer n  0 .
n n n1 n
a). less than 2 b). more than 2 c). exactly 2 d). exactly 2
5. An element which covers the element ________ is called as an atom of the lattice.
 n
a). 0 b). 1 c). 2 d). n
6. If a and b are two distinct atoms of a lattice, then _______
a). a  b  0 b). a  b  1 c). a  b  0 d). a  b  a
D
7. If 70 is the set of all divisors of 70, then 5  7  ________
a). 5 b). 7 c). 1 d). 35
D
8. If 70 is the set of all divisors of 70, then 2  5  ________
a). 1 b). 10 c). 7 d). 5
9. In a Boolean algebra, a  ( a   b )  ________
a). a  b b). a  b c). a  a d). a
10. In a Boolean algebra, a  ( a  b)  ________
a). a  b b). a  b c). a  a d). b
 
11. In a Boolean algebra, if ab  a b  0 then, _______
a). a  b b). a  b c). a  b d). a  0
12. In a Boolean algebra, if a  b  0 then _______
a). a  b b). a  b c). a  b d). a  b

13. In a Boolean algebra, for any a, b, c we have 

 a  c   b  c   ________.
a).
 a   b   c b).
a  b   c c). (a  b)  c d). ( a  b)  c
14. The atoms in D(120) are ________
a). 2,4,6,10,12 b). 2,3,6,10 c). 2,3,5 d). 2,4,5,10
0 1 0 1 0 1
15. For the Boolean polynomial p  x1  x2  x3  x4  x5  x6 , the min term is
represented by ________
a). min 17 b). min 14 c). min 19 d). min 35
16. The sum of product canonical form of the polynomial
p( x1 , x2 , x3 )  x1  x2 is _______

a).  b). 
2, 4, 6,8 2, 4,5,6, 7

c).  d). 
2,3, 4,5 2,3, 4,5, 6,7

17. The sum of product canonical form of the polynomial

p ( x 1 , x 2 , x 3 )  ( x 1  x 2 ) is
_________
a).  b).  c).  d). 
0,1 2,3, 4,5 2,3,5 2,3, 6,8

18. Considering the min term representation of polynomials, if

p( x1 , x2 , x3 )  3,5, 6 then
p  ________
a).  0,1, 2, 4, 6 b).  0,1, 2, 4, 7 c).  1,3,5, 7 d).  0, 2, 4, 6
19. The product of sum canonical form of
p( x 1 , x 2 , x 3 )  x 1  x 2
is given by _______
( x  x  x3 )  ( x1  x2  x3 )
a). 1 2 b).
( x1  x2  x3 )  ( x1  x2  x3 )
( x  x  x3 )  ( x1  x2  x3 )
c). 1 2 d). 1 2
( x  x  x3 )  ( x1  x2  x3 )

20. The sum of product canonical form of f ( x, y , z )  xy  yz is ________

a). xyz  xyz  xyz  xyz b). xyz  xyz  xyz  xyz
c). xyz  xyz  xyz  xyz d). xyz  xyz  xyz  xyz
21. In a 2-variable karnaugh map, the minterm representation of
f (a1 , a2 )  a1  a2 is
________.
m  m2  m3
a). 0
m  m1  m3
b). 0
m  m2  m3
c). 1 d). 0
m  m1  m2

22. The equivalent sum of products canonical form of

f (a1 , a2 )  a1  a2 is given by
_______.
aa aa aa
a). 1 2 1 2 1 2
aa aa aa
b). 1 2 1 2 1 2
aa aa aa
c). 1 2 1 2 1 2
aa aa aa aa
d). 1 2 1 2 1 2 1 2
23. The karnaugh maps with 3 variables will have ________ number of cells.
a). 9 b). 6 c). 8 d). 27
24. The karnaugh map with 4 variables will have ________ number of cells
a). 16 b). 64 c).24 d). 20
25. The karnaugh map with 5 variables will have ________ number of cells
a). 20 b). 10 c).32 d). 25
26. The sum of products canonical form for the minterm representation
f (a, b, c)  m0  m1  m4  m6 is given by ________.

a). ab  ac b). ab  ac c). ab  ac d). ab  ac

27. In a 4-variable karnaugh map with minterm m8  abcd , the equivalent binary
representation is ________.
a). 1110 b). 1001 c). 1000 d). 1101
28. In the 4-variable karnaugh map with minterm m12  abcd , the equivalent binary
representation is ________.
a). 1101 b). 1100 c). 1001 d). 1011
29. In a 4-variable karnaugh map, the term abcd will represent the minterm _______.
m
a). 0
m
b). 2
m
c). 8
m
d). 4
30. In a 4-variable karnaugh map, the term abcd will represent the minterm _______.
a). 6 b). 10 c). 7 d). 15
31. The combination of 4 cells in a 4-variable k-map 1
m  m5  m9  m13 will represent
_________.
a). cd b). cd c). cd d). cd
32. The sum 0
m  m2  m8  m10 in a 4-variable k-map will represent _________.

a). bd b). bd c). bd d). bd

33. The minterm representation 4
m  m6  m12  m14 is equivalent to ________ in a 4-
variable k-map.
a). bd b). bd c). bd d). bd
34. The number of k-map cells which are to be read as a group must be a power of
_______.
a). 3 b). 4 c). 2 d). 8
m ,m ,m ,m ,m ,m
35. In a 4-variable karnaugh map with minterms 0 2 4 8 10 12 and 15 , the
m
isolated cell is
m
a). 0
m
b). 2
m
c). 10
m
d). 15
 36. In a 5-variable karnaugh map  0,1,3,8,9,13,14,15,16,17,19, 24, 25, 27,31 there are
how many 8-blocks?
a). 2 b). 3 c). 1 d). none
f (a, b, c)   0,1, 4, 6 
37. The minimized representation of the k-map with is given by
_______.
a). ab  ac b). ab  ac c). ab  ac d). ab  ac
m
38. In a 4-variable karnaugh map the minterm 10 can also be represented as _______.
a). abcd b). abcd c). abcd d). abcd
m
39. In a 3-variable k-map, the min term 0 is represented as ________.
abc b). abc c). abc d). abc
a).
40. In a 3-variable K-map, the minterm m7 is equivalent to ________.
a). abc b). abc c). abc d). abc
Unit V
Choose the best answer
1. What is the value of binary sum of 1 and 1?
(a) 0 (b) 1 (c) 2 (d) either (a) or (b)
2. What is the value of binary sum of 0 and 1?
(a) 2 (b) 1 (c) 0 (d) either (b) or (c)
n
3. What is the identity element of B ?
(a) (0,0,…,0) (b) (1,1,…,1) (c) (0,0,0) (d) (1,1,1)
4. What is the value of x  x ?
(a) x (b) 1 (c) 0 (d) 2
5. What is the definition of weight of x?
(a) Number of 0’s in x (b) Number of 1’s in x
(c) Number of digits in x (d) Number of odd digits in x
6. What is the weight of 101011?
(a) 6 (b) 2 (c) 4 (d) 3
7. What is the weight of 110011?
(a) 6 (b) 2 (c) 3 (d) 4
8. What is the weight of 101010?
(a) 6 (b) 2 (c) 4 (d) 3
9. What is the definition of Hamming distance between x and y?
(a) The binary sum of x and y (b) The weight of sum of x and y
(c) The sum of x and y (d) The weight of the binary sum of x
and y
10. What is the Hamming distance of 1011 and 0101?
(a) 1110 (b) 1 (c) 3 (d) 4
11. What is the Hamming distance of 0110 and 1010?
(a) 1100 (b) 1 (c) 2 (d) 3
n
12. The value of  ( x, y )  ---------- if and only if x  y x, y  B .
(a) 1 (b) 2 (c) 0 (d) 3
13. | a  b |  ----------.
(a) | a |  | b | (b) | a  b | (c) a  b (d) a  b
14. What is the code word for 101 under (3, 4) parity check?
 (a) 1011 (b) 110 (c) 101 (d) 1010
15. The received message and the code word differ in at least one but no more than ------
position.
(a) k (b) k-1 (c) k+1 (d) k+2
16. What is the condition for a group code?
n
(a) The range of e is a subgroup of B
n
(b) (b) The domain of e is a subgroup of B
n
(c) The range of e is an abelian group of B
n
(d) The domain of e is an abelian group of B
17. If x  1011 and t
x  1010 then x is transmitted with -------
(a) two errors (b) one error (c) three errors (d) no error
18. The parity check code cannot detect ----------
(a) one error (b) two errors (c) both (a) and (b) (d) any error
19. What is the minimum distance of a group code?
(a) The minimum weight of a non-zero code word
(b) The maximum weight of a non-zero code word
(c) The weight of a non-zero code word
(d) The weight of a zero code word
2 4
20. What is the minimum distance of the encoding function e : B  B given by e(00) =
0000, e(10) = 0110, e(01) = 1011, e(11) = 1100)?
(a) 3 (b) 2 (d) 1 (d) 4
21. For the (n, m) decoding function d, the definition of d  e is --------
I I m n
(a) B n (b) B m (c) e( B ) (d) e( B )
22.
e(b1b2 ...bm ) can be written as ----------- for the (m, 3m) encoding function.
b b ...b b b ...b b b ...b b b ...b b b ...b b b ...b
(a) 1 2 m (b) 1 2 m 1 2 m (c) 1 2 m 1 2 m 1 2 m (d) 1 2 n
b b ...b
23. Which of the following is the decoding function for (4, 5) parity check code?
5 4 4 5 2 3 m n
(a) d : B  B (b) d : B  B (c) d : B  B (d) d : B  B
24. Which one of the following is true?
(a) e H is not a group code (b) (m, m+1) parity check code is not a group code
(c) (m, m+1) parity check code cannot detect a single error
(d) e H is a group code
25. The decoding function‘d’ should give the original message when there is/are ------
during transmission.
(a) one error (b) two errors (c) no error (d) three errors
m r
26. If x  y1 y 2 ... y m c1c 2 ...c r  B , then ------- if and only if x  e H (b) for some b  B .
m

(a) x * H  1 (b) x * H  0 (c) x * H  3 (d) x  0

Answer Key

Unit I

1. a 2. d 3. b 4. b 5. b

6. c 7. a 8. b 9. d 10. c

11. c 12. a 13. d 14. c 15. b

16. c 17. a 18. a 19. c 20. b

21. a 22. b 23. c 24. d 25. b

26. c 27. a 28. c 29. a 30. d

Unit II

1. C 2. A 3. b 4. a 5. b
6. c 7. a 8. d 9. b 10. c
 11. a 12. b 13. c 14. a 15. d
16. b 17. c 18. b 19. a 20. c
21. d 22. b 23. a 24. b 25. c
26. d 27. c 28. d 29. a 30. b

Unit III

1. a 2. c 3. b 4. d 5. b
6. a 7. d 8. b 9. c 10. a
11. c 12. c 13. a 14. c 15. d
16. a 17. b 18. d 19. b 20. a
21. a 22. b 23. c 24. b 25. c
26. b 27. b 28. a 29. b 30. c

Unit IV

1. a 2. c 3. b 4. d 5. a

6. c 7. d 8. b 9. a 10. b

11. c 12. d 13. a 14. c 15. c

16. d 17. a 18. b 19. a 20. b

21. a 22. b 23. c 24. a 25. c

26. b 27. c 28. b 29. b 30. a

31. d 32. d 33. a 34. c 35. d

36. c 37. a 38. a 39. d 40. a

Unit V
1. a 11. c 21. b
2. b 12. c 22. c
3. a 13. a 23. a
4. c 14. d 24. d
5. b 15. a 25. a
6. c 16. a 26. b
7. d 17. b
8. d 18. b
9. d 19. a
10. c 20. b