Difference between revisions of "CSC103 Final Exam 2017"
Line 13: | Line 13: | ||
<onlydft> | <onlydft> | ||
+ | =Problem 1: Logic Design= | ||
+ | <br /> | ||
+ | Problem #1: Boolean Logic (30 points) | ||
+ | |||
+ | The three equations below represent three different logic expressions using '''and''', '''or''' and '''not''' operators 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, Expression 1, Express 2, or Expression 3, are ''logically identical'', meaning that for any combination of A, B, and C the two expressions are both True or both False. | ||
+ | |||
+ | |||
+ | ;Expression 1: | ||
+ | :::(B and (not C) ) OR ( A and C ) OR ( A and B ) | ||
+ | ;Expression 2: | ||
+ | :::(A and B) OR ( not A and B and not C ) OR ( A and ( not B ) and C ) | ||
+ | ;Expression 3: | ||
+ | :::(A and C ) OR ( not C ) | ||
+ | |||
+ | <br /> | ||
+ | Submit your answer on Moodle, in the Problem 1 section. | ||
+ | <br /> | ||
=Problem 2: Assembly (33%)= | =Problem 2: Assembly (33%)= | ||
<br /> | <br /> |
Revision as of 14:59, 17 October 2017
--D. Thiebaut (talk) 22:30, 16 October 2017 (EDT)
This exam is a take-home exam for CSC103, Fall 2017. The exam is open-books, open-notes, and open-Web. It is given under the rules of the Smith College Honor Code, and the work your turn in must reflect your individual work. You cannot discuss any of the details of this exam with anybody except your instructor (Dominique Thiebaut). If you have a question, please post it on Piazza.
You cannot work in pairs on this exam.
This exam is due on Moodle on 25 October 2017 at 11:55 p.m.