haas:fall2014:data:projects:dls0
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:fall2014:data:projects:dls0 [2014/11/01 19:26] – [Stack library unit tests] wedge | haas:fall2014:data:projects:dls0 [2014/11/19 14:42] (current) – [Errata] wedge | ||
|---|---|---|---|
| Line 11: | Line 11: | ||
| 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 | + | * __revision |
| + | * logic error in **unit-cpstack**, | ||
| + | * changed ending while to do-while loop | ||
| + | * loop conditions were originally (i == 0) && (status != 0), should have been != -1 for both | ||
| + | * missing double newline after certain " | ||
| + | * Some additional aesthetic enhancements to the base Makefile were made. | ||
| + | * __revision 2__: Makefile enhancements to facilitate project usage (20141107) | ||
| + | * test reference implementation feature enhancements | ||
| + | * a slight change to the option to enable (**make use-test-reference**) | ||
| + | * a new option to restore your own code (**make use-your-own-code**) | ||
| + | * **src/ | ||
| + | * **testing/ | ||
| + | * __revision 3__: verify-stack.sh enhancements (20141119) | ||
| + | * now includes absolute totals | ||
| =====Objective===== | =====Objective===== | ||
| Line 73: | Line 86: | ||
| * **peek**: the ability to gain access to the top node without removing it from the stack | * **peek**: the ability to gain access to the top node without removing it from the stack | ||
| * **is the stack empty?**: the ability to query the stack and determine if it is empty or non-empty (or perhaps if non-empty, how full is it?) | * **is the stack empty?**: the ability to query the stack and determine if it is empty or non-empty (or perhaps if non-empty, how full is it?) | ||
| - | * **purge**: the ability to empty/clear out the stack | ||
| While we may be implementing these supplemental functions, it should be noted that not only are they in no way necessary for using a stack, they could be detrimental (just as relying on **qty** in the sll projects was), as one could rely on them as a crutch. | While we may be implementing these supplemental functions, it should be noted that not only are they in no way necessary for using a stack, they could be detrimental (just as relying on **qty** in the sll projects was), as one could rely on them as a crutch. | ||
| Line 212: | Line 224: | ||
| Again, your stack is to utilize the stack for its underlying data storage operations. This is what the stack' | Again, your stack is to utilize the stack for its underlying data storage operations. This is what the stack' | ||
| + | ====Reference Implementation==== | ||
| + | As the layers and complexities rise, narrowing down the source of errors becomes increasingly important. | ||
| + | |||
| + | If your stack push() isn't working, is it because of a problem in push()? Or might it be in an underlying list operation it relies upon? Or perhaps even the lowest-level node functions.. | ||
| + | |||
| + | To aid you in your development efforts, you now have the ability to import a functioning node and list implementation into your project for the purposes of testing your stack functionality. | ||
| + | |||
| + | This also provides another opportunity for those who have fallen behind to stay current, as they can work on this project without having needed to successfully get full list functionality. | ||
| + | |||
| + | ===Using the test reference implementation=== | ||
| + | You'll notice that, upon running **make help** in the base-level Makefile, the following new options appear (about halfway in the middle): | ||
| + | |||
| + | <cli> | ||
| + | ** ** | ||
| + | ** make use-test-reference | ||
| + | ** make use-your-own-code | ||
| + | ** ** | ||
| + | </ | ||
| + | |||
| + | In order to make use of it, you'll need to run **make use-test-reference** from the base of your **dls0** project directory, as follows: | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | make[1]: Entering directory '/ | ||
| + | make[2]: Entering directory '/ | ||
| + | rm -f *.swp *.o append.o cp.o display.o insert.o mk.o obtain.o rm.o search.o sort.o swap.o core | ||
| + | make[2]: Leaving directory '/ | ||
| + | make[2]: Entering directory '/ | ||
| + | rm -f *.swp *.o cp.o mk.o rm.o core | ||
| + | make[2]: Leaving directory '/ | ||
| + | make[2]: Entering directory '/ | ||
| + | rm -f *.swp *.o cp.o isempty.o mk.o peek.o pop.o push.o rm.o core | ||
| + | make[2]: Leaving directory '/ | ||
| + | make[1]: Leaving directory '/ | ||
| + | make[1]: Entering directory '/ | ||
| + | make[2]: Entering directory '/ | ||
| + | make[3]: Entering directory '/ | ||
| + | rm -f *.swp *.o ../ | ||
| + | make[3]: Leaving directory '/ | ||
| + | make[2]: Leaving directory '/ | ||
| + | make[2]: Entering directory '/ | ||
| + | make[3]: Entering directory '/ | ||
| + | rm -f *.swp *.o ../ | ||
| + | make[3]: Leaving directory '/ | ||
| + | make[2]: Leaving directory '/ | ||
| + | make[2]: Entering directory '/ | ||
| + | make[3]: Entering directory '/ | ||
| + | rm -f *.swp *.o ../ | ||
| + | make[3]: Leaving directory '/ | ||
| + | make[3]: Entering directory '/ | ||
| + | rm -f *.swp *.o ../ | ||
| + | make[3]: Leaving directory '/ | ||
| + | make[2]: Leaving directory '/ | ||
| + | make[1]: Leaving directory '/ | ||
| + | NODE and LIST reference implementation in place, run ' | ||
| + | lab46: | ||
| + | </ | ||
| + | |||
| + | You'll see that final message indicating everything is in place (it automatically runs a **make clean** for you), and then you can go ahead and build everything with it: | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | ... | ||
| + | </ | ||
| + | |||
| + | **__Debugging__: | ||
| + | |||
| + | ===Reverting back to using your code=== | ||
| + | If you were trying out the reference implementation to verify stack functionality, | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | Local node/list implementation restored, run 'make clean; make' to build everything. | ||
| + | lab46: | ||
| + | </ | ||
| ====List Library unit tests==== | ====List Library unit tests==== | ||
| As a result of the required changes to **display()** and the incorporation of **qty**, pertinent list unit tests will be enhanced, so you can make use of them to ensure implementation compliance. | As a result of the required changes to **display()** and the incorporation of **qty**, pertinent list unit tests will be enhanced, so you can make use of them to ensure implementation compliance. | ||
| + | Be sure to run the various list unit tests and verification scripts to see which functions have fallen out of compliance with the list struct specification changes issued in this project. The **verify-list.sh** script can be especially useful in getting a big picture view of what work is needed. | ||
| ====Stack library unit tests==== | ====Stack library unit tests==== | ||
| In **testing/ | In **testing/ | ||
| Line 254: | Line 342: | ||
| Note this is a DIFFERENT approach than you would have taken in the program with sll2- you're to use stack functionality to aid you with the heavy lifting. While you will still make use of list functionality for grabbing the initial input, the actual palindrome comparison processing needs to heavily involve stacks. | Note this is a DIFFERENT approach than you would have taken in the program with sll2- you're to use stack functionality to aid you with the heavy lifting. While you will still make use of list functionality for grabbing the initial input, the actual palindrome comparison processing needs to heavily involve stacks. | ||
| + | |||
| + | =====Expected Results===== | ||
| + | To assist you in verifying a correct implementation, | ||
| + | |||
| + | ====node library==== | ||
| + | Here is what you should get for node: | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | ==================================================== | ||
| + | = Verifying Doubly-Linked Node Functionality | ||
| + | ==================================================== | ||
| + | [mknode] Total: | ||
| + | [cpnode] Total: | ||
| + | [rmnode] Total: | ||
| + | ==================================================== | ||
| + | | ||
| + | ==================================================== | ||
| + | lab46: | ||
| + | </ | ||
| + | |||
| + | As no coding changes were needed in the node library, these results should be identical to that of a fully functioning node implementation from the **dll0** project. | ||
| + | |||
| + | ====list library==== | ||
| + | Here is what you should get for list: | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | ==================================================== | ||
| + | = Verifying Doubly-Linked List Functionality | ||
| + | ==================================================== | ||
| + | [mklist] Total: | ||
| + | [cplist] Total: | ||
| + | [rmlist] Total: | ||
| + | [append] Total: | ||
| + | [insert] Total: | ||
| + | [obtain] Total: | ||
| + | | ||
| + | [findnode] Total: | ||
| + | [sortlist] Total: | ||
| + | [swapnode] Total: | ||
| + | ==================================================== | ||
| + | | ||
| + | ==================================================== | ||
| + | lab46: | ||
| + | </ | ||
| + | |||
| + | Due to the re-introduction of **qty** into list (impacting actions performed by **mklist()**, | ||
| + | |||
| + | Remember though- aside from the minor change of adding **qty** and enhancing **display()**, | ||
| + | |||
| + | ====stack library==== | ||
| + | Here is what you should get for stack: | ||
| + | |||
| + | <cli> | ||
| + | lab46: | ||
| + | =================================================== | ||
| + | = | ||
| + | =================================================== | ||
| + | [mkstack] Total: | ||
| + | [cpstack] Total: | ||
| + | [rmstack] Total: | ||
| + | | ||
| + | [pop] Total: | ||
| + | | ||
| + | [isempty] Total: | ||
| + | =================================================== | ||
| + | [RESULTS] Total: 106, Matches: 106, Mismatches: | ||
| + | =================================================== | ||
| + | lab46: | ||
| + | </ | ||
| =====Submission Criteria===== | =====Submission Criteria===== | ||
| To be successful in this project, the following criteria must be met: | To be successful in this project, the following criteria must be met: | ||
haas/fall2014/data/projects/dls0.1414870007.txt.gz · Last modified: 2014/11/01 19:26 by wedge
Page Tools
Except where otherwise noted, content on this wiki is licensed under the following license: CC Attribution-Share Alike 4.0 International
