掌握數位邏輯(含實習)複習講義教師用本

Page 19

5

11 函數 F(A,B,C,D)= Σ(0,1,2, F(A,B,C)= Σ(0,2,3,4,6,7) 5,6,7,8,10,11,12,13,15) 的

積之和(SOP)最簡表示式為 解 (1)

F(A,B,C)= B + C

F = BD + A B C + ABC + ACD + AC D (2)

F = BD + ABC + ABC + ACD + A CD

*( C ) 1. 布 林 函 數 F = ABC + BC + BC + AB 可 化 簡 為 (A)F = BC (B)F = A + B (C)F = B + C (D)F = A B C。 *( B ) 2. 化簡下列函數 F(A,B,C,D)= Σ(5,7,13,15)為最簡式可得 (A)AB + CD (B) BD (C)ABC + AC (D)AB + ACD。 *( A ) 3. 用卡諾圖,以簡化 F = ABCD + ACD + BCD + ABC + A BCD + A BCD + ABC D + ABC D,其值為 (A)F = CD + BC + BC D (B)F = AB + CD (C)F = AB (D)F = BC + BC D。 *( B ) 4. 化簡下列函數 F = AB + ABD + ABCD 可得最簡式為 (A)AB + CD (B)AB + AC + AD (C)AB + AD (D)AB + CD + BC。 *( B ) 5. 用卡諾圖化簡 Y = BCD + ABCD + B CD 可得 (A)Y = BCD + B C (B)Y = CD + ABD (C)Y = A + B + C (D)Y = CD + ABC。

第 5 章 布林代數的化簡與實現

145


Turn static files into dynamic content formats.

Create a flipbook
Issuu converts static files into: digital portfolios, online yearbooks, online catalogs, digital photo albums and more. Sign up and create your flipbook.