Differences

This shows you the differences between two versions of the page.

Link to this comparison view

Both sides previous revision Previous revision
cs-312:project-1 [2015/01/15 04:21]
ringger [Implementation Notes]
cs-312:project-1 [2015/01/26 22:21] (current)
ringger [Report]
Line 66: Line 66:
  
 # Place your name, Net ID, and section number at the top of the first page. # Place your name, Net ID, and section number at the top of the first page.
-Also include ​an estimate of the amount of time you spent on this project at the top of the first page. +Include ​an estimate of the amount of time you spent on this project at the top of the first page. 
-# [25 points] ​At least one screenshot of your application with a working example that is at least 50 decimal digits long.+# [25 points] ​Include at least one screenshot of your application with a working example that is at least 50 decimal digits long.
 #* Find a prime that is at least 50 decimal digits long by consulting the web.  Be sure to give credit to your source. #* Find a prime that is at least 50 decimal digits long by consulting the web.  Be sure to give credit to your source.
 #* Note: to capture just the top window in your screenshot, use the key-chord alt-PrtSc (i.e., print screen) #* Note: to capture just the top window in your screenshot, use the key-chord alt-PrtSc (i.e., print screen)
-# [10 points] ​The equation ​you used to compute ​the probability of ''​correctness'' ​that appears in the output. +# [10 points] ​Include the equation ​for computing ​the probability of ''​correctness''​ that appears in the output. 
-All of the code that you wrote. In most cases, the code will be the contents of the <​tt>​Form1.cs</​tt>​ file.  Your code must include the following:+Include all of the code that you wrote. ​ In most cases, the code will be the contents of the <​tt>​Form1.cs</​tt>​ file.  Your code must include the following:
 #* [25 points] A correct implementation and application of modular exponentiation. #* [25 points] A correct implementation and application of modular exponentiation.
 #* [30 points] A correct implementation and application of the Fermat primality tester. #* [30 points] A correct implementation and application of the Fermat primality tester.
-#* [10 points] ​Remainder ​of your code.+#* [10 points] ​The remainder ​of your code.
 #* Document your algorithm with legible comments in important places in the code that make it obvious to the reader what your solution is doing. ​ This documentation also provides evidence of your comprehension. ​ With the aid of adequate documentation,​ the correctness of your approach should be easy for the reader (e.g., TA) to verify. ​ If the TA cannot easily determine the code's correctness,​ then fewer points will be awarded. #* Document your algorithm with legible comments in important places in the code that make it obvious to the reader what your solution is doing. ​ This documentation also provides evidence of your comprehension. ​ With the aid of adequate documentation,​ the correctness of your approach should be easy for the reader (e.g., TA) to verify. ​ If the TA cannot easily determine the code's correctness,​ then fewer points will be awarded.
  
cs-312/project-1.txt · Last modified: 2015/01/26 22:21 by ringger
Back to top
CC Attribution-Share Alike 4.0 International
chimeric.de = chi`s home Valid CSS Driven by DokuWiki do yourself a favour and use a real browser - get firefox!! Recent changes RSS feed Valid XHTML 1.0