Scribd
Upload
5 views2 pages

Dsd

A universal gate can implement all basic logic gates, with NAND and NOR being universal as they can realize any Boolean expression. De Morgan's theorems state that the complement of OR is equal to the AND of the complements, and the complement of AND is equal to the OR of the complements, which can be verified using truth tables. A half adder adds two 1-bit binary numbers with outputs for sum and carry, while encoders convert multiple input lines into fewer output lines, and decoders do the reverse.

Uploaded by

Divya Priya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views2 pages

Dsd

A universal gate can implement all basic logic gates, with NAND and NOR being universal as they can realize any Boolean expression. De Morgan's theorems state that the complement of OR is equal to the AND of the complements, and the complement of AND is equal to the OR of the complements, which can be verified using truth tables. A half adder adds two 1-bit binary numbers with outputs for sum and carry, while encoders convert multiple input lines into fewer output lines, and decoders do the reverse.

Uploaded by

Divya Priya
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd

Two-Mark Answers

1. What is a universal gate? Why are NAND and NOR called universal gates?
A universal gate is a logic gate using which all the basic gates (AND, OR and NOT) can be
implemented.

NAND and NOR are called universal gates because any Boolean expression or any basic logic
gate can be implemented using only NAND gates or only NOR gates.

2. State De Morgan’s theorems and verify them using logic gates.


De Morgan’s First Theorem:
(A + B)' = A'B'
The complement of OR is equal to the AND of the complements.

De Morgan’s Second Theorem:


(AB)' = A' + B'
The complement of AND is equal to the OR of the complements.

Verification: Both theorems can be verified by comparing the truth tables of the two sides;
the outputs are identical for all input combinations.

3. What is a half adder? Write its truth table and Boolean expressions.
A half adder is a combinational circuit that adds two 1-bit binary numbers A and B.

Outputs: Sum (S) and Carry (C).

Truth Table:
A B S C
0 0 0 0
0 1 1 0
1 0 1 0
1 1 0 1

Boolean expressions:
S=A⊕B
C = AB

4. Differentiate between encoder and decoder.


Encoder:
• Converts 2^n input lines into n output lines.
• Performs encoding operation.
• Example: 8-to-3 encoder.
Decoder:
• Converts n input lines into 2^n output lines.
• Performs decoding operation.
• Example: 3-to-8 decoder.

You might also like