Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have the following boolean function: F=(a1+b1)(a2+b2) and am trying to construct a K-map for it. This is what I have so far:
I’m relatively new to K-maps, so I’m not entirely convinced this is correct. Could someone please double check it for me?
While circling in Karnaugh map, you always have to make circles of 2^n size in each direction (1×1, 2×1, 4×1, 2×2, 4×4, …, but never 1×3, 3×3, 5×3).
You need 4 circles 2×2 in your example.