This shows you the differences between two versions of the page.
Next revision | Previous revision | ||
haas:fall2022:cprog:projects:dow0 [2021/03/22 14:47] – created - external edit 127.0.0.1 | haas:fall2022:cprog:projects:dow0 [2022/09/23 21:26] (current) – [RUBRIC] wedge | ||
---|---|---|---|
Line 4: | Line 4: | ||
</ | </ | ||
- | ======Project: MENTAL MATH - DAY OF WEEK (DOW0)====== | + | ======PROJECT: MENTAL MATH - DAY OF WEEK (DOW0)====== |
- | =====Objective===== | + | =====OBJECTIVE===== |
- | To implement a programmatic solution (ie simulation) | + | To begin our exploration |
- | ======Assumptions====== | + | =====GRABIT===== |
- | + | To assist | |
- | To assist | + | |
- | + | ||
- | * all requests will be for days in the 21st century (2000-2099) | + | |
- | =====Prerequisites/ | + | |
- | In addition to the new skills required on previous projects, to successfully accomplish/ | + | |
- | + | ||
- | | + | |
- | | + | |
- | + | ||
- | =====Background===== | + | |
- | Mental Math constitutes an intersection of mental tricks and math- instead of utilizing a purely math-only solution, textual manipulations or simplifications in the computational process may take place enabling an individual to, once having learned the process, solve such problems in their head, and typically without the use of a calculating device. | + | |
- | + | ||
- | The process in this case is one of simple (reduced) multiplication and mapping against a table. To wit: | + | |
- | + | ||
- | ====Day values==== | + | |
- | For this trick to work, we need to be familiar with the following table (a map of days to numeric values): | + | |
- | + | ||
- | ^ Monday | + | |
- | | 1 | 2 | 3 | 4 | 5 | 6 | 7 or 0 | | + | |
- | + | ||
- | **NOTE:** Depending on how you implement your algorithm, you may find your approach prefers 7s OR 0s... you aren't necessarily going to be encountering them at random. Once you work through your approach, you will discover which one you end up with. | + | |
- | ====Calculating day of the week based on year==== | + | |
- | + | ||
- | Okay, time for the magic. | + | |
- | + | ||
- | Let us try it on January 1st, 2014. | + | |
- | + | ||
- | ===Step 1: Obtain last two digits of the year=== | + | |
- | In our example, we're working with 2014, the last two digits are therefore: 14 | + | |
- | + | ||
- | You should be able to come up with a means of extracting this information in your program. | + | |
- | + | ||
- | ===Step 2: Compute 25% (drop the decimal)=== | + | |
- | Even this is something we can do in our heads. I can think of two approaches right off the bat: | + | |
- | + | ||
- | ==Approach 1: 10 + 10 + 5== | + | |
- | 10% percent of anything is merely moving the decimal over one place to the left. 10% of 54 is 5.4 | + | |
- | + | ||
- | For our 2014 example, 10% of 14 is therefore 1.4 | + | |
- | + | ||
- | So we need two 10 percents... 1.4 + 1.4 = 2.8 | + | |
- | + | ||
- | Finally, 5% is half of 10% (half of 1.4 is 0.7), so 1.4 + 1.4 + 0.7 = 3.5 | + | |
- | + | ||
- | But, since we do not care about the decimal, we drop it and are left with just 3. | + | |
- | + | ||
- | ==Approach 2: half of half== | + | |
- | 25% is a convenient value for us with respect to 100, allowing this optimized approach to work. | + | |
- | + | ||
- | * Half of 100 is 50 (50%) | + | |
- | * Half of 50 is 25 (25%) -- hence the "half of half" | + | |
- | + | ||
- | So, 14 cut in half is 7. | + | |
- | + | ||
- | 7 cut in half is 3.5. | + | |
- | + | ||
- | Once again, dropping the decimal yields 3. | + | |
- | + | ||
- | ===Step 3: Add 25% to year value=== | + | |
- | Once we have our 25% value, go and add it back to our two-digit year value: | + | |
- | + | ||
- | 14 + 3 = 17 | + | |
- | + | ||
- | ===Step 4: Subtract the largest fitting multiple of 7=== | + | |
- | + | ||
- | Some multiples of 7: | + | |
- | + | ||
- | | 0 | 7 | 14 | 21 | 28 | 35 | 42 | 49 | | + | |
- | + | ||
- | So, with a value of 17, what is the largest multiple of 7 that is still less than (or equal to) 17? | + | |
- | + | ||
- | Hopefully you identified the 14 as the likely candidate. | + | |
- | + | ||
- | 17 - 14 = 3 | + | |
- | + | ||
- | ===Step 5: Look up day in table=== | + | |
- | We ended up with a 3 as the result for January 1st, 2014. | + | |
- | + | ||
- | Go and reference the 3 from that table... what day do we get? Does it match the actual day of the week for January 1st, 2014? | + | |
<cli> | <cli> | ||
- | lab46: | + | lab46:~/ |
- | January 2014 | + | |
- | Su Mo Tu We Th Fr Sa | + | |
- | 1 2 3 4 | + | |
- | | + | |
- | 12 13 14 15 16 17 18 | + | |
- | 19 20 21 22 23 24 25 | + | |
- | 26 27 28 29 30 31 | + | |
- | + | ||
- | lab46: | + | |
</ | </ | ||
- | Pretty neat, eh? | + | =====OVERVIEW===== |
+ | Your task is to write a program that performs the mental math technique of determining what day of the week January 1st falls on for any year in the 21st century. | ||
- | ====Exception: | + | Contributing to project documentation is also a core part of this project. If from reading |
- | In the event of a leap year, we simply subtract 1 from the 25% value, and continue on as usual. | + | |
- | Makes sense, right? Leap years add a day, so something ends up being "off by one". | + | You want the project documentation to provide you (as if coming in with no awareness of the project) with sufficient information |
- | =====Program===== | + | =====EDIT===== |
- | It is your task to write the program that will use the above method | + | You will want to go [[/ |
- | Your program should: | + | * [[/ |
- | * prompt the user for the four digit year (input) | + | |
- | * perform the task (process) | + | |
- | * display the final value (output) | + | |
- | =====Execution===== | + | {{page> |
- | <cli> | + | =====SUBMISSION===== |
- | lab46: | + | To be successful in this project, the following criteria (or their equivalent) must be met: |
- | Which year: 2014 | + | |
- | January 1st, 2014 falls on: Wednesday | + | |
- | lab46: | + | |
- | </ | + | |
- | The execution of the program is short and simple- obtain the input, do the processing, produce the output, and then terminate. | + | * Project must be submit on time, by the deadline. |
- | + | * Late submissions will lose 33% credit per day, with the submission window closing on the 3rd day following | |
- | ====Output Specifications==== | + | * All code must compile cleanly (no warnings or errors) |
- | Your program must output as follows: | + | * Compile with the **-Wall** |
- | + | * all requested functionality | |
- | * Input prompts, and everything else except | + | * Executed |
- | * The calculated | + | * output |
- | * The output MUST contain the " | + | * Processing |
- | * YEAR must be all 4 digits, exactly as input by the user | + | * Output, if applicable, |
- | | + | * Code must be nicely and consistently indented |
- | =====Reflection===== | + | |
- | Be sure to provide any commentary on your journal regarding realizations had and discoveries made during your pursuit of this project. | + | |
- | + | ||
- | | + | |
- | | + | |
- | * If it isn't correct, is it consistently off by a value? | + | |
- | + | ||
- | This isn't just about implementing a particular algorithm, it is about understanding an algorithm- its domain of correctness, | + | |
- | =====Submission===== | + | |
- | To successfully complete this project, the following criteria | + | |
- | + | ||
- | * Code must compile cleanly | + | |
- | * Executed | + | |
- | | + | |
- | * input must be a number, NOT a string | + | |
- | * Output must be correct, and match the form given in the sample output above. | + | |
- | * Code must be nicely and consistently indented | + | |
* Code must be commented | * Code must be commented | ||
- | * Output Formatting | + | * Any "to be implemented" |
- | * Track/ | + | * these |
- | * Submit a copy of your source code to me using the **submit** tool. | + | |
+ | * No global variables | ||
+ | * Track/ | ||
+ | * Submit | ||
- | To submit | + | ====Submit Tool Usage==== |
+ | Let' | ||
+ | submit, | ||
+ | uom0.c): | ||
<cli> | <cli> | ||
- | lab46: | + | lab46: |
</ | </ | ||
- | 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. | ||
- | What I'll be looking for: | + | =====RUBRIC===== |
+ | I'll be evaluating the project based on the following criteria: | ||
< | < | ||
- | 52:dow0:final tally of results (52/52) | + | 39:dow0:final tally of results (39/39) |
- | *:dow0:obtained via grabit by Sunday | + | *:dow0:used grabit |
- | *:dow0:program compiles successfully, no errors | + | *:dow0:clean compile, no compiler messages |
- | *: | + | *: |
- | *: | + | *: |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | *:dow0:code updates committed/ | + | |
- | *:dow0:code uses correct variable types and name lengths [4/4] | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
</ | </ | ||
- | Additionally: | + | ===Pertaining to the collaborative authoring of project documentation=== |
- | * Solutions not abiding by **SPIRIT** | + | |
- | * Solutions not utilizing descriptive why and how **COMMENTS** | + | * each class member is to participate in the contribution of relevant information and formatting of the documentation |
- | * Solutions not utilizing | + | * minimal member contributions consist of: |
- | * Solutions | + | * near the class average edits (a value of at least four productive edits) |
+ | * near the average class content change average (a value of at least 256 bytes (absolute value of data content change)) | ||
+ | * near the class content contribution average (a value of at least 1kiB) | ||
+ | * no adding in one commit then later removing in its entirety for the sake of satisfying edit requirements | ||
+ | * adding and formatting data in an organized fashion, aiming to create an informative and readable document that anyone in the class can reference | ||
+ | * content contributions will be factored into a documentation coefficient, | ||
+ | * no contributions, | ||
+ | * less than minimum contributions is 0.75 | ||
+ | * met minimum contribution threshold is 1.00 | ||
+ | |||
+ | ===Additionally=== | ||
+ | |||
+ | * Solutions not abiding | ||
+ | * Solutions | ||
+ | * Solutions not utilizing | ||
+ | * Solutions not organized and easy to read (assume a terminal at least 90 characters wide, 40 characters tall) are subject to a 25% overall deduction |