Differences

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

--- haas:fall2015:data:projects:dlt0 [2015/12/03 13:13] – [In inc/data.h] wedge
+++ haas:fall2015:data:projects:dlt0 [2015/12/16 15:22] (current) – external edit 127.0.0.1
@@ Line 6: / Line 6: @@
 ~~TOC~~
-======Project: DLT0======
+======Project: Tree part of EOCE0======
 =====Errata=====
@@ Line 13: / Line 13: @@
   * __revision 1__: Makefile fixes and unit test typo fixes (20151201)
   * __revision 2__: another unit test typo fix-- things should compile now (20151201)
+  * __revision 3__: app/list/Makefile had a typo (20151205)
+  * __revision 4__: traverse unit tests had a typo (20151208)
+  * __revision 5__: traverse unit tests had another typo (20151216)
 =====Objective=====
@@ Line 85: / Line 86: @@
     uc    max_height;                   // max height of tree (0 = unlimited)
 };
-typedef struct tree    Tree;
 code_t mktree    (Tree **, uc        ); // create new tree
@@ Line 93: / Line 93: @@
 code_t addnode   (Tree **, Node *    ); // add given node to tree
 code_t grabnode_r(Tree **, Node **   ); // get node from tree (recursive)
+code_t traverse_i(Tree  *, List **,uc); // traverse tree by mode (iterative)
 code_t traverse_r(Tree  *, List **,uc); // traverse tree by mode (recursive)
+code_t traverse_s(Tree  *, List **,uc); // traverse tree by mode (stacks)
 code_t searchtree(Tree  *, Node **,sc); // find node in tree (by value)
@@ Line 99: / Line 101: @@
 #endif
 </code>
 ====tree library====
@@ Line 109: / Line 110: @@
 To make your life easier, I recommend implementing tree library functions in the following order:
-  - **mktree()**
   - **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()**, and **rmtree()** could take advantage of **traverse_r()** and **searchtree()** and **grabnode_r()**).
-Note that **grabnode_r()** can be implemented earlier, as it only really needs **mktree()**, but you may find its implementation more involved.
 ====Tree library unit tests====
-In **testing/tree/unit/**, you will //eventually// find these files:
+In **unit/tree/**, you will //eventually// find these files:
   * **unit-addnode.c** - unit test for the various **addnode()** library function
-  * **unit-searchtree.c** - unit test for the various **searchtree()** 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 test for the **mktree()** library function
-  * **unit-cptree.c**   - unit test for **cptree_r()** library function
-  * **unit-rmtree.c**   - unit test for **rmtree()** library function
-  * **unit-traverse.c** - unit test for **traverse_r()** library function
 **NOTE**: At the time of project release, not all unit tests are available/fully functional; so expect some updates.
@@ Line 164: / Line 151: @@
 </cli>
-=====Submission Criteria=====
+=====Submission=====
-To be successful in this project, the following criteria must be met:
+{{page>haas:fall2015:common:submitblurb#DATA&noheader&nofooter}}
-  * 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" comments **MUST** be removed
-      * these "to be implemented" comments, if still present at evaluation time, will result in points being deducted.
-    * Sufficient comments explaining the point of provided logic **MUST** be present
-  * Track/version the source code in a repository
-  * Submit a copy of your source code to me using the **submit** tool (**make submit** will do this) by the deadline.

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools