# gate digital logic design ## DLD |Gate-2006| Previous Year Questions| Set-15

DLD |Gate-2006| Digital Logic Design Consider numbers represented in 4-bit gray code. Let h3h2h1h0 be the gray code representation of a number n and let g3g2g1g0 be the gray code of (n+1) (modulo 16) value of the number. Which one of the following functions is correct? [GATE – 2006] a. g0(h3h2h1h0) = Σ(1,2,3,6,10,13,14,15)b. g1(h3h2h1h0) = Σ(4,9,10,11,12,13,14,15)c. g2(h3h2h1h0) = Σ(2,4,5,6,7,12,13,15)d. g3(h3h2h1h0) … ## DLD |Gate-2007| Previous Year Questions| Set-14

DLD |Gate-2007| Digital Logic Design What is the maximum number of different Boolean functions involving n Boolean variables? [GATE – 2007] a. n2b. 2nc. 22nd. 2n2 Answer : c) How many 3-to-8 line decoders with an enable input are needed to construct a 6-to-64 line decoder without using any other logic gates? [GATE – 2007] … ## DLD |Gate-2008| Previous Year Questions| Set-13

DLD |Gate-2008| Digital Logic Design In the IEEE floating point representation, the hexadecimal value 0×00000000 corresponds to : [GATE – 2008] a. the normalized value 2-127b. the normalized value 2-126c. the normalized value +0d. the special value +0 Answer : d) Let r denote number system radix. The only value(s) of r that satisfy the … ## DLD |Gate-2009| Previous Year Questions| Set-12

DLD |Gate-2009| Digital Logic Design (1217)8 is equivalent to : [GATE – 2009] a. (1217)16b. (028F)16c. (2297)10d. (0B17)16 Answer : b) What is the minimum number of gates required to implement the Boolean function (AB+C) if we have to use only 2-input NOR gates? [GATE – 2009] a. 2b. 3c. 4d. 5 Answer : b) How many 32K × …