1) State the base of following number system: Decimal, binary, octal, hexadecimal
2) Convert the given binary into decimal, octal, hexadecimal and gray code: (10110101)2
3) Draw the OR gate and NOR gate using NAND gate only.
4) Compare TTL, ECL and CMOS logic families. (any four points)
5) Define following terms :
i) Fan-in
ii) Fan-out
iii) Power dissipation
iv) Noise margin
6) i) State the rules of BCD addition.
ii) Perform BCD addition of : (972)10 + (348)10
7) Reduce following boolean expressions using boolean laws.
i) Y = AB + AB + AB + A B
ii) Y = ABC + ABC + ABC
iii) Y = ABC + ABC + ABC
8) List the uses of following codes: i) BCD code ii) ASCII
9) Perform the following subtractions using 2'S compliment method.
i) (1100)2 – (0011) 2 ii) (10101) 2 – (11100) 2
10) Realize the following logic operations using only NOR gates i) OR ii) EX-NOR
11) Draw the symbol, truth table and logical expression of following gates : i) EX-OR
gate ii) NAND gate
12) Convert the following
i) (ABCD)16 = ( ? )10
ii) (101011001111)2 = ( ? )10
iii) (101011001111)2 = ( ? )8
13) Draw the circuit diagram of 3-input TTL NAND gate and explain its working.
14) List the octal and hexadecimal numbers for decimal number 0 to 15.
15) Convert (159)10 = ( ? )8 Convert (380)10 = ( ? )16
16) Draw symbol, truth table of NAND gate.
17) Perform the subtraction using 2’s complement methods. (10110)2 – (11010)2
18) Explain the following characteristics with respect to logic families -
i) Power dissipation
ii) Fan-in and fan-out
iii) Noise margin
iv) Speed of operation
19) Define following terms :
(1) Fan in
(2) Power dissipation
20) Convert (53)10 = (BCD)
(34)10 = (Excess-3)
(100111)2 = (Gray)
(11010)2 = (2’s complement)
21) Write the gray code of given no. (11011)2 = ( ? )Gray
22) State and explain De-Morgan’s theorems.
23) Design basic logic gates using NAND and NOR gate.
24) Define following characteristics of logic families. i) fan in ii) fan out
25) Draw symbol of NAND and NOR Gate with its boolean expression
26) Perform the following substration using 1’s complement method i) (48)10 – (68)10
ii) (1011)2 – (101)2
27) Draw the circuit for NoT, OR and AND gate using NAND gate only.
28) Simplify the following Boolean expression using Boolean laws. y = AB + AC + BC
29) State and prove De-morgan’s Theorems. (Any one)
30) What are BCD numbers ? Perform BCD addition for the following
i) (68)10 + (44)10
ii) (50)10 + (36)10
31) Compare the parameters of TTL, ECL and CMOS logic families (Any four points)
32) Find the Boolean expression for logic circuit given in Fig. No. 1 and reduce it using
Boolean algebra.
33) Give advantages of BCD codes (Any two).
34) List OR laws of boolean algebra.
35) Perform subtraction using 2’s complement method (85)10 – (98)10.
36) Implement basic gates using NAND gate.
37) Realize the following equations using NAND gate only.
i) Y = AB + CD
ii) Y = A + B.
38) Do following conversions –
i) (A26.48)16 → (?)10
ii) (172.95)10 → (?)8
iii) (0101 0011)BCD → (?)2
39) Define :
(i) Word
(ii) Nibble
40) Convert decimal numbers 129, 181 into Binary.
41) Simplify the following expression and draw logic diagram :
Y = (A B’ + A + B’ ) A · B
42) Design the following gates using universal logic gate and write their truth table :
(i) OR (ii) NOT
43) Explain binary to Gray code conversion with suitable example.
44) Given the following logic diagram in Figure, write its truth table. Identify equivalent
gate for the obtained truth table.
45) Convert the decimal number (25.4)10 into its equivalent binary.
46) Subtract using 2’s complement method :
(1) (11011) 2 – (1010) 2
(2) (10111) 2 – (11000) 2
47) Convert the following :
(498.25)16 = ( )10
(101100101) 2 = ( )16
(B689D)16 = ( )8
48) Convert the following :
(i) (105)10 = (?)2 (ii) (126)8 = (?)16
49) Explain rules to simplify Boolean expression using K-map.
50) Implement basic gates using NAND gate only.
51) Interpret De Morgan’s theorem with its statement & proof.
52) Refer given figure and write the o/p for each of the following input :
53) Define 1’s complement and write example of it.
54) Convert (65.43)8 to binary number.
55) Describe Gray to binary and binary to Gray code conversion with example.
56) Reduce the following Boolean expression using laws of Boolean algebra and realize
using basic logic gates :
Y = (A + BC) (B + C’A)
57) Describe characteristics of Digital IC
58) State the names of universal logic gates and design basic gates using universal gates.
59) Define the term: i) Bit ii) Byte
60) Draw symbol and truth table of: i) AND gate ii) NOR gate
61) State and prove De-Morgans theorem.
62) Perform following using 2’s compliment: i) (53)10 – (38)10 ii) (35)10 – (42)10
63) Design basic gates using NAND gates only.
