【发布时间】:2015-04-13 19:16:51
【问题描述】:
我很快就要参加大学课程的考试,在复习我的一项作业后,我开始意识到我不明白为什么我会失去分数/如何做几个问题。希望有人可以为我阐明这个主题!问题如下:
使用 K-Maps 简化以下布尔函数(注意 d() 表示无关最小项):
1.) F(w, x, y, z) = ∑(1,3,5,7,11,12,13,15)
My answer:
Prime Implicants: yz, w'z, xz, wxy'
Essential Prime Implicants: yz, w'z, wxy'
Possible Minimal Expression(s): yz + w'z + wxy'
Answer sheet (professor's answer):
Prime Implicants: yz, w'z, xz, wxy'
Essential Prime Implicants: Same as prime implicants
Possible Minimal Expression(s): yz + w'z + xz + wxy'
2.) F(w, x, y, z) = ∑(1,2,5,7,12) + d(0,9,13)
My answer:
Prime Implicants: w'x'z', y'z, w'xz, wxy', w'x'y'
Essential Prime Implicants: w'x'z', w'xz, wxy'
Possible Minimal Expression(s): w'x'z' + w'xz + wxy'
Answer sheet (professor's answer):
Prime Implicants: w'x'z', y'z, w'xz, wxy', w'x'y'
Essential Prime Implicants: w'x'z', w'xz, wxy'
Possible Minimal Expression(s): w'x'z' + w'xz + wxy' + y'z
我想我应该补充一点,在我的教授将我的作业发回给我后,我问他是否犯了错误并解释了我的观点。他似乎很确定自己是正确的,但无法真正解释原因,因为他的英语说得不好(嗯,那是你的大学......)。
提前感谢任何可以提供帮助的人!尝试自己解决这个问题是一项艰巨的任务!
【问题讨论】:
标签: binary boolean-logic boolean-expression simplify boolean-operations