The following 4 input K -map (where A is LSB and D is MSB ) can also be represented by the function: \begin{tabular}{ccccc} & C \( ^{\prime} \) D \( ^{\prime} \) & C \( ^{\prime} \) D & CD & CD \( ^{\prime} \) \\ \hline A \( ^{\prime} \) B \( ^{\prime} \) & 0 & 0 & 0 & 0 \\ \hline A \( ^{\prime} \) B & 0 & 0 & 0 & 0 \\ \hline AB & 0 & 1 & 0 & 1 \\ \hline AB \( { }^{\prime} \) & 0 & 0 & 1 & 0 \\ \hline \end{tabular} \( f=\sum\left(m_{9}, m_{11}, m_{14}\right) \) \( f=\sum\left(m_{1}, m_{4}, m_{6}\right) \) \( f=\sum\left(m_{7}, m_{11}, m_{13}\right) \) \( f=\sum\left(m_{11}, m_{13}, m_{14}\right) \)
Added by Som M.
Close
Step 1
These are located at: - Row AB, Column C'D: 1 - Row AB, Column CD': 1 - Row AB', Column CD: 1 Show more…
Show all steps
Your feedback will help us improve your experience
Dayna Kitsuwa and 95 other Algebra educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Draw the logic circuit L with inputs A, B, C and output Y which corresponds to each Boolean expression: (a) Y = ABC + A'C' + B'C'; (b) Y = AB'C + ABC' + AB'C'.
Andrew N.
Simplify the following Boolean function, using K-maps: F(A, B, C, D) = Σ(3, 7, 11, 13, 14, 15)
Sparsh G.
EXAMPLE: Simplify the following Boolean expression using K-Map: ABCD + AECD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD + ABCD
Madhur L.
Recommended Textbooks
Elementary and Intermediate Algebra
Algebra and Trigonometry
Watch the video solution with this free unlock.
EMAIL
PASSWORD