Simplify the expressions using boolean postulates, Computer Engineering

Assignment Help:

Simplify the given expressions using Boolean postulates

XY + X‾Z‾  + XY‾Z (XY + Z)

Ans. XY + X‾Z‾ + XY‾Z (XY + Z)
= XY + X‾Z‾ + XY‾Z (XY + Z)
= XY + X‾Z‾  + XXYY‾Z + XY‾ZZ
= XY + X‾Z‾  + XYZ             (As YY‾ = 0 and ZZ = Z)
= XY + X‾ + Z‾ + XY‾Z (As X‾Z‾ = X‾ + Z‾)
= X‾ + XY + Z‾ + XY‾Z
= X‾ + X (Y + Y‾Z) + Z‾
= X‾  + X (Y +Z) + Z‾  (As Y + Y‾Z = Y+Z)
= X‾ + X Y (Z+ Z‾ ) + XZ + Z‾  (As Z+ Z‾  =1)
= X‾ + X Y Z + XYZ‾ + XZ + Z‾
= X‾ + XZ (1+ Y) + Z‾ (1+XY)
= X‾ + XZ + Z‾  (As 1+ Y = 1  and 1+XY = 1)
= X‾ + XZ) + Z‾
=(X‾ + Z) + Z‾  (As X‾ + XZ = X‾  + Z‾
= X‾  +( Z + Z‾)
= X‾ +1 (As Z + Z‾  = 1)
=1 (As X‾ +1 = 1)

 


Related Discussions:- Simplify the expressions using boolean postulates

Maximum number of nodes in a binary tree, The maximum number of nodes in a ...

The maximum number of nodes in a binary tree of depth 5 is 31 is the maximum number of nodes in a binary tree

Illustrate about probability of collision, Illustrate about probability of ...

Illustrate about probability of collision? Probability of collision: There is a triangle and on this let’s assume that there are three ants one on each corner and are free t

Difference between depth first and breadth first traversing, Explain the di...

Explain the difference between depth first and breadth first traversing techniques of a graph.   Depth-first search is dissimilar from Breadth-first search in the following way

Code Solution, Dear sir, I want to read Excel file and display it in grid v...

Dear sir, I want to read Excel file and display it in grid view(the headings in excel file should be grid view column heading).This should be coded in C# Windows forms Application

Programming project, l need a help for my project pllz:) Write a program th...

l need a help for my project pllz:) Write a program that will simulate ATM machine. The Program should prompt the user to enter a valid PIN password number of 5 digits (PIN: 12312)

First-order inference rules, First-Order Inference Rules: Here now we ...

First-Order Inference Rules: Here now we have a clear definition of a first-order model is that we can define soundness for first-order inference rules in the same way such we

Explain a schematic diagram of thousand line exchanges, Using a combination...

Using a combination of uniselectors and two motion selectors draw a schematic of thousand line exchanges. The schematic diagram for such an exchange is demonstrated in Fig. All

Propositional truth tables, Propositional truth tables: There {X\t} is...

Propositional truth tables: There {X\t} is a substitution that replaces all occurances of variable X with a term representing an object t as:  ∀X. A is true if and only

Two different ways of building a match code object, What are the two differ...

What are the two different ways of building a match code object? A match code can be built in two dissimilar ways: Logical structure: The matchcode data is set up not pe

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd