Lab46 Wiki

User Tools

Site Tools

You are here: start » haas » summer2017 » cprog » projects » pnc0
haas:summer2017:cprog:projects:pnc0

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
haas:summer2017:cprog:projects:pnc0 [2017/06/19 12:01] – [Simple argument checks] wedgehaas:summer2017:cprog:projects:pnc0 [2017/06/19 15:00] (current) – [Command-Line Arguments] wedge
Line 82: Line 82:
  
   - **primebrute.c**: for your brute force implementation   - **primebrute.c**: for your brute force implementation
-  - **primebruteopt.c**: for your slightly optimized brute force implementation+  - **primebrk.c**: implementation that breaks out of checking once prime test fails
  
 Your program should: Your program should:
Line 94: Line 94:
       * if omitted, assume a lower bound of **2**.       * if omitted, assume a lower bound of **2**.
       * if you desired to specify an upper bound (argv[4]), you obviously MUST provide the lower bound argument under this scheme.       * if you desired to specify an upper bound (argv[4]), you obviously MUST provide the lower bound argument under this scheme.
-    * argv[4]: **conditionally optional** upper bound (ending value). If provided, this is the ending value you'd like to check to. If doing a quantity run (argv[1] NOT 0), this value is ignored.+    * argv[4]: **conditionally optional** upper bound (ending value). If provided, this is the ending value you'd like to check to. 
 +      * If doing a quantity run (argv[1] NOT 0), this value isn't necessary. 
 +      * If doing a quantity run AND you specify an upper bound, whichever condition is achieved first dictates program termination. That is, upper bound could override quantity (if it is achieved before quantity), and quantity can override the upper bound (if it is achieved before reaching the specified upper bound).
     * for each argument: you should do a basic check to ensure the user complied with this specification, and exit with a unique error message (displayed to STDERR) otherwise:     * for each argument: you should do a basic check to ensure the user complied with this specification, and exit with a unique error message (displayed to STDERR) otherwise:
-      * for insufficient quantity of arguments, display: **PROGRAM_NAME: insufficient number of arguments** +      * for insufficient quantity of arguments, display: **PROGRAM_NAME: insufficient number of arguments!** 
-      * for invalid argv[1], display: **PROGRAM_NAME: invalid quantity** +      * for invalid argv[1], display: **PROGRAM_NAME: invalid quantity!** 
-      * for invalid argv[2], display: **PROGRAM_NAME: invalid value** +      * for invalid argv[2], display: **PROGRAM_NAME: invalid value!** 
-      * for invalid argv[3], display: **PROGRAM_NAME: invalid lower bound**+      * for invalid argv[3], display: **PROGRAM_NAME: invalid lower bound!**
         * if argv[3] is not needed, ignore (no error displayed not forced exit, as it is acceptable defined behavior).         * if argv[3] is not needed, ignore (no error displayed not forced exit, as it is acceptable defined behavior).
-      * for invalid argv[4], display: **PROGRAM_NAME: invalid upper bound**+      * for invalid argv[4], display: **PROGRAM_NAME: invalid upper bound!**
         * if argv[4] is not needed, ignore (no error displayed nor forced exit, as it is acceptable defined behavior).         * if argv[4] is not needed, ignore (no error displayed nor forced exit, as it is acceptable defined behavior).
       * In these error messages, **PROGRAM_NAME** is the name of the program being run; this can be accessed as a string stored in **argv[0]**.       * In these error messages, **PROGRAM_NAME** is the name of the program being run; this can be accessed as a string stored in **argv[0]**.
   * do NO algorithmic optimizations of any sort (it is called brute-force for a reason).   * do NO algorithmic optimizations of any sort (it is called brute-force for a reason).
-  * in the case of **primebruteopt**, perform only the short circuit optimization described above.+  * in the case of **primebrk**, perform only the short circuit optimization described above.
     * please take note in differences in run-time, contemplating the impact the two algorithms have on performance.     * please take note in differences in run-time, contemplating the impact the two algorithms have on performance.
   * start your stopwatch (see **timing** section below).   * start your stopwatch (see **timing** section below).
Line 111: Line 113:
   * display to STDOUT (file pointer **stdout**) the prime numbers calculated.   * display to STDOUT (file pointer **stdout**) the prime numbers calculated.
   * stop your stopwatch. Calculate the time that has transpired (ending time minus starting time).   * stop your stopwatch. Calculate the time that has transpired (ending time minus starting time).
 +  * a further coding restriction: in each program, you are not allowed to use a given loop type (for(), while(), do-while()) more than once! If you find you need more than one loop in a program, they **CANNOT** be the same type (this is to get you exposed to them and thinking differently).
   * output the processing run-time to STDERR (file pointer **stderr**).   * output the processing run-time to STDERR (file pointer **stderr**).
   * your output **MUST** conform to the example output in the **execution** section below. This is also a test to see how well you can implement to specifications. Basically:   * your output **MUST** conform to the example output in the **execution** section below. This is also a test to see how well you can implement to specifications. Basically:
     * as primes are being displayed, they are space-separated (first prime hugs the left margin), and when all said and done, a newline is issued.     * as primes are being displayed, they are space-separated (first prime hugs the left margin), and when all said and done, a newline is issued.
     * the timing information will be displayed in accordance to code I will provide below (see the **timing** section).     * the timing information will be displayed in accordance to code I will provide below (see the **timing** section).
 +
 +=====Grabit Integration=====
 +For those familiar with the **grabit** tool on lab46, I have made some skeleton files and a custom **Makefile** available for this project.
 +
 +To "grab" it:
 +
 +<cli>
 +lab46:~/src/cprog$ grabit cprog pnc0
 +make: Entering directory '/var/public/SEMESTER/CLASS/PROJECT'
 +‘/var/public/SEMESTER/CLASS/PROJECT/Makefile’ -> ‘/home/USERNAME/src/CLASS/PROJECT/Makefile’
 +‘/var/public/SEMESTER/CLASS/PROJECT/primebrute.c’ -> ‘/home/USERNAME/src/CLASS/PROJECT/primebrute.c’
 +‘/var/public/SEMESTER/CLASS/PROJECT/primebrk.c’ -> ‘/home/USERNAME/src/CLASS/PROJECT/primebrk.c’
 +make: Leaving directory '/var/public/SEMESTER/CLASS/PROJECT'
 +lab46:~/src/CLASS$ cd pnc0
 +lab46:~/src/CLASS/pnc0$ ls
 +Makefile  primebrute.c  primebrk.c
 +lab46:~/src/CLASS/pnc0$ 
 +</cli>
 +
 +NOTE: You do NOT want to do this on a populated pnc0 project directory-- it will overwrite files.
 +
 +And, of course, your basic compile and clean-up operations:
 +
 +  * **make**: compile everything
 +  * **make debug**: compile everything with debug support
 +  * **make clean**: remove all binaries
 +
 +Just another "nice thing" we deserve.
  
 =====Command-Line Arguments===== =====Command-Line Arguments=====
Line 140: Line 171:
   * argv[0]: program invocation (path + program name)   * argv[0]: program invocation (path + program name)
   * argv[1]: our maximum / upper bound   * argv[1]: our maximum / upper bound
 +  * argv[2]: reserved value, should still be provided and be a 1 for this project
 +  * argv[3]: conditionally optional; represents lower bound
 +  * argv[4]: conditionally optional; represents upper bound
  
 ====Simple argument checks==== ====Simple argument checks====
Line 333: Line 367:
 Also, the do-while is the only one of our loops which NEEDS a terminating semi-colon (**;**).. please take note of this. Also, the do-while is the only one of our loops which NEEDS a terminating semi-colon (**;**).. please take note of this.
  
-=====Grabit Integration===== 
-For those familiar with the **grabit** tool on lab46, I have made some skeleton files and a custom **Makefile** available for this project. 
- 
-To "grab" it: 
- 
-<cli> 
-lab46:~/src/cprog$ grabit cprog pnc0 
-make: Entering directory '/var/public/SEMESTER/CLASS/PROJECT' 
-‘/var/public/SEMESTER/CLASS/PROJECT/Makefile’ -> ‘/home/USERNAME/src/CLASS/PROJECT/Makefile’ 
-‘/var/public/SEMESTER/CLASS/PROJECT/primebrute.c’ -> ‘/home/USERNAME/src/CLASS/PROJECT/primebrute.c’ 
-‘/var/public/SEMESTER/CLASS/PROJECT/primebruteopt.c’ -> ‘/home/USERNAME/src/CLASS/PROJECT/primebruteopt.c’ 
-make: Leaving directory '/var/public/SEMESTER/CLASS/PROJECT' 
-lab46:~/src/CLASS$ cd pnc0 
-lab46:~/src/CLASS/pnc0$ ls 
-Makefile  primebrute.c  primebruteopt.c 
-lab46:~/src/CLASS/pnc0$  
-</cli> 
- 
-NOTE: You do NOT want to do this on a populated pnc0 project directory-- it will overwrite files. 
- 
-And, of course, your basic compile and clean-up operations: 
- 
-  * **make**: compile everything 
-  * **make debug**: compile everything with debug support 
-  * **make clean**: remove all binaries 
- 
-Just another "nice thing" we deserve. 
  
 =====Execution===== =====Execution=====
Line 369: Line 376:
 lab46:~/src/cprog/pnc0$ ./primebrute 24 1 lab46:~/src/cprog/pnc0$ ./primebrute 24 1
 2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89  2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 
-  0.000088+  0.000165
 lab46:~/src/cprog/pnc0$  lab46:~/src/cprog/pnc0$ 
 </cli> </cli>
Line 385: Line 392:
  
 In this case, the program logic should have detected an invalid condition and bailed out before prime computations even began. No timing data is displayed, because exiting should occur even prior to that. In this case, the program logic should have detected an invalid condition and bailed out before prime computations even began. No timing data is displayed, because exiting should occur even prior to that.
 +
 +====upper bound overriding quantity====
 +As indicated above, there is potential interplay with an active quantity and upper bound values. Here is an example where upper bound overrides quantity, resulting in an early termination (ie upper bound is hit before quantity):
 +
 +<cli>
 +lab46:~/src/cprog/pnc0$ ./primebrute 128 1 7 23
 +7 11 13 17 19 23
 +  0.000125
 +lab46:~/src/cprog/pnc0$ 
 +</cli>
 +
 +Also for fun, I set the lower bound to 7, so you'll see computation starts at 7 (vs. the usual 2).
 =====Check Results===== =====Check Results=====
 If you'd like to compare your implementations, I rigged up a script called **primerun** which you can run. If you'd like to compare your implementations, I rigged up a script called **primerun** which you can run.
  
-In order to work, you **MUST** be in the directory where your **primebrute** and **primebruteopt** binaries reside, and must be named as such.+In order to work, you **MUST** be in the directory where your **primebrute** and **primebrk** binaries reside, and must be named as such.
  
-For instance (running on my implementation of prime brute and primebruteopt):+For instance (running on my implementation of prime brute and primebrk):
  
 <cli> <cli>
 lab46:~/src/cprog/pnc0$ primerun lab46:~/src/cprog/pnc0$ primerun
 =================================== ===================================
-    range        brute     bruteopt+      qty        brute          brk
 =================================== ===================================
-      128     0.000177     0.000127 +       32     0.000166     0.000120 
-      256     0.000389     0.000159 +       64     0.000576     0.000201 
-      512     0.001526     0.000358 +      128     0.002860     0.000532 
-     1024     0.005399     0.000964 +      256     0.012316     0.001969 
-     2048     0.019101     0.002809 +      512     0.057345     0.007655 
-     4096     0.070738     0.009380 +     1024     0.268914     0.031949 
-     8192     0.271477     0.032237 +     2048     1.256834     0.136228 
-    16384     1.067010     0.117134 +     4096     5.880069     0.586694 
-    32768     4.193584     0.424562 +     8192   ----------     3.065084 
-    65536   ----------     1.573066 +    16384   ----------   ----------
-   131072   ----------     7.753300 +
-   262144   ----------   ----------+
 =================================== ===================================
- verify:       OK           OK+ verify:        OK           OK
 =================================== ===================================
 lab46:~/src/cprog/pnc0$  lab46:~/src/cprog/pnc0$ 
 </cli> </cli>
  
-For evaluation, each test is run 4 times, and the resulting time is averaged. During development, I have it set to only run each test once.+If the runtime of a particular prime variant exceeds an upper runtime threshold (likely to be set at 2 seconds), it will be omitted from further tests, and a series of dashes will instead appear in the output.
  
-If the runtime of a particular prime variant exceeds an upper threshold (likely to be set at 2 seconds), it will be omitted from further tests, and a series of dashes will instead appear in the output. +If you don't feel like waiting, simply hit **CTRL-c** (maybe a couple of times) and the script will terminate.
- +
-If you don't feel like waiting, simply hit **CTRL-c** and the script will terminate.+
  
 I also include a validation check- to ensure your prime programs are actually producing the correct list of prime numbers. If the check is successful, you will see "OK" displayed beneath in the appropriate column; if unsuccessful, you will see "MISMATCH". I also include a validation check- to ensure your prime programs are actually producing the correct list of prime numbers. If the check is successful, you will see "OK" displayed beneath in the appropriate column; if unsuccessful, you will see "MISMATCH".
 +
 +Analyze the times you see... do they make sense, especially when comparing the algorithm used and the quantity being processed? These are related to some very important core Computer Science considerations we need to be increasingly mindful of as we design our programs and implement our solutions. Algorithmic complexity and algorithmic efficiency will be common themes in all we do.
 =====Submission===== =====Submission=====
 To successfully complete this project, the following criteria must be met: To successfully complete this project, the following criteria must be met:
Line 429: Line 446:
   * Code must be nicely and consistently indented (you may use the **indent** tool)   * Code must be nicely and consistently indented (you may use the **indent** tool)
   * Code must utilize the algorithm(s) presented above:   * Code must utilize the algorithm(s) presented above:
-    * **primebrute.c** must do the unoptimized brute force method +    * **primebrute.c** must do the raw, unoptimized brute force method 
-    * **primebruteopt.c** must do the brute force with the composite loop **break** +    * **primebrk.c** enhances the brute force method with a smart check to stop checking a number once it fails being prime
   * Code must be commented   * Code must be commented
     * have a properly filled-out comment banner at the top     * have a properly filled-out comment banner at the top
Line 442: Line 459:
  
 <cli> <cli>
-$ submit cprog pnc0 primebrute.c primebruteopt.c+$ submit cprog pnc0 primebrute.c primebrk.c
 Submitting cprog project "pnc0": Submitting cprog project "pnc0":
     -> primebrute.c(OK)     -> primebrute.c(OK)
-    -> primebruteopt.c(OK)+    -> primebrk.c(OK)
  
 SUCCESSFULLY SUBMITTED SUCCESSFULLY SUBMITTED
Line 456: Line 473:
 <code> <code>
 52:pnc0:final tally of results (52/52) 52:pnc0:final tally of results (52/52)
-*:pnc0:primebrute.c submitted with submit tool [2/2] +*:pnc0:primebrute.c performs proper argument checking [4/4] 
-*:pnc0:primebrute.c no negative compiler messages [4/4]+*:pnc0:primebrute.c no negative compiler messages [2/2]
 *:pnc0:primebrute.c implements only specified algorithm [6/6] *:pnc0:primebrute.c implements only specified algorithm [6/6]
 *:pnc0:primebrute.c adequate indentation and comments [4/4] *:pnc0:primebrute.c adequate indentation and comments [4/4]
 *:pnc0:primebrute.c output conforms to specifications [4/4] *:pnc0:primebrute.c output conforms to specifications [4/4]
 *:pnc0:primebrute.c primerun runtime tests succeed [6/6] *:pnc0:primebrute.c primerun runtime tests succeed [6/6]
-*:pnc0:primebruteopt.c submitted with submit tool [2/2] +*:pnc0:primebrk.c performs proper argument checking [4/4] 
-*:pnc0:primebruteopt.c no negative compiler messages [4/4] +*:pnc0:primebrk.c no negative compiler messages [2/2] 
-*:pnc0:primebruteopt.c implements only specified algorithm [6/6] +*:pnc0:primebrk.c implements only specified algorithm [6/6] 
-*:pnc0:primebruteopt.c adequate indentation and comments [4/4] +*:pnc0:primebrk.c adequate indentation and comments [4/4] 
-*:pnc0:primebruteopt.c output conforms to specifications [4/4] +*:pnc0:primebrk.c output conforms to specifications [4/4] 
-*:pnc0:primebruteopt.c primerun runtime tests succeed [6/6]+*:pnc0:primebrk.c primerun runtime tests succeed [6/6]
 </code> </code>
 +
haas/summer2017/cprog/projects/pnc0.1497873703.txt.gz · Last modified: 2017/06/19 12:01 by wedge

Page Tools

Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki