Difference between revisions of "CSC103 2011 Take-Home Final Exam"
(Created page with "<center> <font size="+2">Page under construction!</font> <br \>300px </center>") |
|||
Line 1: | Line 1: | ||
+ | --[[User:Thiebaut|D. Thiebaut]] 16:38, 2 March 2011 (EST) | ||
+ | |||
+ | ---- | ||
<center> | <center> | ||
<font size="+2">Page under construction!</font> | <font size="+2">Page under construction!</font> | ||
<br \>[[File:UnderConstruction.jpg|300px]] | <br \>[[File:UnderConstruction.jpg|300px]] | ||
</center> | </center> | ||
+ | |||
+ | <onlydft> | ||
+ | |||
+ | |||
+ | =Problem #1: Boolean Logic= | ||
+ | |||
+ | The three equations below represent three different logic expressions using '''and''', '''or''' and '''not''' gates of three boolean variables A, B, and C. A boolean variable can take only one of two possible values: True or False. | ||
+ | |||
+ | Which of the two expressions are identical, meaning that for any combination of A, B, and C, they are both True or both False. | ||
+ | |||
+ | |||
+ | * Expression 1: (A and (not B) ) or ( B and (not A)) | ||
+ | |||
+ | * Expression 2: (A and (not B)) and ( B and ( not A )) | ||
+ | |||
+ | * Expression 3: (A or B ) and ( not ((A and B )) | ||
+ | |||
+ | |||
+ | * In your answer explain how you figure out which expression is different from the other two. | ||
+ | * Remember that you have a nice circuit simulator available to you to check circuits (See [[CSC103_Lab_1_2011 | Lab #1]) | ||
+ | |||
+ | |||
+ | </onlydft> | ||
+ | |||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | |||
+ | <br /> | ||
+ | [[Category:CSC103]][[Category:Exams]] |