Scribd
Upload
55 views1 page

Ee101 Tutorial 1

1. The document provides 7 tutorial problems on Boolean algebra and digital logic circuits. It includes problems on number conversion between binary, octal, decimal and BCD, proving Boolean algebra rules, drawing gate-level logic diagrams, simplifying Boolean expressions, writing Boolean expressions based on logic diagrams, and drawing logic circuits using only NAND or only NOR gates. 2. The problems cover a range of topics including number systems, Boolean algebra rules, logic gate diagrams, simplifying Boolean expressions, writing expressions based on diagrams, and drawing circuits with restricted gates. 3. Solutions to the problems will demonstrate skills in digital logic, Boolean algebra, logic circuit design and gate-level implementation.

Uploaded by

swapnil
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
55 views1 page

Ee101 Tutorial 1

1. The document provides 7 tutorial problems on Boolean algebra and digital logic circuits. It includes problems on number conversion between binary, octal, decimal and BCD, proving Boolean algebra rules, drawing gate-level logic diagrams, simplifying Boolean expressions, writing Boolean expressions based on logic diagrams, and drawing logic circuits using only NAND or only NOR gates. 2. The problems cover a range of topics including number systems, Boolean algebra rules, logic gate diagrams, simplifying Boolean expressions, writing expressions based on diagrams, and drawing circuits with restricted gates. 3. Solutions to the problems will demonstrate skills in digital logic, Boolean algebra, logic circuit design and gate-level implementation.

Uploaded by

swapnil
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
You are on page 1/ 1

EE101-TUTORIAL-1 (7th August 2019)

1. Convert the following numbers


i. (2765.102)8= ( _____ )16
ii. (1100010101)BCD =( ______ )10
2. Prove the following rules of Boolean algebra:
i. 𝐴 + 𝐴̅ 𝐵 = 𝐴 + 𝐵
ii. (𝐴 + 𝐵)(𝐴 + 𝐶 ) = 𝐴 + 𝐵𝐶
3. Draw the Gate level logic diagram for the following Boolean expressions
i. 𝑌 = [𝐷 + (𝐴 ̅̅̅̅̅̅̅̅̅̅̅
+ 𝐵)𝐶 )]𝐸
ii. 𝑌 = 𝐴𝐶 + 𝐵𝐶̅ + 𝐴̅𝐵𝐶
4. Simplify the Boolean expressions simplification
i. 𝑌 = 𝐴̅𝐷 + 𝐴𝐵𝐷 simplify to minimum numbers of literals
ii. 𝑌 = ̅̅̅̅̅̅̅̅̅̅
𝐴 + 𝐵̅𝐶 simplify to one having only single variables inverted
5. Write the Boolean expression for output x in Figure in term of A, B and C.
Determine the value of x for all possible input conditions, and list the values in a
truth table.

6. Draw all basic gates using NAND gates only or NOR gates only.
7. Write the Boolean expression for output x in Figure, in terms of Boolean variables
A, B , C and D

You might also like