Q. 4.2: Obtain the simplified Boolean expressions for output F and G in terms of the input variables

[@ritesha8050]

sir there is no NOT gate before the G in the book

[@LearnMeComputer]

Thanks doctor
Greetings from Egypt

[@cricketwir]

Great Sir ❤❤❤

[@Huda_khan.i]

Thankue so much for this great video 👍👍👍

[@jeremiahthomas7594]

Which book is this, sir?

[@DrDhimanKakati]

watch the video again from 5-10 seconds.

[@alraza7538]

Digital logic design by Morris Mano

[@letyoudown7873]

How to derive the truth table?

[@bilal_404]

Sir plz solve for (A'+BC)(A'D')'

[@hemanthmadhira4667]

(A'+BC) (A+D)

[@osamaaamir9162]

Observer your equation of F

[@osamaaamir9162]

I think you forget to put ' on A

[@osamaaamir9162]

Because there is only A' only

[@shaiza20]

Yh to galt keya F

[@cricketwir]

Why

[@longbowmen]

Why don't minimize the A+A'D to A+D

[@bhaskarbhasku2921]

You can do that and still end up with ABC+A'D. Just expand the result ABC+A'D+BCD to all the variables and then apply minimization.

[@Abubakar-n2z2d]

@@bhaskarbhasku2921 what do you mean by expand the result to all variables?