Difference between revisions of "CSC103 Take-Home Exam 2013"
Line 66: | Line 66: | ||
<br /> | <br /> | ||
=Problem 2= | =Problem 2= | ||
− | |||
− | : | + | ;Question 1 |
+ | :Assume that we have two boolean functions ''f<sub>1</sub>'' and ''f<sub>2</sub>'' of three boolean variables ''a'', ''b'', and ''c'': | ||
− | :::''f<sub> | + | :::''f<sub>1</sub>'' = ( ''b'' and (not ''c'') ) or ( ''a'' and ''b'' ) or ( ''a'' and ''c'' ) |
+ | |||
+ | :::''f<sub>2</sub>'' = or ( ''c'' and ''a'' ) or ( ''b'' and (not ''c'' ) ) | ||
Show that no matter what values ''a'', ''b'' and ''c'' take, ''f<sub>1</sub>'' is always equal to ''f<sub>2</sub>''. | Show that no matter what values ''a'', ''b'' and ''c'' take, ''f<sub>1</sub>'' is always equal to ''f<sub>2</sub>''. | ||
<br /> | <br /> | ||
− | + | ;Question 2 | |
− | + | :What is the boolean expression for the output ''Y'' of the circuit below? | |
− | + | <br /> | |
− | + | <center>[[Image:CSC103LogicCircuitFinalExam2013.png|200px]]</center> | |
− | + | <br /> | |
− | |||
− | |||
− | |||
</onlydft> | </onlydft> | ||
<br /> | <br /> | ||
[[Category:CSC103]][[Category:Exam]] | [[Category:CSC103]][[Category:Exam]] |
Revision as of 09:46, 7 October 2013
--D. Thiebaut (talk) 10:06, 25 September 2013 (EDT)
This exam will be a one-week take-home exam and will be released on 10/10/13. Please stay tuned!