Differences

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

--- haas:spring2017:sysprog:projects:sci0 [2017/01/26 16:53] – [Submission] wedge
+++ haas:spring2017:sysprog:projects:sci0 [2017/02/14 17:00] (current) – [Submission] wedge
@@ Line 99: / Line 99: @@
     * the file(s)
   * perform the task (process)
-    * isolate one's digit mathematically, store in a variable (unsigned short int)
+    * as stated, you are not allowed to use any of the **strtol(3)** family of functions to do the base conversion for you.
-    * isolate remaining digits mathematically, store in another variable (unsigned short int)
+      * This isn't to say you cannot use them; you may, you just cannot use them to do any of the conversion work (beyond ASCII to base 10).
-    * perform the algorithm on the two pieces, storing their results in two separate variables (of type unsigned short int)
+  * display error or usage if applicable.
-  * display the final value (output)
+    * if error or usage, make sure you return a 1 instead of 0.
-    * display the beginning and ending parts together (but stored in separate variables)
-    * display the resulting number to STDOUT (right-justified in a space supporting the largest possible value -- see output example below)
-    * display any supporting text to STDERR (display of source values left-justified in a space supporting 3-digit values -- see output example below).
-  * because we have not officially learned how to do selection/have the computer react to conditions, please implement with the assumption that the user will ALWAYS input a correct value. Do not worry about having to check for invalid or illegal input values (I will not be checking for such when I evaluate your project).
 =====FAQs/Hints=====
@@ Line 237: / Line 233: @@
 </cli>
-=====Questions / Food for Thought=====
-These are things I'd like you to contemplate, even use as potential material on your weekly journal entry. The more you think about and understand the problem, the better your ability to solve it and other problems.
-  * Why/how does this trick work for 1-digit numbers?
-  * Considering our 1-, 2-, and 3-digit domain restriction for this project, how many candidate values are there for input?
-  * What is the smallest input value?
-  * What is the largest input value?
-  * How many input values are there that end in **5**?
-  * What is the largest square that can be calculated given the project input restrictions?
-  * How many digits is the largest square?
-  * How can knowing how many digits the largest square is help you implement your solution?
 =====Submission=====
-To successfully complete this project, the following criteria must be met:
-  * Code must compile cleanly (no warnings or errors)
-  * Output is formatted in the manner in the sample above
-  * Output must be correct, and match the form given in the sample output above.
-  * Code must be nicely and consistently indented
-  * Code must implement solution using the mental math technique described above
-  * Code must be commented
-    * have a properly filled-out comment banner at the top
-    * have at least 20% of your program consist of **<nowiki>//</nowiki>**-style descriptive comments
-  * Output Formatting (including spacing) of program must conform to the provided output (see above).
-  * Track/version the source code in a repository
-  * 25% late penalty per day after deadline
-  * Program is submit in a C source file called **sof0.c** and compiles without warning, note, nor error with gcc on lab46.
-  * Submit a copy of your source code to me using the **submit** tool.
 To submit this program to me using the **submit** tool, run the following command at your lab46 prompt:

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools