Corning Community College CSCS1320 C/C++ Programming ~~TOC~~ ======Project: MENTAL MATH (DAY OF WEEK)====== =====Objective===== To implement a programmatic solution (ie simulation) of a real life process- the mental math trick of determining what day of the week January 1 of any given year (in the 21st century) falls on. ======Assumptions====== To assist you in completing this project, you may make the following assumptions: * all requests will be for days in the 21st century (2000-2099) =====Prerequisites/Corequisites===== In addition to the new skills required on previous projects, to successfully accomplish/perform this project, the listed resources/experiences need to be consulted/achieved: * ability to construct and use selection statements (if) =====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 ^ Tuesday ^ Wednesday ^ Thursday ^ Friday ^ Saturday ^ Sunday | | 1 | 2 | 3 | 4 | 5 | 6 | 7 or 0 | ====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 dropping the last digit. 10% of 54 is 5. For our 2014 example, 10% of 14 is therefore 1. So we need two 10 percents... 1.4 + 1.4 = 2.8 Finally, 5% is half of 10% (half of 1 is 0.5), so 1.4 + 1.4 + 0.5 = 3.3 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? lab46:~$ cal 01 2014 January 2014 Su Mo Tu We Th Fr Sa 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 lab46:~$ Pretty neat, eh? ====Exception: Leap Years==== 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". =====Program===== It is your task to write the program that will use the above method to determine the day of the week any given January 1st in the 21st century falls on. Your program should: * prompt the user for the four digit year (input) * perform the task (process) * display the final value (output) =====Execution===== lab46:~/src/cprog/dayofweek$ ./dayofweek Which year: 2014 January 1st, 2014 falls on: Wednesday lab46:~/src/cprog/dayofweek$ The execution of the program is short and simple- obtain the input, do the processing, produce the output, and then terminate. =====Reflection===== Be sure to provide any commentary on your opus regarding realizations had and discoveries made during your pursuit of this project. * 2000 by definition isn't a leap year, but how does this algorithm work for 2000 in general? * Try this algorithm on some years in the 20th century and see how it fares. * Is it correct? Is it correct for any of them? * 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, and its limitations. =====Submission===== To successfully complete this project, the following criteria must be met: * Code must compile cleanly (no warnings or errors) * Executed program must display a total of 2 lines, one for input, one for output. * Output must be correct, and match the form given in the sample output above. * Code must be nicely and consistently indented (you may use the **indent** tool) * Code must be commented * have a properly filled-out comment banner at the top * have at least 20% of your program consist of **//**-style descriptive comments * Output Formatting (including spacing) of program must conform to the provided output (see above). * Track/version the source code in a repository * Submit a copy of your source code to me using the **submit** tool. To submit this program to me using the **submit** tool, run the following command at your lab46 prompt: $ submit cprog dayofweek dayofweek.c Submitting cprog project "dayofweek": -> dayofweek.c(OK) SUCCESSFULLY SUBMITTED 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.