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

Explain the use of structures with pointers., Explain the use of structures...

Explain the use of structures with pointers C permits a pointer to a structure variable. In fact a pointer to a structure is same to a pointer to any other variable. The pointe

Define both fork and vfork, How and when race conditions happen in process ...

How and when race conditions happen in process control? How can it be avoided? b. Differentiate among following functions giving related syntax: (i) fork and vfork (ii) w

How to fix an asic-based design from easiest to most extreme, How to fix an...

How to fix an ASIC-based design from easiest to most extreme? There are different ways to fix an ASIC-based design as given below: Initially, assume some reviews fundamentally.

Computer Network, Write a short notes on transition from IPv4 to IPv6

Write a short notes on transition from IPv4 to IPv6

Microcontrollers (mcu), Main Objectives: Uploading codes into the mi...

Main Objectives: Uploading codes into the microcontrollers Interfacing between both microcontrollers via I 2 C Reading and writing into various ports on the MCU Int

Basic performance equation, Explain the basic performance equation Ans...

Explain the basic performance equation Ans: The basic performance equation is following T = N * S/ R T =>  It is processor time required to execute a program N => act

How many i/p & o/p a full adder logic circuit will have, A full adder logic...

A full adder logic circuit will have ? Ans. The full adder logic circuit also accounts the carry i/p generated in the earlier stage and it will add two bits. Hence three inputs

The method(s) of payment for online consumers, The method(s) of payment for...

The method(s) of payment for online consumers are A) Electronic cash    (B) Credit/debit C) Electronic checks

Common problem with hill climbing, Common problem with Hill climbing: ...

Common problem with Hill climbing: An alternative way of justifying the problem is that the states are boards with 8 queens already on them, so an action is a movement of one

large block , Given a RAID 3 (bit-interleaved parity) with k disks, how we...

Given a RAID 3 (bit-interleaved parity) with k disks, how well will large block transmits work? How well will it handle a high I/O request rate? Compare the performance to a one di

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