![覈 minterms 朱 企伎 企. 願 truth table F= 1 螳讌 蟆 螻
企 .
complete set of operations
覿 襯 願鍵 豕 一一 讌. 朱Μ螻(AND)螻 覿(NOT),
襴(OR)螻 NOT, 覿 朱Μ螻(NAND) 覿 朱Μ(NOR)襷朱 覿 襯
朱襦 (AND, NOT), (OR, NOT), (NAND), (NOR) 讌企.
Karnaugh maps
豺企ゴ 襷旧企? 覿誤襯 譴朱 覈 螳ロ 覦覯 譴 螳讌襦 覲危
3覲 伎 6覲 危 覿 .
binary device
貉危 螻狩 2讌 襦 一危磯ゼ 蠍磯 レ, 蠏碁 貊 一危磯ゼ
レ.
logic gates
讌 襦 蠍磯蓋 覿覓. 覿覿 2螳 リ骸 豢レ朱 朱,
蠍磯蓋 朱Μ 蟆危語 朱Μ螻(AND), 朱Μ(OR), 覦壱 朱Μ(XOR), NOT, 覿 朱Μ螻
(NAND), 覿 朱Μ(NOR), XNOR 7螳讌螳 .
螻殊譴觜
れ 襭譟一( 譟一)襯 牛 螻 企れ 企れ る伎殊伎 螻殊
.
讌 2012 6 7
る
襦蠏碁 貊
III. 蟆郁骸
#include <stdio.h>
int main(void)
{
int num1[2] = {0,};
豕譬 int num2[2] = {0,};
襦蠏碁 int num[3] = {0,};
int first;
int second;
printf("豌孫覯鐃曙Ц属 鐃 Oレ");
scanf("%d",&first);
num1[0] = first/10;](https://image.slidesharecdn.com/2012dmc306-13409448671263-phpapp02-120628234216-phpapp02/85/2012-Dm-C3-06-3-320.jpg)
![num1[1] = first%10;
printf("鐃暑鐃曙Ц属 鐃 Oレ");
scanf("%d",&second);
num2[0] = second/10;
num2[1] = second%10;
printf("%d%dn",num1[0],num1[1]);
printf("%d%dn",num2[0],num2[1]);
if(num1[1] == 1 && num2[1] == 1)
{num[2] = 0;
num[1] = 1;
}
if(num1[1] == 0 && num2[1] == 0)
num[2] = 0;
if((num1[1] == 0 && num2[1] == 1) ||(num1[1] == 1 && num2[1] ==0))
num[2] = 1;
if((num1[0] == 0 && num2[0] == 1) || (num1[0] == 1 && num2[0] == 0))
num[1]++;
if(num1[0] == 1 && num2[0] == 1)
num[0]++;
printf("%d%d%d",num[0],num[1],num[2]);
return 0;
}](https://image.slidesharecdn.com/2012dmc306-13409448671263-phpapp02-120628234216-phpapp02/85/2012-Dm-C3-06-4-320.jpg)
More Related Content
What's hot (19)
Viewers also liked (17)
Similar to 2012 Dm C3 06 (20)
2012 Dm C3 06
- 1. C3 伎一 豕譬覲願 (2-觜 ъ蠍 り) 譟一 : 麹 譟一 : 譴 蟠 豕 蟠譴
- 2. 螻殊殊 譟一 襭譟一 : 蟠, 襦蠏碁覦 : 麹, 覲願 : C3 譟一 : 麹 蟠譴 譴 麹, 豕 螻殊蠍郁 4 20螳 I. 螻 郁規覈 2-觜 ъ蠍 り 郁規覈 Boolean Algebra 蟯 企れ 螻給螻 2-bit adder襯 り螻 蟲. Discrete mathrmatics and its applications 6 edition 谿瑚 覦 谿瑚襭 Kenneth H, Rosen URL II. 螻 ろ 豌讌 2012 5 30 る 譟一 覓 覿 覦 螻殊 危伎 讌 覓企 襭譟一 : 蟠, 蟠譴 襦蠏碁覦 : 麹, 譴 伎 覲願 : 麹, 豕 企 螻殊 覈 2-bit adder 蟯 り襯 覲願 蠏瑚 蟲 蟆伎. 螻殊譴觜 覩碁Μ 企 螻殊 譟一螳 蠍 覓語 旧 讌 覈詩 . 朱 覈 螳讌蠍 覩碁Μ 譯殊 螻給襯 螻 襷手る れ . 讌 2012 6 1 る 譯殊 蟯 襴 boolean expression 覿 一一朱, 覲 蠏瑚れ 一一襦 譟壱 蟆螻 語朱 伎 disjunction of minterms(豕 ) n螳 variable襯 螳讌 2^n螳minterm 螳讌.minterm expression企
- 3. 覈 minterms 朱 企伎 企. 願 truth table F= 1 螳讌 蟆 螻 企 . complete set of operations 覿 襯 願鍵 豕 一一 讌. 朱Μ螻(AND)螻 覿(NOT), 襴(OR)螻 NOT, 覿 朱Μ螻(NAND) 覿 朱Μ(NOR)襷朱 覿 襯 朱襦 (AND, NOT), (OR, NOT), (NAND), (NOR) 讌企. Karnaugh maps 豺企ゴ 襷旧企? 覿誤襯 譴朱 覈 螳ロ 覦覯 譴 螳讌襦 覲危 3覲 伎 6覲 危 覿 . binary device 貉危 螻狩 2讌 襦 一危磯ゼ 蠍磯 レ, 蠏碁 貊 一危磯ゼ レ. logic gates 讌 襦 蠍磯蓋 覿覓. 覿覿 2螳 リ骸 豢レ朱 朱, 蠍磯蓋 朱Μ 蟆危語 朱Μ螻(AND), 朱Μ(OR), 覦壱 朱Μ(XOR), NOT, 覿 朱Μ螻 (NAND), 覿 朱Μ(NOR), XNOR 7螳讌螳 . 螻殊譴觜 れ 襭譟一( 譟一)襯 牛 螻 企れ 企れ る伎殊伎 螻殊 . 讌 2012 6 7 る 襦蠏碁 貊 III. 蟆郁骸 #include <stdio.h> int main(void) { int num1[2] = {0,}; 豕譬 int num2[2] = {0,}; 襦蠏碁 int num[3] = {0,}; int first; int second; printf("豌孫覯鐃曙Ц属 鐃 Oレ"); scanf("%d",&first); num1[0] = first/10;
- 4. num1[1] = first%10; printf("鐃暑鐃曙Ц属 鐃 Oレ"); scanf("%d",&second); num2[0] = second/10; num2[1] = second%10; printf("%d%dn",num1[0],num1[1]); printf("%d%dn",num2[0],num2[1]); if(num1[1] == 1 && num2[1] == 1) {num[2] = 0; num[1] = 1; } if(num1[1] == 0 && num2[1] == 0) num[2] = 0; if((num1[1] == 0 && num2[1] == 1) ||(num1[1] == 1 && num2[1] ==0)) num[2] = 1; if((num1[0] == 0 && num2[0] == 1) || (num1[0] == 1 && num2[0] == 0)) num[1]++; if(num1[0] == 1 && num2[0] == 1) num[0]++; printf("%d%d%d",num[0],num[1],num[2]); return 0; }
- 5. 蟆郁骸 豢 螳覲旧° 螻糾覲旧° . 覦 螻殊襯 企螻殊 觜蟲 蟆 螳. 朱Μり 螻朱螻朱 襷 郁 覿覿 覲企 襷豺覃伎 蟆 覓語襯 願屋 蟆 螳. 訖襷 れ 螳 覓企ゼ 伎殊伎 覲 覓語 襦碁ゼ 蟆 螳.