Differences

This shows you the differences between two versions of the page.

--- haas:fall2019:unix:projects:pct0 [2019/08/04 14:02] – [Look for matching MD5 sum in MANIFEST] wedge
+++ haas:fall2019:unix:projects:pct0 [2019/08/15 19:39] (current) – [Submission] wedge
@@ Line 519: / Line 519: @@
 =====Getting started=====
-In the **pct0/** sub-directory of the UNIX Public Directory, under a directory by the name of your username, you will find the following file:
+Your puzzle is the following:
-  * **pct0.puzzle**
+<code>
+              EBGKO
+       +-----------
+CGVBNK | KREPKCPBVC
+        -CGVBNK
+         ======
+         CPVKVNP
+        -CEONGCN
+         =======
+          CBVEOGB
+         -CPEKBVC
+          =======
+           OBCRGPV
+          -OKCNVNG
+           =======
+             GBBBEC
+            -KBEKCR
+             ======
+             OVKVKG
-Copy this file into your local project directory.
+letters: BCEGKNOPRV
+</code>
-There is also a **MANIFEST** file in the parent directory (the **pct0/** sub-directory), which will contain MD5sums of the various puzzle keys, provided to help you in verifying your puzzle key.
-For this project, you have to solve, DOCUMENT, AND VERIFY the provided puzzle in order to be eligible for full credit will be the one contained in the **puzzle** file.
+For this project, you have to solve, DOCUMENT, AND VERIFY the provided puzzle in order to be eligible for full available points.
 =====Process=====
@@ Line 545: / Line 562: @@
 As indicated, you are to place the determined key to your puzzle in a regular text file called 'pct0.puzzle.key', and will contain ONLY the capital letters, in order from 0-9, of your puzzle (and a trailing newline).
-For example, using the example puzzle above:
+For example, using the example earlier in this document (that was walked through):
 |  0  |  R  |
@@ Line 587: / Line 604: @@
 =====Verification=====
-Want to check to see if your key is correct (ie all letters in the right order)?
+In addition to documenting the process of solving the puzzle, and coming up with a solution, you are to manually verify your solution by taking the numeric identities of each letter, plugging them back into the original puzzle, solving it, and converting the obtained quotient and remainder back into letter form to compare with those in the puzzle provided to you. If they match, you have successfully solved the puzzle. If they do not match, some error exists that should be addressed and corrected.
-====Generate MD5 sum====
+The verification can go at the bottom of your solution file, after you've documented your puzzle from start to completion.
-You can do so, by generating an MD5 sum of your 'key' file and grepping for it in the MANIFEST file:
-<cli>
+An example of a verification text is as follows:
-lab46:~/src/unix/pct0$ md5sum pct0.puzzle.key | cut -d' ' -f1
-1395327d0826e3145b4f285a2b936707
-lab46:~/src/unix/pct0$
-</cli>
-Obviously, YOUR MD5 sum will be DIFFERENT from this, because this is the MD5 sum of the puzzle key explored at the top of this project page.
+====Verifying our key====
+The best way to verify the puzzle with our key is to convert the dividend and  divisor  to  its  numeric  equivalent,  perform  the  division, and compare the resulting  quotient and remainder against those  found in the letterified puzzle:
+  * divisor:  KJKK     --> 9899
+  * dividend: GLMBRVLR --> 37510270
+And let's do some long division!
+<code>
+         +---------
+| 37510270
+</code>
+goes into 37510 three times:
+<code>
+         +---------
+| 37510270
+          -29697
+           =====
+</code>
+It might be convenient to have a quick factor reference for 9899 handy:
+  * 9899 * 0 =     0
+  * 9899 * 1 =  9899
+  * 9899 * 2 = 19798
+  * 9899 * 3 = 29697
+  * 9899 * 4 = 39596
+  * 9899 * 5 = 49495
+  * 9899 * 6 = 59394
+  * 9899 * 7 = 69293
+  * 9899 * 8 = 79192
+  * 9899 * 9 = 89091
+fits into 78132 seven times (69293):
+<code>
+         +---------
+| 37510270
+          -29697
+           =====
+           -69293
+            =====
+</code>
+Once again, looking at the list of  factors, we see that the best fit for 9899 into 88397 is 79192 (a factor of 8):
+<code>
+         +---------
+| 37510270
+          -29697
+           =====
+           -69293
+            =====
+            -79192
+             =====
+</code>
+Finally, a factor of 9 (89091) fits in best:
+<code>
+<-- quotient
+         +---------
+| 37510270
+          -29697
+           =====
+           -69293
+            =====
+            -79192
+             =====
+             -89091
+              =====
+<-- remainder
+</code>
+Converting our quotient and remainder back to letters:
+  * quotient:  3789 --> GLJK
+  * remainder: 2959 --> VKMK
+And comparing against the problem we were given:
+  * quotient:  GLJK <-> GLJK
+  * remainder: VKMK <-> VKMK
+Success!
 =====Submission=====
 By successfully performing this project, you should be submitting files that satisfy the following requirements:
@@ Line 623: / Line 731: @@
 <code>
-:pct0:final tally of results (39/39)
+:pct0:final tally of results (13/0)
-*:pct0:puzzle.key file submitted with correct values [6/6]
+*:pct0:puzzle.key file submitted with correct values [2/0]
-*:pct0:puzzle.solution adequately documents discovery of each letter [26/26]
+*:pct0:puzzle.solution documents discovery of each letter [9/0]
-*:pct0:puzzle.solution verifies solution through performing problem [7/7]
+*:pct0:puzzle.solution verifies solution through performing problem [2/0]
 </code>
+Additional points of consideration:
+  * if any restrictions are in force and they are ignored in the solving of the problem, up to 50% of credit can be deducted.
+  * if solution is messy and disorganized, up to 50% of credit can be deducted.
+As a bonus project, there will be no additional bonus applied for 'early submission'.

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools