DIGITAL ELECTRONICS IMPORTANT QUESTIONS
SHORT ANSWER QUESTIONS
1. [Link] the following octal numbers into binary
(a) 776 (b) 0.65 (c) 67.53
2. Convert the following hexadecimal numbers into decimal
(a) A6 (b) BF.3 (c) C3.5
3. Perform the following binary addition
(a) 1110 + 1010 (b) 1100.101 + 1001.001 (c) 11010.10 +
11.1101
4. Simplify the following logic expression by using Boolean Algebra.
A'B'C' + AB'C' + BC + A'B'C
5. Define 1's and 2' complement.
6. Draw the symbols of AND , OR and NOT gates
7. Distinguish between weighted and unweighted code
8. State & explain the De-morgan’s theorem.
9. What is minterm and maxterm ?
[Link] the given expression into canonical SOP. AB + BC + CA
[Link] different logic families ?
[Link] the terms:
1. Propagation delay
2. Fan-in
3. Fan-out
[Link] TOTEM - POLE OUTPUT.
[Link] the IC number of logic gates .
[Link] the term Figure of merit and noise margin .
[Link] the logic circuit of Full – adder using EX-OR and AND gates. Give
its truth table.
[Link] a half adder using NOR gates only.
[Link] between serial and parallel comparator.
[Link] multiplexer.
[Link] the working of 2-bit comparator.
[Link] the need of tristate buffer. Give its symbolic representation.
[Link] the 3 to 8 decoder circuit.
[Link] are the Applications of Demultiplexer.
[Link] Sequential logic circuit.
[Link] R-S flip-flop and write its truth table.
[Link] the NAND latch with truth table.
[Link] the need for a Register.
[Link] the types of Triggering.
[Link] :
(a) Flip-flops (b) Registers (c) counters
[Link] the applications of shift registers.
LONG ANSWER QUESTIONS
1. convert the following
a) (38)10 – ( )2
b) ( 257)8 - ( )10
c) ( 3570)8 - ( )16
d) (1001101)2 into Gray code
2. Draw the logic circuits for the realization of AND , OR and NOT operations
using NAND and NOR gates.
a) List out different theorems of Boolean algebra .
b) B) Define Excess - 3 code and write 3 - variable truth table.
3. Convert the given expression into canonical POS a) F = (A+B)(B+C)(C+A)
b) F(A,B,C,D) = ΠM (0,1,2,5,6,7,11) c) F = (A+B) ( A+B+C)
4. Simplify the following expressions using k-map. i) S = ΠM (0,1,2,3,4,7)
ii) ABC + A'BC' + A'BC + AB'C + ABC'
5. a) Subtract (101011)2 from (111001)2 by using 1's complement.
b) Subtract (0110)2 from (1101)2 by using 2's complement
6. Compare among TTL,COMS and ECL families
7. Draw totem pole TTL NAND gate circuit and explain its working
8. Draw and explain TTL NAND gate open collector type circuit
9. Draw a CMOS NAND gate circuit explain its operation.
[Link] the truth table of full-adder, write the logic expressions for sum and
carry from the truth table, simplify them using karnaugh maps.
[Link] and explain the operation of full subtractor circuit with a truth table
and construct full subtractor using two half subtractors.
[Link] the logic circuit of 4×1 multiplexer and give its truth table.
[Link] the working of 1 to 8 demultiplexer circuit with diagram .
[Link] the circuit diagram of 3×8 Decoder and explain working.
[Link] the circuit diagram of BCD to Decimal decoder and explain the
working .
[Link] the circuit diagram of 2’s complement adder/subtractor and explain
the working .
[Link] the operation of R - S Flip-Flop with neat diagrams.
[Link] the operation of D flip-flop with the help of truth table .
[Link] neat sketch explain the working of edge triggered JK flip- flop .
[Link] the operation of master – slave JK flip-flop with neat sketch .
[Link] explain the data transfer in the following registers.
(a) Serial in serial out (b) Serial in parallel out
(c) Parallel in serial out (d) Parallel in parallel out
[Link] between synchronous and asynchronous counters.
[Link] is meant by modulus of the counter? Explain Mod-10 ripple counter.
[Link] the working of 4-bit asynchronous counter with a circuit and timing
diagram.
[Link] is meant by down counter? How can we get down counting?
[Link] about Ring counter.
[Link] the working principle of NV RAM.
[Link] the working of Diode ROM.
