作者jimmy5566 (jimmy)
看板Grad-ProbAsk
標題[理工] [計概]-數位邏輯
時間Mon Mar 7 17:53:55 2011
Any set of Boolean operators that is sufficient to represent all
Boolean expressions is said to be complete.
Which of the following is NOT complete?
Hint. NAND = not AND, NOR = not OR.
(A) {AND, NOT} (B) {OR, NOT} (C) {AND, OR} (D) {NAND} (E) {NOR}
請問這題題目是什麼意思,看不太懂...
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 220.143.25.57
→ StreetLife:C 03/07 17:55
→ StreetLife:哪個答案不能組合出任意的Boolean expressions 03/07 17:57
→ jimmy5566:謝謝! 03/07 18:41
→ cooper6334:萬用閘的概念 03/07 20:05