Difference between revisions of "CSC103 2011 Take-Home Final Exam 2"

From dftwiki3
Jump to: navigation, search
(Created page with "--~~~~ ---- <!--center> <font size="+2">Page under construction!</font> <br \>300px </center--> <tanbox> This final exam is take-home. It is ope...")
 
 
(8 intermediate revisions by the same user not shown)
Line 7: Line 7:
 
</center-->
 
</center-->
  
−
 
+
<onlydft>
 
<tanbox>
 
<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.
+
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 April 22nd, 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.
 
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.
Line 20: Line 20:
 
<br />
 
<br />
  
−
=Problem #1: Boolean Logic (25 points)=
+
=Problem #1: Boolean Logic (30 points)=
  
 
The three equations below represent three different logic expressions using '''and''', '''or''' and '''not''' gates of three boolean variables A, B, and C.  A boolean variable can take only one of two possible values: True or False.
 
The three equations below represent three different logic expressions using '''and''', '''or''' and '''not''' gates of three boolean variables A, B, and C.  A boolean variable can take only one of two possible values: True or False.
Line 37: Line 37:
  
  
−
=Problem #2: Assembly (25 points)=
+
=Problem #2: Assembly (30 points)=
  
  
Line 65: Line 65:
 
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.
 
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)=
+
=Problem #3: Javascript (40 points)=
  
 
Write a '''javascript''' program that uses only one print statement of the form:
 
Write a '''javascript''' program that uses only one print statement of the form:
Line 71: Line 71:
 
   document.write( "*" );
 
   document.write( "*" );
  
−
and displays the generate the following output:
+
and displays the following output:
  
 +
<source lang="text">
 
  **********
 
  **********
 
   *********
 
   *********
Line 83: Line 84:
 
         **
 
         **
 
           *
 
           *
−
 
+
</source>
 
Note that there are 10 lines, and each line contains a decreasing number of stars.  The first line contains 10 stars, the second 9 stars, etc.
 
Note that there are 10 lines, and each line contains a decreasing number of stars.  The first line contains 10 stars, the second 9 stars, etc.
  
 
The first star of the first line starts at the left margin of the screen.  The first star of the second line starts after 1 space from the left margin.  The first star of the third line starts after 2 spaces from the left margin, etc.
 
The first star of the first line starts at the left margin of the screen.  The first star of the second line starts after 1 space from the left margin.  The first star of the third line starts after 2 spaces from the left margin, etc.
  
 +
You must use loops.  The number of loops is up to you.
  
 +
Remember that all the stars must be printed by only one document.write() statement that prints only one star: '''document.write( '*' )'''.  You may have additional document.write() statements, but these cannot print stars.
  
−
Use the programs from the [[CSC103_Lab_4_Solution_2011| Lab 4 solution]] page for inspiration in terms of organization and documentation.
+
Note that to HTML "absorbs" space characters by default.  So if you want to print spaces that are not absorbed you can print the special character "&amp;nbsp;", as follows:
  
−
=Problem #4: Essay (25 points)=
+
    document.write( "&amp;nbsp;" );
  
−
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)
+
Use the programs from the [[CSC103_Lab_4_Solution_2011| Lab 4 solution]] page for inspiration in terms of organization and documentation.
  
−
* 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
+
<br />
−
 
 
−
* 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)
 
−
 
 
−
 
 
−
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=
Line 132: Line 107:
 
* Make sure you write your name at the top of the document.
 
* 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'''
 
* 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 />
 
<br />
 
<br />
 
<br />
 
<br />
 
<br />
−
Good luck!
+
</onlydft>
  
  

Latest revision as of 11:19, 2 September 2017

--D. Thiebaut 22:47, 14 April 2011 (EDT)


...














Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC103_2011_Take-Home_Final_Exam_2&oldid=31190"