haas:summer2017:cprog:projects:pnc0
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:summer2017:cprog:projects:pnc0 [2017/06/19 13:05] – [specified quantity] wedge | haas:summer2017:cprog:projects:pnc0 [2017/06/19 15:00] (current) – [Command-Line Arguments] wedge | ||
|---|---|---|---|
| Line 82: | Line 82: | ||
| - **primebrute.c**: | - **primebrute.c**: | ||
| - | - **primebruteopt.c**: for your slightly optimized brute force implementation | + | - **primebrk.c**: implementation |
| Your program should: | Your program should: | ||
| Line 107: | Line 107: | ||
| * 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 118: | Line 118: | ||
| * 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 " | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | make: Entering directory '/ | ||
| + | ‘/ | ||
| + | ‘/ | ||
| + | ‘/ | ||
| + | make: Leaving directory '/ | ||
| + | lab46: | ||
| + | lab46: | ||
| + | Makefile | ||
| + | lab46: | ||
| + | </ | ||
| + | |||
| + | 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 339: | 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 " | ||
| - | |||
| - | <cli> | ||
| - | lab46: | ||
| - | make: Entering directory '/ | ||
| - | ‘/ | ||
| - | ‘/ | ||
| - | ‘/ | ||
| - | make: Leaving directory '/ | ||
| - | lab46: | ||
| - | lab46: | ||
| - | Makefile | ||
| - | lab46: | ||
| - | </ | ||
| - | |||
| - | 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 406: | Line 407: | ||
| If you'd like to compare your implementations, | If you'd like to compare your implementations, | ||
| - | 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: | lab46: | ||
| =================================== | =================================== | ||
| - | range | + | qty |
| =================================== | =================================== | ||
| - | 128 0.000177 | + | |
| - | | + | 64 0.000576 |
| - | | + | |
| - | 1024 0.005399 | + | |
| - | 2048 0.019101 | + | |
| - | 4096 0.070738 | + | 1024 0.268914 |
| - | 8192 | + | 2048 |
| - | | + | 4096 |
| - | 32768 | + | 8192 ---------- |
| - | | + | |
| - | | + | |
| - | 262144 | + | |
| =================================== | =================================== | ||
| - | | + | |
| =================================== | =================================== | ||
| lab46: | lab46: | ||
| </ | </ | ||
| - | For evaluation, each test is run 4 times, and the resulting time is averaged. During development, | + | 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** |
| - | + | ||
| - | 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 " | 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 " | ||
| + | |||
| + | 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 447: | 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 |
| * 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 460: | Line 459: | ||
| <cli> | <cli> | ||
| - | $ submit cprog pnc0 primebrute.c | + | $ submit cprog pnc0 primebrute.c |
| Submitting cprog project " | Submitting cprog project " | ||
| -> primebrute.c(OK) | -> primebrute.c(OK) | ||
| - | -> primebruteopt.c(OK) | + | -> primebrk.c(OK) |
| SUCCESSFULLY SUBMITTED | SUCCESSFULLY SUBMITTED | ||
| Line 480: | Line 479: | ||
| *: | *: | ||
| *: | *: | ||
| - | *:pnc0:primebruteopt.c performs proper argument checking [4/4] | + | *:pnc0:primebrk.c performs proper argument checking [4/4] |
| - | *:pnc0:primebruteopt.c no negative compiler messages [2/2] | + | *: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] |
| </ | </ | ||
| + | |||
haas/summer2017/cprog/projects/pnc0.1497877540.txt.gz · Last modified: 2017/06/19 13:05 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
