Scribd
Upload
5 views1 page

Digital Logic

The document outlines a series of exercises related to digital logic and number systems, including drawing truth tables for basic logic gates, constructing an XOR gate using NAND gates, and proving NAND as a universal gate. It also includes tasks for converting numbers between different bases, performing arithmetic operations in binary, octal, decimal, and hexadecimal, and simplifying Boolean expressions. Additionally, it covers designing circuits and truth tables for specific logical conditions and expressions.

Uploaded by

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

Digital Logic

The document outlines a series of exercises related to digital logic and number systems, including drawing truth tables for basic logic gates, constructing an XOR gate using NAND gates, and proving NAND as a universal gate. It also includes tasks for converting numbers between different bases, performing arithmetic operations in binary, octal, decimal, and hexadecimal, and simplifying Boolean expressions. Additionally, it covers designing circuits and truth tables for specific logical conditions and expressions.

Uploaded by

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

1.

Draw the truth tables for AND, OR, NOT


Digital Logic & gates.
2. Construct XOR gate using only NAND
Number Systems gates. Show truth table.
3. Prove that NAND is a universal gate by
Question Bank constructing AND and OR using NAND.
4. Design a circuit using logic gates that
gives output 1 only when exactly two
inputs out of A, B, C are 1.
1. Number Systems 5. Write the truth table for (A+B)(A′+C)(A
+ B)(A′ + C).
1. Convert (1101)2, (1101)_2 to decimal. 6. Simplify the Boolean expression:
2. Convert (347)8, (347)8 to decimal. (A+B)(A′+C)(B+C)(A + B)(A′ + C)(B + C).
3. Convert (2A5)16, (2A5)16 to binary. 7. Design the truth table for a Half-Adder
4. Convert (101101.101)2, (101101.101)2 and provide Boolean expressions for
Sum and Carry.
to octal.
5. Convert (375)10, (375)10 to
hexadecimal.
6. Perform (1011)2+ (1101)2, (1011)_2 +
(1101)_2 using binary addition. 4. Truth Tables &
7. Subtract (11001)2−(10110)2, Expressions
(11001)_2 - (10110)_2 using the 2’s
complement method. 1. Write the truth table for the expression:
F=A⋅B+A′⋅CF = A \cdot B + A′ \cdot C.
2. Simplify using Boolean algebra: X+X′YX
+ X′Y.
2. Base Arithmetic 3. Reduce the expression:
F=(A+B)(A+C)(B+C)F = (A + B)(A + C)(B
1. Multiply (101)2 × (11)2, (101)_2 x + C).
(11)_2 and express the result in binary 4. Construct the truth table for
and decimal. F=(A+B′)(B+C)F = (A + B′)(B + C).
2. Add (235)8+(457)8, (235)_8 + (457)_8 5. Simplify F(A,B,C)=Σ(0,1,2,5,6,7)F(A,B,C)
and express the result in octal. = Σ(0,1,2,5,6,7) using Karnaugh Map.
3. Subtract (A6)16−(3B)16, (A6)_{16} - 6. Prove De Morgan’s Laws using truth
(3B)_{16} and express the result in tables.
hexadecimal. 7. Write the SOP (Sum of Products) form
4. Multiply (24)10×(15)10(24)_{10} for the truth table where F=1F = 1 for
\times (15)_{10} and convert the result minterms 1, 3, 5, 7.
to binary.
5. Perform (1A)16 + (1110)2, (1A)_{16} +
(1110)_2. Express the answer in
hexadecimal.

3. Logic Gates

You might also like