Scribd
Upload
115 views2 pages

Tutorial Sheet - 11 (Boolean Algebra)

The document discusses Boolean algebra and logic circuits. It includes: 1. An example logic circuit with 4 inputs (A, B, C, D) and an output (Y). It asks the value of Y for two sets of input values. 2. A description of how to implement a logic function using only AND and OR gates. 3. Simplifying several Boolean functions using laws and theorems of Boolean algebra. 4. Expressing two logic functions in both sum of minterms and product of maxterms canonical forms.

Uploaded by

Sulabh Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
115 views2 pages

Tutorial Sheet - 11 (Boolean Algebra)

The document discusses Boolean algebra and logic circuits. It includes: 1. An example logic circuit with 4 inputs (A, B, C, D) and an output (Y). It asks the value of Y for two sets of input values. 2. A description of how to implement a logic function using only AND and OR gates. 3. Simplifying several Boolean functions using laws and theorems of Boolean algebra. 4. Expressing two logic functions in both sum of minterms and product of maxterms canonical forms.

Uploaded by

Sulabh Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Basic Electronic Devices and Circuits (10B11EC211) Tutorial Sheet-11 (Boolean Algebra) 1. 2.

Use the expression for Y to determine the output of the circuit in conditions A = 0! B =1! C =1! and D = 0 Use the expression for Y to determine the output of the circuit in conditions A = B = E =1! C = D = 0 Fig 1a for the (Ans. Y " 1) Fig 1b for the (Ans. Y " 1)

Fig. 1 3. 4. 5. . #etermine the ans$ers to %uestions 1 and 2 b& finding the logic le'els present at each gate input and output (Ans. Y " 1! Y " 1) #escribe ho$ to implement the logic function () b& using onl& *() gates Build t$o different logic circuits to implement the Boolean function F
= ( A + B ) C

+implif& the follo$ing Boolean functions b& using la$s and theorems of Boolean algebra , (a) F = B ( A + B ) (b) F = A +B +AB C F = A B C D + A B C D (c) (d) F = A C + A B + A B C + B C (e) F = A BC + ABC + ABC (f) F = A C +BC +ABC +ABC (Ans. , (a) B- (b)
A + B +C -

(c )

ABC

- (d)

AB +C B +A C

(e) A( B + C ) - (f) !. (a) F ( x! y ! z ) =1 (b)

Express the follo$ing functions in a sum of minterms and a product of maxterms ,


F ( A! B! C ! D ) =D ( A +B ) +B D

(Ans. , (a) F = (0!1!2!2!1!0!/!.) = ( ) (0! 2! 1! /! 4!10!12!11) ) (1! 2! 0! .! 3!11!12!10) " (b) F =

".

Con'ert the follo$ing to the other canonical form , (1! 2! .) (0! 2! /! .) (a) F ( A! B! C ) = (b) F ( A! B! C ) =
F = (1! 2! 1! 0) ) (0! 2! 1! 0! /) - (b) (Ans. , (a) F =

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy