This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
haas:spring2016:cprog:projects:gfo0 [2016/04/07 19:20] – created wedge | haas:spring2016:cprog:projects:gfo0 [2016/04/13 16:46] (current) – [Bonus] wedge | ||
---|---|---|---|
Line 7: | Line 7: | ||
======Project: | ======Project: | ||
+ | |||
+ | =====Errata===== | ||
+ | |||
+ | * __correction__: | ||
=====Objective===== | =====Objective===== | ||
Line 24: | Line 28: | ||
This information has been accessible via the **status** tool. | This information has been accessible via the **status** tool. | ||
+ | =====Program===== | ||
+ | Throughout the semester, your class-related activities have been numerically captured and made available to you via the **status** tool. | ||
- | =====Task===== | + | Now that we are nearing the end, and your programming skillset is significantly expanded, I would like you to write a program to take this data and calculate your grade (reflective of currently recorded data). |
- | The task at hand can benefit from loop and array assistance. | + | |
- | For instance, taking the number input and processing | + | I've designed a tool that will take all your **status** data and ' |
- | =====Functions===== | + | For example: |
- | As indicated, this task shares many attributes with the **mbe1** project; in fact, the mental math process itself may be slightly simpler. That affords us the opportunity to introduce and learn about further programming optimizations, | + | |
- | Specifically, | + | < |
+ | lab46: | ||
+ | lab46: | ||
+ | -1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 -2 1 1 1 0 1 0 1 0 1 0 0 1 -3 11 13 6 9 4 9 5 9 6 9 19 20 6 0 18 20 -4 | ||
+ | lab46: | ||
+ | </ | ||
- | We've been using functions all along (everytime you use **fprintf()** or **fscanf()**, | + | Your program needs to do the following: |
- | ====Function prototype==== | + | * check for and open the **status.flat** file |
- | Like variables, functions need to be declared. | + | * if error occurs, display message and exit |
+ | * reading one integer at a time, load the values into an array according | ||
+ | * there will be three categories (arrays), each one identified by a header/ | ||
+ | * -1 indicates the start of participation data (28% of grade) | ||
+ | * -2 indicates end of participation data / start of journal data (36% of grade) | ||
+ | * -3 indicates end of journal data / start of project data (36% of grade) | ||
+ | * -4 indicates end of project data (and end of data stream) | ||
+ | * once loaded into their arrays, calculate the grade component | ||
+ | * tally up all three, and print out the results | ||
- | We can declare them at various scopes (file/ | + | Final program output should |
- | + | ||
- | If a particular function is only to be used by a specific function, and no others, you can opt to declare it local scope (ie within the function that will be calling it). | + | |
- | + | ||
- | A function is basically a module or subroutine. It is a mini-program, | + | |
- | + | ||
- | Like a program, it takes input, does processing, and provides | + | |
- | + | ||
- | Unlike a program, its input may not come from the keyboard, but instead from particular variables, and may not send output to the screen, but instead channel output in a way that it can be stored into a variable. | + | |
- | + | ||
- | This distinctions aside, a function can in many ways be viewed as a micro- or sub-program/ | + | |
- | + | ||
- | Keeping everything in ONE file, ONE big function in that one file, is rather monolithic. In time, with sufficiently large programs, such an arrangement would become a tad unwieldy. So functions help to keep our focus short yet attentive. | + | |
- | + | ||
- | To create a function we must first declare (or prototype) it. This needs to happen BEFORE said function is ever used (just as with variables- you must declare a variable before it is first used, otherwise the compiler yells). | + | |
- | + | ||
- | A function, in many ways, is like a programmable variable (or is a variable with programming attached). | + | |
- | + | ||
- | As such, it has a return value of a type (the function' | + | |
- | + | ||
- | We see this with main()... here are two variations of a **main()** function declaration (technically also the start of the definition as well, in the case of **main()**): | + | |
- | + | ||
- | ===Parameterless function=== | + | |
- | + | ||
- | <code c> | + | |
- | int main() | + | |
- | </ | + | |
- | + | ||
- | In this example, we see the declaration of main() where it has a return value of **int**, meaning, upon completion, main() will return a value corresponding with an int data type (also in main()' | + | |
- | + | ||
- | main(), in this case, takes no parameters (just an empty set of parenthesis)... due to this, we refer to this function as a parameterless function. A function without parameters. Without input. | + | |
- | + | ||
- | Now: this is technically a different form of input and output than you are used to. Input doesn' | + | |
- | + | ||
- | Additionally, | + | |
- | + | ||
- | ===Parametered function=== | + | |
- | + | ||
- | <code c> | + | |
- | int main(int argc, char **argv) | + | |
- | </ | + | |
- | + | ||
- | In this case, our **main()** function actually takes parameters- two, in fact: | + | |
- | + | ||
- | - an integer, we are calling **argc** | + | |
- | - a double pointer, we are calling **argv** | + | |
- | + | ||
- | This function takes two parameters, two pieces of input, available to us in the form of variables, by those names, of those types. We make use of them as we need to in accomplishing the program at hand. | + | |
- | + | ||
- | So, when we wish to create functions of our own, we need: | + | |
- | + | ||
- | * the return type | + | |
- | * the function name | + | |
- | * 0 or more parameters, identifying their order and type | + | |
- | + | ||
- | For example, let us make a sum() function. Here would be a likely prototype (we'd place it above main()): | + | |
- | + | ||
- | < | + | |
- | int sum(int *, int); | + | |
- | </ | + | |
- | + | ||
- | A function prototype (vs. its definition) will have a terminating semi-colon, as you see above. | + | |
- | + | ||
- | In our case, our sum() function has the following: | + | |
- | + | ||
- | * a return type of **int** (particular variable name doesn' | + | |
- | * the function' | + | |
- | * a comma-separated list of types corresponding to the parameters (again, variable names do not matter, but the type is important). | + | |
- | + | ||
- | Our sum() function will take an integer array (denoted by the int pointer above), and a size (the second, regular int). | + | |
- | + | ||
- | Now, parameter order very much matters. In our case, an "int *" came first, followed by an " | + | |
- | + | ||
- | ====Function definition==== | + | |
- | While a function prototype is technically optional (you can put the definition in place of the prototype-- we just often use prototypes to further allow organization), | + | |
- | + | ||
- | Our sum() function will be defined (below the main() function) as follows: | + | |
- | + | ||
- | <code c> | + | |
- | int sum(int *array, int size) | + | |
- | { | + | |
- | int result = 0; | + | |
- | int i = 0; | + | |
- | + | ||
- | for (i = 0; i < size; i++) | + | |
- | result = result + array[i]; | + | |
- | + | ||
- | return(result); | + | |
- | } | + | |
- | </ | + | |
- | + | ||
- | ====function calling==== | + | |
- | Once we've declared (prototyped) and defined our function, now all we have to do is use it! When you make use of a function, we refer to it as // | + | |
- | + | ||
- | Here would be an example of calling the above-mentioned **sum()** function: | + | |
- | + | ||
- | <code c> | + | |
- | int scores[4]; | + | |
- | int tally = 0; | + | |
- | + | ||
- | scores[0] = 88; | + | |
- | scores[1] = 47; | + | |
- | scores[2] = 96; | + | |
- | scores[3] = 73; | + | |
- | + | ||
- | tally = sum(scores, 4); | + | |
- | </ | + | |
- | + | ||
- | Note, that it is rather important to match the type and order of parameters. Due to the nature of the array (especially the form of array declaration) used, certain pointer-related details are being hidden from us, giving somewhat of a false impression. Further discussion about pointers will begin to shed light on that. | + | |
- | + | ||
- | + | ||
- | =====Program===== | + | |
- | It is your task to write a program that obtains a long integer value from the user, and processes that single value into separate array elements (one digit per array element). Determining the number of digits, you are to perform this "all from nine, last from ten" subtraction method on the number using array transactions, | + | |
- | + | ||
- | Your program | + | |
- | * obtain its input from STDIN. | + | |
- | * input should be in the form of a single (long) long integer value (you want a 64-bit data type) | + | |
- | * determine the number of digits of the inputted value (store this in a variable) | + | |
- | * process that input long integer into separate array elements- one digit per element. | + | |
- | * you may assume a maximum array size of the maximum number of digits you're theoretically able to input that can be stored in a 64-bit value. | + | |
- | * perform the "all from nine, the last from ten" operation on the array, storing the result in another array. | + | |
- | * display the problem being solved, along with the answer | + | |
- | * use functions to modularize your code: | + | |
- | * have an **longint2array()** function that takes the long int, and returns an array (the function itself handles the processing of splitting up the long int into individual digits). | + | |
- | * have a **printarray()** function, whose responsibility it is to display the indicated array to STDOUT. | + | |
- | * have a **allfromnine()** function that takes the source array, does the processing, and returns ther result array. | + | |
- | + | ||
- | I might suggest | + | |
- | + | ||
- | <code c> | + | |
- | unsigned char *longint2array(unsigned long int); | + | |
- | void printarray(unsigned char *, unsigned char); | + | |
- | unsigned char *allfromnine(unsigned char *); | + | |
- | </ | + | |
- | + | ||
- | Some questions to contemplate: | + | |
- | + | ||
- | * Why an array of unsigned chars when we're starting with a long (long) int? | + | |
- | * Why is that the "best fit" size-wise? | + | |
- | * Why will that not result in lost data? | + | |
- | * Why unsigned? | + | |
- | * What impact will that have on our input value' | + | |
- | * Why represent the size of the usable array as an unsigned char? | + | |
- | * Why is this the "best fit" size-wise? | + | |
- | =====Execution===== | + | |
- | An example of your program in action: | + | |
<cli> | <cli> | ||
- | lab46: | + | lab46: |
- | Enter value: 31415926535897 | + | Participation Component: 20 / 28 |
- | Digits detected: 14 | + | Journal Component: 20 / 36 |
- | + | Projects Component: | |
- | 100000000000000 | + | Total: |
- | - 31415926535897 | + | lab46: |
- | | + | |
- | 68584073464103 | + | |
- | + | ||
- | lab46: | + | |
</ | </ | ||
+ | |||
=====Submission===== | =====Submission===== | ||
Line 227: | Line 96: | ||
You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches. | You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches. | ||
- | ====0x4: Data Processing==== | ||
- | |||
- | Throughout the semester, your class-related activities have been numerically captured and made available to you via the **status** tool. | ||
- | |||
- | Now that we are at the end, and your programming skillset is significantly expanded, I would like you to write a program to take this data and calculate your grade (reflective of currently recorded data). | ||
- | |||
- | I've designed a tool that will take all your **status** data and ' | ||
- | |||
- | For example: | ||
- | |||
- | <cli> | ||
- | lab46: | ||
- | lab46: | ||
- | -1 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 0 0 0 1 1 1 1 -2 1 1 1 0 1 0 1 0 1 0 0 1 -3 11 13 6 9 4 9 5 9 6 9 19 20 6 0 18 20 -4 | ||
- | lab46: | ||
- | </ | ||
- | |||
- | Your program needs to do the following: | ||
- | |||
- | * check for and open the **status.flat** file | ||
- | * if error occurs, display message and exit | ||
- | * reading one integer at a time, load the values into an array according to their category | ||
- | * there will be three categories (arrays), each one identified by a header/ | ||
- | * -1 indicates the start of participation data (28% of grade) | ||
- | * -2 indicates end of participation data / start of journal data (36% of grade) | ||
- | * -3 indicates end of journal data / start of project data (36% of grade) | ||
- | * -4 indicates end of project data (and end of data stream) | ||
- | * once loaded into their arrays, calculate the grade component | ||
- | * tally up all three, and print out the results | ||
- | |||
- | Final program output should resemble the following: | ||
- | |||
- | <cli> | ||
- | lab46: | ||
- | Participation Component: 20 / 28 | ||
- | Journal Component: | ||
- | Projects Component: | ||
- | Total: | ||
- | lab46: | ||
- | </ | ||