Scribd
Upload
33 views1 page

Module 4.boolean Algebra

This document covers various topics in Boolean algebra and logic circuits, including number conversions between different bases, operations using complement methods, and theorems of Boolean algebra. It also includes tasks for simplifying Boolean functions, expressing them in minterms and maxterms, and designing combinational circuits such as half adders and multiplexers. Additionally, it provides step-by-step procedures for designing these circuits and includes truth tables for full adders.

Uploaded by

sainithish2006
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
33 views1 page

Module 4.boolean Algebra

This document covers various topics in Boolean algebra and logic circuits, including number conversions between different bases, operations using complement methods, and theorems of Boolean algebra. It also includes tasks for simplifying Boolean functions, expressing them in minterms and maxterms, and designing combinational circuits such as half adders and multiplexers. Additionally, it provides step-by-step procedures for designing these circuits and includes truth tables for full adders.

Uploaded by

sainithish2006
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

Module – 3: Boolean algebra and Logic Circuits

1.​ Convert the following:


i.​(225)10 = (?)2 = (?)8 = (?)16
ii.​(11010111)2 = (?)10 = (?)8 = (?)16
iii.​(623)8 = (?)10 = (?)2 = (?)16

2.​ Perform the following operations:​


i)​1101 − 0101 using 1’s complement method
ii)​0110 − 0010 using 2’s complement method
iii)​924 − 126 using 9’s complement method
iv)​265 − 424 using 10’s complement method

3.​ Subtract using (r − 1)’s complement method​


a) 4456(10) − 34234(10)
Subtract using r’s complement method
a) 1010100(2) − 1000100(2)
4.​ Mention the postulates and theorems of Boolean algebra.​
5.​ State and prove De Morgan’s theorem with its truth table.
6.​ Simplify the following Boolean functions to minimum number of literals:
i)​ x(x′ + y)
ii)​ xy + x′z + yz
iii)​ A 'BC + ABC ' + AB
iv)​ A + BC + B
v)​ (x + y)(x + z) = x + yz
vi)​ xy + xz + y' = xz + y'
7.​ Express the Boolean function
i)​ F = A + B 'C in a sum of minterms form
ii)​ F = xy + x 'z in a product of maxterms form
8.​ Implement the following Boolean functions by using logic gates:​
(i) F1 = xy′ + x′z (ii) F2 = x′y′z + x′yz + xy′

9. Write the step-by-step procedure to design a combinational circuit.


​
10. ​Design a half adder with necessary logic diagram and expressions.​
11. With the help of truth table, explain the operation of full adder with sum and
carry expressions, along with its circuit diagram.​

12. Design a full adder circuit using two half adders.


13. Design and explain a 2x1 multiplexer with a neat diagram.
14. Design and explain a 4x1 multiplexer with a neat diagram.

You might also like