Difference between revisions of "CSC103 Take-Home Exam 2013"

From dftwiki3
Jump to: navigation, search
Line 66: Line 66:
 
<br />
 
<br />
 
=Problem 2=
 
=Problem 2=
−
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>1</sub>'' = ( b and (not c) )  or ( a and b )  or ( a and c )
+
;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>2</sub>'' = ( b and (not c) )    or ( a and c )
+
:::''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
−
=Problem 2=
+
:What is the boolean expression for the output ''Y'' of the circuit below?
−
You are at a dinner party where one of the guests who is already on his third martini is trying to impress a young colleague.  This inebriated guest at some point makes this statement.  "Oh, yes, that guy at MIT, Ray Kurtzweil, he's big on exponential growth!  He's the one who's been telling the whole world that the performance of processors and of memory are growing exponentially, and that one is definitely growing faster than the other,  so we're bound to have a shift in technology very soon..."
+
<br />
−
 
+
<center>[[Image:CSC103LogicCircuitFinalExam2013.png|200px]]</center>
−
Unfortunately for him, you were right if front of these two people when this is said, and after observing how uncomfortable the poor young colleague in question is, you decide to put the record straight in a very simple and succint way, and explain that maybe our martini lover does not quite know what he is talking about.
+
<br />
−
 
 
−
What do you say?
 
−
-->
 
 
</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!


Page under construction!
UnderConstruction.jpg























































...


Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_Take-Home_Exam_2013&oldid=18096"