Difference between revisions of "CSC103 Final Exam 2017"
Line 93: | Line 93: | ||
<onlydft> | <onlydft> | ||
=Solutions= | =Solutions= | ||
+ | <br /> | ||
+ | ==Problem 1== | ||
+ | |||
+ | * Circuit B | ||
+ | <br /> | ||
+ | ==Problem 2== | ||
+ | <br /> | ||
+ | ;Question 1: | ||
+ | :It demonstrates that all computers are built using the von Neumann architecture, where both data and code reside in memory, and the program illustrates an example where code stores data over itself, changing its behavior. | ||
+ | |||
+ | ;Question 2: | ||
+ | :It computes the sum of 1 + 2 + 4 + 8 + 16, and stores this value in Memory Location 23. | ||
+ | |||
+ | ;Question 3: | ||
+ | :True | ||
+ | |||
+ | ;Question 4: | ||
+ | :False | ||
+ | |||
+ | ;Question 5: | ||
+ | :Grace Hopper -- computer bug | ||
+ | :von Neuman -- computer organization | ||
+ | :Claude Shannon -- doing arithmetic using logic | ||
+ | :Gordon Moore -- exponential growth | ||
+ | :George Bool -- true & false | ||
<br /> | <br /> | ||
==Problem 3 == | ==Problem 3 == |
Revision as of 19:27, 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.
<onlydft>
Solutions
Problem 1
- Circuit B
Problem 2
- Question 1
- It demonstrates that all computers are built using the von Neumann architecture, where both data and code reside in memory, and the program illustrates an example where code stores data over itself, changing its behavior.
- Question 2
- It computes the sum of 1 + 2 + 4 + 8 + 16, and stores this value in Memory Location 23.
- Question 3
- True
- Question 4
- False
- Question 5
- Grace Hopper -- computer bug
- von Neuman -- computer organization
- Claude Shannon -- doing arithmetic using logic
- Gordon Moore -- exponential growth
- George Bool -- true & false
Problem 3
// CSC103 // Final Exam // Smith College // Script creating a red window // with the caption "CSC103 2017" // void setup() { // define the size of the window size( 400, 600 ); smooth(); // create red background background( 240, 19, 19 ); } void draw() { strokeWeight( 1 ); if ( mousePressed == true ) { if ( mouseY < 300 ) { fill( 196, mouseY/2, 219 ); ellipse( mouseX, mouseY, mouseX/2, mouseX/2 ); } else { fill( 211, 122, mouseY/2 ); rect( mouseX, mouseY, mouseX/4, mouseX/4 ); } } stroke( 0, 0, 0 ); strokeWeight( 10 ); fill( 240, 19, 19 ); rect( 25, 50, 350, 70 ); textAlign( CENTER ); textSize( 48 ); fill( 149, 77, 77 ); text( "CSC103 2017", 200, 100 ); textSize(24 ); fill( 0, 0, 0 ); text( "Mickey Mouse", width/2, height - 30 ); }