haas:fall2015:data:projects:dlt0
Differences
This shows you the differences between two versions of the page.
| Next revision | Previous revision | ||
| haas:fall2015:data:projects:dlt0 [2015/05/03 13:58] – external edit 127.0.0.1 | haas:fall2015:data:projects:dlt0 [2015/12/16 15:22] (current) – external edit 127.0.0.1 | ||
|---|---|---|---|
| Line 6: | Line 6: | ||
| ~~TOC~~ | ~~TOC~~ | ||
| - | ======Project: | + | ======Project: |
| =====Errata===== | =====Errata===== | ||
| This section will document any updates applied to the project since original release: | This section will document any updates applied to the project since original release: | ||
| - | * __revision 1__: unit test for **traverse_r()** now available | + | * __revision 1__: Makefile fixes and unit test typo fixes (20151201) |
| - | * __revision 2__: unit tests for **cptree_r()** and **rmtree()** now available | + | * __revision 2__: another |
| - | * __revision | + | |
| - | + | | |
| + | * __revision | ||
| =====Objective===== | =====Objective===== | ||
| Line 53: | Line 53: | ||
| Here we see some additional status code defines: | Here we see some additional status code defines: | ||
| - | <code c 1> | + | <code c 105> |
| - | // Status codes for the tree implementation | + | ////////////////////////////////////////////////////////////////////// |
| + | // | ||
| + | // Status codes for the doubly linked | ||
| // | // | ||
| - | # | + | # |
| - | # | + | # |
| - | # | + | # |
| - | # | + | # |
| - | # | + | # |
| - | # | + | # |
| - | # | + | # |
| + | # | ||
| </ | </ | ||
| - | I also created the typedefs **sc** and **uc** to simplify the declaration of **signed char**s and **unsigned char**s (respectively). These can me seen just above the bottom of the file. | + | I also created the typedefs **sc** and **uc** to simplify the declaration of **signed char**s and **unsigned char**s (respectively). These can me seen in the typedef stanza. |
| ====In inc/ | ====In inc/ | ||
| Line 83: | Line 86: | ||
| uc max_height; | uc max_height; | ||
| }; | }; | ||
| - | typedef struct tree Tree; | ||
| code_t mktree | code_t mktree | ||
| Line 91: | Line 93: | ||
| code_t addnode | code_t addnode | ||
| code_t grabnode_r(Tree **, Node ** ); // get node from tree (recursive) | code_t grabnode_r(Tree **, Node ** ); // get node from tree (recursive) | ||
| + | code_t traverse_i(Tree | ||
| code_t traverse_r(Tree | code_t traverse_r(Tree | ||
| + | code_t traverse_s(Tree | ||
| code_t searchtree(Tree | code_t searchtree(Tree | ||
| Line 97: | Line 101: | ||
| #endif | #endif | ||
| </ | </ | ||
| - | |||
| ====tree library==== | ====tree library==== | ||
| Line 107: | Line 110: | ||
| To make your life easier, I recommend implementing tree library functions in the following order: | To make your life easier, I recommend implementing tree library functions in the following order: | ||
| - | - **mktree()** | ||
| - **addnode()** | - **addnode()** | ||
| - | - **searchtree()** | + | - **traverse_s()** |
| - | - **traverse_r()** | + | |
| - | - **grabnode_r()** | + | |
| - | - **cptree_r()** | + | |
| - | - **rmtree()** | + | |
| - | + | ||
| - | You will really want the later functions to make use of the earlier functions to facilitate implementation (ie **cptree_r()** will likely want to make use of **traverse_r()** and **addnode()**, | + | |
| - | + | ||
| - | Note that **grabnode_r()** can be implemented earlier, as it only really needs **mktree()**, | + | |
| ====Tree library unit tests==== | ====Tree library unit tests==== | ||
| - | In **testing/tree/unit/**, you will // | + | In **unit/tree/**, you will // |
| * **unit-addnode.c** - unit test for the various **addnode()** library function | * **unit-addnode.c** - unit test for the various **addnode()** library function | ||
| - | | + | * **unit-traverse.c** - unit test for **traverse_s()** library function |
| - | * **unit-grabnode.c** - unit test for **grabnode_r()** library function | + | |
| - | * **unit-mktree.c** | + | |
| - | * **unit-cptree.c** | + | |
| - | * **unit-rmtree.c** | + | |
| - | | + | |
| **NOTE**: At the time of project release, not all unit tests are available/ | **NOTE**: At the time of project release, not all unit tests are available/ | ||
| Line 162: | Line 151: | ||
| </ | </ | ||
| - | =====Submission | + | =====Submission===== |
| - | To be successful in this project, the following criteria must be met: | + | {{page> |
| - | * Project must be submit on time, by the posted deadline. | ||
| - | * As this project is due at the very end of the semester, there is no late window. It is either submitted, or it is not. | ||
| - | * All code must compile cleanly (no warnings or errors) | ||
| - | * all requested functions must be implemented in the related library | ||
| - | * all requested functionality must conform to stated requirements (either on this project page or in comment banner in source code files themselves). | ||
| - | * Executed programs must display in a manner similar to provided output | ||
| - | * output formatted, where applicable, must match that of project requirements | ||
| - | * Processing must be correct based on input given and output requested | ||
| - | * Output, if applicable, must be correct based on values input | ||
| - | * Code must be nicely and consistently indented (you may use the **indent** tool) | ||
| - | * Code must be commented | ||
| - | * Any "to be implemented" | ||
| - | * these "to be implemented" | ||
| - | * Sufficient comments explaining the point of provided logic **MUST** be present | ||
| - | * Track/ | ||
| - | * Submit a copy of your source code to me using the **submit** tool (**make submit** will do this) by the deadline. | ||
haas/fall2015/data/projects/dlt0.1430661480.txt.gz · Last modified: 2015/12/03 13:07 (external edit)
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
