Scribd
Upload
9 views1 page

17-Tut 4 BCS303

This document contains 8 questions related to Boolean algebra and logic circuits. The questions cover topics like simplifying Boolean functions using Karnaugh maps, finding equivalent expressions in Boolean algebra, expanding Boolean functions to sum of products and product of sums forms, drawing logic circuits, and finding minterm normal forms.

Uploaded by

bindu
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
9 views1 page

17-Tut 4 BCS303

This document contains 8 questions related to Boolean algebra and logic circuits. The questions cover topics like simplifying Boolean functions using Karnaugh maps, finding equivalent expressions in Boolean algebra, expanding Boolean functions to sum of products and product of sums forms, drawing logic circuits, and finding minterm normal forms.

Uploaded by

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

SESSION-2023-2024

TUTORIAL – 4
SEM-3rd

In Pursuit of Excellence
BCS303: Discrete Structures and Theory of Logic

[CO- 4]

Q1. Simplify the following Boolean function using three variables maps:
(a) f (x , y , z)=Σ(0 ,1 , 5 ,7)
(b) f (x , y , z)=Σ(1 , 2 ,3 ,6 , 7)

Q2. Draw Karnaugh map and simplify the Boolean expression: -


A ’ B ’ C ’ D ’ + A ’ BC ’ D+ A ’ B ’ C D+ A ’ B ’ C D ’+ A ’ B C D

Q3. Find the values of the Boolean function represented by F (x , y , z)=xy + z ’.

Q4. Show that the following are equivalent in a Boolean algebra


' ' ' '
a ≤ b ⟺ a∗b =0 ⟺ b ≤ a ⟺ a ⊕ b=1 .
(here * denotes meet/and ⊕ denotes join/or.)

Q5. Find the sum-of-products and Product of sum expansion of the Boolean function
F (x , y , z)=(x+ y) z ’ .

Q6. Consider the Boolean function f ( x 1 , x 2 , x3 , x 4 )=x 1 +¿

(i) Simplify f algebraically.


(ii) Draw the circuit of f and reduction of f.
(iii) Find minterm normal form of f.

Q7. Simplify the following Boolean expression using k map:

(a) Y =¿ ¿
(b) A' B' C' D' + A ' B' C ' D+ A' B ' CD+ A ' B' B' C D' = A' B'

Q8. Draw a logic circuit corresponding to Boolean expression

(a) Y = A +BC +B
(b) f ( x 1 , x 2 , x3 ) =( x 1 x 2 + x 3 )( x 2 + x 3 ) + x 3

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