Difference between revisions of "CSC231 Final Exam 2015"

From dftwiki3
Jump to: navigation, search
Line 10: Line 10:
 
=Problem #1=
 
=Problem #1=
  
−
==Part 1 ==
 
 
You are done with your exams, and enjoying the free time before you leave the college to go around the quiet campus, and, just for fun, you stop by the campus center. After getting a nice cup of hot chocolate, you climb the steps to the second floor, and see two of your friends, both computer science majors, engaged in a heated discussion in one of the small conference rooms. You enter the room and ask them what all the fuss is about.
 
You are done with your exams, and enjoying the free time before you leave the college to go around the quiet campus, and, just for fun, you stop by the campus center. After getting a nice cup of hot chocolate, you climb the steps to the second floor, and see two of your friends, both computer science majors, engaged in a heated discussion in one of the small conference rooms. You enter the room and ask them what all the fuss is about.
  
Line 52: Line 51:
  
 
You may assume that the stack is at most 6 MBytes in length.
 
You may assume that the stack is at most 6 MBytes in length.
−
 
+
<br />
 +
==Submission==
 +
<br />
 
Submit a pdf with your answers in the Final PB 1 Section on Moodle.  Make sure you write your name at the top of the file!
 
Submit a pdf with your answers in the Final PB 1 Section on Moodle.  Make sure you write your name at the top of the file!
 
<br />
 
<br />
Line 75: Line 76:
 
==Submission==
 
==Submission==
 
<br />
 
<br />
−
* Submit a pdf with your answers in the Final Exam PB 2 section, on Moodle.
+
* Submit a pdf with your answers in the Final Exam PB 2 section, on Moodle.   Make sure you write your name at the top of the file!
−
<br />
 
−
=Grading=
 
−
 
 
−
The main rules that will be followed when testing and reading your programs:
 
−
# programs should run, and not crash
 
−
# programs that crash without outputting any result will be given at most a D+
 
−
# programs should solve the problem given, but if they do not, they should come "close", and solve a simpler version of the problem, or only a few cases covered by the problem. 
 
−
# the documentation should explain what the program does and does not do, and what assumptions have been taken that transform the original problem.
 
−
# the header of the program should contain
 
−
## The name of the program
 
−
## The name of the programmer
 
−
## The date
 
−
## The problem addressed by the program
 
−
## How the program solves the problem, or a variation of the problem.
 
−
## What limitations or special cases that the program either covers, or does not cover.
 
−
# Each function should have a header indicating what the function performs, and what registers it modifies, and eventually whether it uses global variables or not.
 
−
 
 
−
For the written parts, you are allowed and encouraged to use the computer to generate your answer.  This means that you shouldn't hesitate to write programs, use programs (eXcel for example), or whatever other tool you have access to.  In this case, include copies of the programs or screen captures illustrating the data that help you make your case.
 
  
 
</onlydft>
 
</onlydft>

Revision as of 09:20, 12 December 2015


...

Retrieved from "http://dominiquethiebaut.com/dftwiki3/index.php?title=CSC231_Final_Exam_2015&oldid=28226"