Difference between revisions of "CSC103 2011 Take-Home Final Exam"
| (22 intermediate revisions by the same user not shown) | |||
| Line 2: | Line 2: | ||
---- | ---- | ||
| − | <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> | <onlydft> | ||
| + | <tanbox> | ||
| + | This final exam is take-home. It is open-books, open-notes, and open-Web. It is due a week after it is made available, at '''noon''' on Friday March 11, 2011. | ||
| − | + | The work has to be done individually, not in a group. You cannot discuss the details of this exam with anyone except your prof. The TAs are not allowed to help you out with exam material in any way. Questions will only be answered in two ways: in person, in class only. Outside class time, only via email. If you have questions regarding the exam and cannot wait until the next class time, or if the last class has already been given, then you should send your question(s) via email to [mailto:thiebaut@cs.smith.edu thiebaut@cs.smith.edu], and the question and its answer will be broadcast back to the whole class via email. | |
| − | |||
| − | You cannot discuss the details of this exam with anyone except your prof. The TAs are not allowed to help you out in any way. | ||
'''The exam is given under the rules of the Smith College [http://www.smith.edu/sao/handbook/socialconduct/honorcode.php Honor Code].''' | '''The exam is given under the rules of the Smith College [http://www.smith.edu/sao/handbook/socialconduct/honorcode.php Honor Code].''' | ||
Make sure you reference all work/resources you use to answer the questions below. | Make sure you reference all work/resources you use to answer the questions below. | ||
| + | </tanbox> | ||
| + | <br /> | ||
| + | <br /> | ||
| + | |||
| − | =Problem #1: Boolean Logic= | + | =Problem #1: Boolean Logic (25 points)= |
| − | The three equations below represent three different logic expressions using '''and''', '''or''' and '''not''' gates of | + | The three equations below represent three different logic expressions using '''and''', '''or''' and '''not''' gates of two boolean variables A, B. 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 | + | Which of the two expressions are identical, meaning that for any combination of A and B they are both True or both False. |
| Line 28: | Line 32: | ||
* Expression 2: (A and (not B)) and ( 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 )) | + | * Expression 3: (A or B ) and ( not ((A and B ))) |
| + | |||
| + | In your answer explain how you figure out which expression is different (in terms of its output given the same combination of A, and B 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]]) | ||
| − | =Problem #2= | + | =Problem #2: Assembly (25 points)= |
| − | |||
| − | + | Write an assembly language program that uses ten memory locations (variables) filled with 0, starting at Address 30, and that stores the values 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, and 22 in them. Your program will store 2 at Address 30, 4 at address 31, 6 at address 32, etc. | |
| + | |||
| + | |||
| + | Your program should contain the following lines to initialize the ten memory locations | ||
| + | |||
@30 | @30 | ||
| Line 53: | Line 61: | ||
0 | 0 | ||
| − | |||
| − | |||
| − | =Problem #3= | + | Your program must use a loop. |
| + | |||
| + | Use the [[CSC103_2011_Homework_3_Solution | solution programs]] for Homework #3 as examples of good formats and good documentation. | ||
| + | |||
| + | You are encouraged to use labels, as they make the programs more readable, but if you prefer not to use labels, you will not be penalized. | ||
| + | |||
| + | =Problem #3: Javascript (25 points)= | ||
| + | |||
| + | Write a '''javascript''' program that computes the sum of all the even numbers between 0 and 100, 100 included, and stores the result in a variable called '''sumEven'''. The same program will also compute the sum of all the multiples of 5 between 0 and 100, 100 included. This second number will be stored in a variable called '''sum5'''. | ||
| + | |||
| + | Use the programs from the [[CSC103_Lab_4_Solution_2011| Lab 4 solution]] page for inspiration in terms of organization and documentation. | ||
| + | |||
| + | =Problem #4: Essay (25 points)= | ||
| + | |||
| + | Search the current newspapers available to you on-line or in print and find an article that is less than a month old and that describes one of the following topics: | ||
| + | |||
| + | * The limitations imposed by today's computer architecture or semiconductor technology on our ability to continue building computers that follow Moore's law (to be covered in class on 3/7/11) | ||
| − | * | + | * The current research and/or discovery of new technologies that do not use silicon for the design of computing elements and processor circuits and offer a chance to keep on with Moore's law, or |
| − | * | + | * The design of new computing systems that do not follow John von Neumann's original architecture (to be covered in class on 3/7/11) in order to build computers that will boost our computing performance that will be in ligne with Moore's law. |
| − | |||
| − | + | You cannot use the article [http://www.nytimes.com/2011/03/01/science/01compute.html?_r=1 Remapping Computer Circuitry to Avert Impending Bottlenecks], by John Markoff, NYT 3/2/11 (covered in class) | |
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | |||
| − | * Write a '''one-page, single-spaced summary''' of the news article, where you will state: | + | Very likely, your news article will make reference to a technical article published in a computer field. Make sure you also find this article and do your best to read and understand it. If it is too technical, make sure you at least read |
| − | + | * its abstract | |
| − | + | * its introduction | |
| − | + | * its conclusion | |
| − | + | (Even for the most technical document, these 3 sections are always a good source of information, even for the lay person.) | |
| − | + | ||
| − | + | ||
| − | + | Make sure as well that you know when the article was published (it shouldn't be more than a couple month old) as well as where it was written (computer research lab, university or other). | |
| + | |||
| + | |||
| + | Write a '''one-page, single-spaced summary''' of the news article, where you will state: | ||
| + | * what type of technology or solution the original article covers, | ||
| + | * what aspect of computing it is supposed to enhance, or what problem it is supposed to solve, | ||
| + | * in which way it connects to Moore's law, or to the von Neumann architecture, if at all, and | ||
| + | * what outcome is expected from this new discovery/research effort. | ||
| + | |||
| + | |||
| + | You should also make sure that you include references | ||
| + | * for the original news article that is the seed of your 1-page summary, and | ||
| + | * the technical article(s) it is based on. | ||
=Submission= | =Submission= | ||
| − | * | + | * Write your answers in a Microsoft Word document, and when you're done, save it as a PDF document. See [http://office.microsoft.com/en-us/word-help/save-as-pdf-HA010064992.aspx this Microsoft page] for information on how to do this. |
| + | * Make sure you write your name at the top of the document. | ||
| + | * Submit your pdf file as an attachment of a message you will mail to 103b@cs.smith.edu, with the subject '''final exam''' | ||
| + | |||
| + | <br /> | ||
| + | <br /> | ||
| + | <br /> | ||
| + | <br /> | ||
| + | <br /> | ||
| + | Good luck! | ||
| + | |||
</onlydft> | </onlydft> | ||
<br /> | <br /> | ||
