This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
notes:discrete:fall2022:projects:cnv0 [2022/09/18 15:55] – [OUTPUT SPECIFICATIONS] hcordell | notes:discrete:fall2022:projects:cnv0 [2022/09/22 01:56] (current) – [PROGRAM] dmuck | ||
---|---|---|---|
Line 26: | Line 26: | ||
The n-ary value of something is determined by the number of " | The n-ary value of something is determined by the number of " | ||
=====ALGORITHM: | =====ALGORITHM: | ||
+ | Somewhere in the algorithm you may need to make use of the modulo (%) operator. The modulo operator gives you the remainder after a division. For example 5 % 2 would give you 1, since there is a remainder of 1 after dividing 5 by 2. This operator can be used to check if the result of two numbers being divided is a whole number (divider % divisor == 0). | ||
=====SPECIFICATIONS===== | =====SPECIFICATIONS===== | ||
Line 43: | Line 43: | ||
Once you've grabbed the cnv0 project directory, with the **grabit** command, you will have a skeleton source code file. This source code contains structs, functions, and a fprintf statement that will calculate how long it takes for your program to finish processing. This is only for timekeeping and referencing, | Once you've grabbed the cnv0 project directory, with the **grabit** command, you will have a skeleton source code file. This source code contains structs, functions, and a fprintf statement that will calculate how long it takes for your program to finish processing. This is only for timekeeping and referencing, | ||
+ | |||
+ | **Note:** If you are coding this project in c++ you should modify the Makefile that way make can still build the project. To do this go to the top of the make file and change CC=gcc to CC=g++, as well as removing the flag —-std=gnu18 two lines above. | ||
The cnv0 program will accept 4 arguments, two are mandatory and two are optional. | The cnv0 program will accept 4 arguments, two are mandatory and two are optional. | ||
Line 67: | Line 69: | ||
The start argument is the lower bound of where the program will begin to check for n-ary numbers. | The start argument is the lower bound of where the program will begin to check for n-ary numbers. | ||
- | The end argument is the upper bound of where the program will stop to check for n-ary values. | + | The end argument is the upper bound of where the program will stop checking |
Hence, if you have the following case: | Hence, if you have the following case: | ||
< | < | ||
lab46: | lab46: | ||
- | |||
7 11 13 17 19 | 7 11 13 17 19 | ||
</ | </ | ||
Line 83: | Line 84: | ||
Output should be a space separated list of matching n-ary values with a newline at the end. Beneath that should be the amount of time it took for your script to complete. This doesn' | Output should be a space separated list of matching n-ary values with a newline at the end. Beneath that should be the amount of time it took for your script to complete. This doesn' | ||
=====VERIFICATION===== | =====VERIFICATION===== | ||
- | There is no verify file so in order to verify that your script is working correctly, you can do this manually. To do so, you can enter values into your script, figure out what the output should be, and see if your script outputs that. If it doesn' | + | There is no verify file so in order to verify that your script is working correctly, you can do this manually. To do so, you can enter values into your script, figure out what the output should be, and see if your script outputs that. If it doesn' |
+ | |||
+ | < | ||
+ | lab46: | ||
+ | 1 2 3 5 7 11 13 | ||
+ | x.xxxx (Time) | ||
+ | </ | ||
+ | |||
+ | < | ||
+ | lab46: | ||
+ | 4 6 8 9 10 14 15 | ||
+ | x.xxxx (Time) | ||
+ | </ | ||
+ | |||
+ | < | ||
+ | lab46: | ||
+ | 12 16 | ||
+ | x.xxxx (Time) | ||
+ | </ | ||
+ | |||
+ |