CSC103 Take-Home Final Exam Fall 2012

From dftwiki3
Revision as of 10:52, 16 October 2012 by Thiebaut (talk | contribs)
Jump to: navigation, search

--D. Thiebaut 11:34, 16 October 2012 (EDT)

This exam is given under the rule of the Smith College honor code. Your work has to be done individually. You cannot discuss ANY of this material with anybody, with the exception of your instructor. TAs are not allowed to give help about this final exam.
Once the last lecture of the 1/2 semester is over, questions can only be addressed via email. Whenever you send your instructor a question, the question and the answer will be broadcast back to the whole class within a short time period (between 7:00 a.m. - 9:00 p.m.).

<onlydft>

Problem #1: Logic Gates and Boolean Algebra

  • What is the boolean equation for the output Y of the circuit shown below?

CSC103LogicCircuitFinal.png

Problem #2: Assembly Language

  • Write an assembly language program that contains a loop and at least one variable called sum. Before the loop starts the variable sum contains 0. Once the loop ends the variable sum contains the sum of all the multiples of 3 between 0 and 30. In other words, your program computes 0 + 3 + 6 + 9 + 12 + 15 + 18 + 21 + 24 + 27 + 30 and stores the result in the variable sum.

=Problem #3:

<onlydft>










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