This shows you the differences between two versions of the page.
Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
haas:spring2019:unix:projects:pct0 [2019/04/01 15:54] – [unittools suite] wedge | haas:spring2019:unix:projects:pct0 [2019/08/04 13:46] (current) – [Objective] wedge | ||
---|---|---|---|
Line 11: | Line 11: | ||
=====Objective===== | =====Objective===== | ||
- | To continue to cultivate your problem solving, critical thinking, analytical, and observation skills; to apply your skills on the UNIX command-line. | + | To continue to cultivate your problem solving, critical thinking, analytical, and observation skills. |
+ | The aim here is on observation, | ||
=====Background===== | =====Background===== | ||
- | The true nature of problem solving frequently involves critical thinking, analytical, and observation skills. Where problems are not solved by memorizing some pre-defined set of answers and regurgitating them mindlessly, but it crafting an elaborate solution from subtle cues and tested, experimental realizations. | + | The true nature of problem solving frequently involves critical thinking, analytical, and observation skills. Where problems are not solved by memorizing some pre-defined set of answers and regurgitating them mindlessly, but in crafting an elaborate solution from subtle cues and tested, experimental realizations. |
- | This project | + | This project puts you in contact with such endeavours. |
- | ====Letter | + | ====Long Division==== |
Letter division is a category of logic problem where you would take an ordinary math equation (in long form), and substitute all the numbers for letters, thereby in a direct sense masking the numeric values present that correctly enable the problem to work from start to completion. It is your task, through exploring, experimenting, | Letter division is a category of logic problem where you would take an ordinary math equation (in long form), and substitute all the numbers for letters, thereby in a direct sense masking the numeric values present that correctly enable the problem to work from start to completion. It is your task, through exploring, experimenting, | ||
Line 518: | Line 519: | ||
Your performance on this project will be directly tied to being able to document your process through the puzzle; I have provided this writeup in order to show you an example of what that process may look like. | Your performance on this project will be directly tied to being able to document your process through the puzzle; I have provided this writeup in order to show you an example of what that process may look like. | ||
- | =====Get started===== | + | =====Getting |
- | This week's project has 2 points of origin. | + | |
- | First, in the **upf1/** sub-directory of the UNIX Public Directory, under a directory by the name of your username, you will find the following | + | In the **pct0/** sub-directory of the UNIX Public Directory, under a directory by the name of your username, you will find the following |
- | * **TASK** | + | * **bonus** |
+ | * **practice0** | ||
+ | * **practice1** | ||
+ | * **practice2** | ||
+ | * **practice3** | ||
+ | * **puzzle** | ||
- | Copy this file into your project directory. | + | Copy these file into your project directory. |
- | The **TASK** file will contain the particular units to start with and convert | + | There is also a **MANIFEST** file in the parent directory (the **pct0/** sub-directory), |
- | Next, you will want to grab the latest version of the **unittools** suite from the following URL: | + | For this project, the only puzzle |
- | | + | Should you desire, there' |
- | You will want to use a tool like **wget(1)** or **curl(1)** to non-interactively download it onto your lab46 account, and similarly extract, compile, and install that (check its own README file). | + | As you gear up to work on the project-required puzzle |
+ | =====Process===== | ||
+ | Solve and document the puzzle. | ||
- | There may be multiple versions of **unittools** available at the download link. Unless you have specific reason otherwise (for this project, you do not), you want to go for the latest version, which will be reflected by the most recent datestamp encoded in the file's name. | + | On your own. |
- | For example, say you have the following: | + | Seek to discover and explore and understand, NOT to just come up with an answer. |
+ | =====Your Solution===== | ||
+ | As this project focuses more on the critical thinking process than being heavy in unravelling a problem using UNIX commands, your solution will be in 2 parts: | ||
- | * unittools-20160731-10.tar.gz | + | * your puzzle key, in a textfile called ' |
- | * unittools-20161024-14.tar.gz | + | * your documentation of your solving and exploration of the puzzle. If you did this on paper, I'll want it digitized and submitted as a file with this project. The file, if is text form, should be called ' |
- | * unittools-20170123-13.tar.gz | + | |
- | * unittools-20170201-09.tar.gz | + | |
- | From visual inspection, you would select | + | ====puzzle key==== |
+ | As indicated, you are to place the determined key to your puzzle in a regular text file called ' | ||
- | Note, however, that visual inspection alone is not good enough for your steps file. New versions may be released, and your steps file needs to obtain the most recent version available. To facilitate this task, the latest and greatest version of unittools will be listed in a file called LATEST (which you should see near the top of the directory index listing). You can make use of this file to assist you in automating the process of determining and downloading the latest version of the unittools tools. | + | For example, using the example puzzle above: |
- | Once those two steps are complete, you can begin on the tasks listed in your **TASK** file. | + | | 0 | R | |
+ | | 1 | B | | ||
+ | | 2 | V | | ||
+ | | 3 | G | | ||
+ | | 4 | P | | ||
+ | | 5 | M | | ||
+ | | 6 | O | | ||
+ | | 7 | L | | ||
+ | | 8 | J | | ||
+ | | 9 | K | | ||
- | + | We'll want to put them, in order, in our key file: | |
- | =====Process===== | + | |
- | In the **TASK** file, you will be given a set of source quantities/ | + | |
- | + | ||
- | As an example, take the following (formatted is it would appear | + | |
- | + | ||
- | < | + | |
- | task: 0 | + | |
- | precision: 3 | + | |
- | input_value: | + | |
- | input_unit: cm | + | |
- | output_unit: | + | |
- | chain_delim: | + | |
- | </ | + | |
- | + | ||
- | With these in mind, we can set about solving this problem, using the tools in combination to arrive at the desired result. | + | |
- | + | ||
- | A potential solution would be as follows: | + | |
<cli> | <cli> | ||
- | lab46: | + | lab46: |
- | 13.78 in | + | lab46: |
- | lab46: | + | |
- | 1.15 ft | + | |
- | lab46: | + | |
</ | </ | ||
- | But that's not very optimized. We could instead do something better, | + | Want to know what a proper |
<cli> | <cli> | ||
- | lab46: | + | lab46: |
- | 35.000 cm >> 13.780 in >> 1.148 ft | + | RBVGPMOLJK |
- | lab46: | + | lab46: |
</ | </ | ||
- | Note that with **precision**, | + | JUST the letters (and a trailing newline). |
- | We'll want to record our command-lines in the appropriate place. Since this is task #0, we'll want to record it in a file called: **task0.cli**, | + | ====solution documentation==== |
+ | As stated, a very large part of this project's evaluation will be based on your clear and detailed documentation of how you determined each letter' | ||
- | For final output, we'll want to display | + | Just providing |
- | < | + | Your documentation should, while there may be supporting information, |
- | lab46: | + | |
- | 35.000cm >> 13.780in >> 1.148ft | + | |
- | lab46: | + | |
- | </ | + | |
- | Basically, each task#.cli will be its own script. If we were to execute it, the correct result should be produced. | + | You are free to write out your solution with pen on paper (that is how I usually do these puzzles); but if you do so, you MUST digitize it and submit it as an image file when you submit this project. |
- | =====upf1steps===== | + | The aim here is not to dump a bunch of data on me, but instead present me with connected and pertinent information that documents your process of progression through the puzzle from start to finish. |
- | You will once again be creating a steps file that can automate | + | =====Verification===== |
+ | Want to check to see if your key is correct | ||
- | As in previous projects, **upf1steps** will contain the steps you took from the point of copying the numbers suite and downloading | + | ====Generate MD5 sum==== |
- | * To clarify: YES, I want to see steps creating a project directory, copying and downloading files in question, extracting, compiling, installing, and then of course running each individual task#.cli script. | + | You can do so, by generating an MD5 sum of your ' |
- | There are some additional constraints you need to keep in mind: | + | < |
+ | lab46:~/ | ||
+ | 1395327d0826e3145b4f285a2b936707 | ||
+ | lab46: | ||
+ | </ | ||
- | * your script should not produce ANY STDERR output | + | 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. |
- | * your script should ONLY produce STDOUT output in conformance with the below stated requirements. Any other output needs to be silenced. | + | |
- | * You will want one unified command-line producing the end result, not separate one-step transitions. The idea is to utilize pipes. | + | |
- | * semi-colons used to separate commands do not constitute one command-line, | + | |
- | * For each task, you'll want to display things as follows: | + | |
- | * "Task X conversion chain: CHAIN" | + | |
- | * where X is the task number (0, 1, 2, etc.) | + | |
- | * where CHAIN is the conversion chain output matching | + | |
- | * note that the task#.cli output appears on the SAME line as the "Task X conversion chain:" | + | |
- | * there is NO space between value and unit | + | |
- | For example, a sample output | + | NOTE: MD5 sums of your bonus and practice puzzles are also present in the MANIFEST file, so you can perform verifications on them in the same manner. |
+ | |||
+ | ====Look for matching MD5 sum in MANIFEST==== | ||
+ | Let's say the path to the **pct0/** sub-directory | ||
<cli> | <cli> | ||
- | lab46: | + | lab46: |
- | Task 0 conversion chain: 35.000cm >> 13.780in >> 1.148ft | + | MATCH FOUND |
- | ... | + | lab46: |
- | lab46: | + | |
</ | </ | ||
+ | If you have a match, congratulations, | ||
=====Submission===== | =====Submission===== | ||
- | By successfully performing this project, you should | + | By successfully performing this project, you should |
+ | |||
+ | * a ' | ||
+ | * a ' | ||
+ | |||
+ | Additionally, although optional, if you'd like to do similar for the bonus puzzle: | ||
+ | | ||
+ | * a 'bonus.solution' | ||
To submit this project to me using the **submit** tool, run the following command at your lab46 prompt: | To submit this project to me using the **submit** tool, run the following command at your lab46 prompt: | ||
<cli> | <cli> | ||
- | $ submit unix upf1 upf1steps task*.cli | + | $ submit unix pct0 puzzle.key puzzle.solution |
- | Submitting unix project "upf1": | + | Submitting unix project "pct0": |
- | -> upf1steps(OK) | + | -> puzzle.key(OK) |
- | -> task0.cli(OK) | + | -> puzzle.solution(OK) |
- | -> task1.cli(OK) | + | |
- | -> task2.cli(OK) | + | |
- | -> task3.cli(OK) | + | |
- | ... | + | |
SUCCESSFULLY SUBMITTED | SUCCESSFULLY SUBMITTED | ||
</ | </ | ||
- | You should get some sort of confirmation indicating successful submission | + | or, if submitting results for the bonus puzzle as well: |
+ | |||
+ | < | ||
+ | $ submit unix pct0 puzzle.key puzzle.solution bonus.key bonus.solution | ||
+ | Submitting unix project " | ||
+ | -> puzzle.key(OK) | ||
+ | -> puzzle.solution(OK) | ||
+ | -> bonus.key(OK) | ||
+ | -> bonus.solution(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. | ||
I'll be looking for the following: | I'll be looking for the following: | ||
< | < | ||
- | 78:upf1:final tally of results (78/78) | + | 78:pct0:final tally of results (78/78) |
- | *:upf1:upf1steps has valid list of non-interactive instructions [4/4] | + | *:pct0:puzzle.key file submitted |
- | *: | + | *:pct0:puzzle.key file formatted according |
- | *: | + | *:pct0:puzzle.solution is organized and easy to read [35/35] |
- | *: | + | *:pct0:puzzle.solution |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | *:upf1:upf1steps makes clear, effective use of wildcards [4/4] | + | |
- | *: | + | |
- | *: | + | |
- | *:upf1:upf1steps uses a loop to drive numbers in final output [4/4] | + | |
- | *: | + | |
- | *:upf1:all files are organized, clear, | + | |
- | *:upf1:task#.cli files output using specified precision [3/3] | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
- | *: | + | |
</ | </ | ||
- | |||
- | Additionally: | ||
- | * Solutions not utilizing descriptive why and how comments will be subject to a 25% overall deduction | ||
- | * Solutions not utilizing indentation to promote scope and clarity will be subject to a 25% overall deduction |