Hi guys I need a little bit help with these two exercices, can someone just do and explain them to me please don't understand much. Question 1Use only Boolean algebra to simplify the Boolean expression F. (First simplify F1 and F2, then simplify F1 · F2, showing all the steps. You need not provide the names of the Boolean rules that you apply.) F1 = x + x'(yw)' + w'y F2 = (y' + x')' F(x, y, w) = F1 ⋅ F2. Question 2 Use a Karnaugh map to find the simplest form of H(A, B, C, D) = m1 + m4 + m6 + m7 + m9 + m10 + m12 + m14. Derive the terms of H directly from the Karnaugh map without making use of algebraic manipulations or truth tables. Clearly show the groupings. Use exactly the same order for the variables as given in the following diagram: C B A D Thank you!!!
Which parts of the questions can you handle? Do you know the theoretical background behind them? Can you post your efforts for tackling the problem?
Hi Georacer, I'm stuck on the same question, but I've made some inroads. It's just the second part of question 1 (F1⋅F2) that I'm not 100% sure of... Here are my steps: F(x, y, w) = F1 ⋅ F2 = (x + x'y' + x'w' + w'y).(yx) = xy + 0 + 0 + xyw' = xy + xyw' = xy Does this look right? xy seems such an "easy" answer...
It looks correct to me and I don't think it is easy in any way, just a typical Boolean logic class question. If you have doubts, try to reach to the same result using a Karnaugh map.