haas:fall2014:data:projects:dlq0
Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| haas:fall2014:data:projects:dlq0 [2014/11/08 13:14] – [Reference Implementation] wedge | haas:fall2014:data:projects:dlq0 [2014/11/19 14:43] (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 |
| + | * **unit-enqueue.c** had a bunch of references to " | ||
| + | * the prototype for **rmqueue()** was missing from the **inc/ | ||
| + | * __revision 2__: unit-mkqueue tweaks and verify-queue.sh enhancements (20141119) | ||
| + | * While I was debugging some code I noticed that the **unit-mkqueue.c** logic was not flexible enough in handling implementations where front was pointing to the end of the list. I have added logic to enable proper checking of back/front, regardless of underlying list orientation (FIXED). | ||
| + | * verify-queue.sh enhanced to show absolute totals, even if improper implementations cause the unit test not to perform the full run. | ||
| =====Objective===== | =====Objective===== | ||
| - | In this project, resume our conceptual journey and explore another data structure: | + | In this project, resume our conceptual journey and explore another data structure: |
| =====Background===== | =====Background===== | ||
| - | A **stack** is considered one of the most important data structures, along with **queues** (next week's project) and trees. And it is largely because of how often we find them playing out in nature or our day-to-day lives. | + | A **queue** is considered one of the most important data structures, along with **stack** (last week's project) and trees. And it is largely because of how often we find them playing out in nature or our day-to-day lives. |
| - | The word "stack" is [[https:// | + | The word "queue" is [[https:// |
| - | + | ||
| - | * (generically): | + | |
| - | * (computing): | + | |
| - | + | ||
| - | Additionally, | + | |
| - | * shuffle or **arrange** (a deck of cards) dishonestly **so as to gain** an unfair **advantage** | + | |
| - | + | ||
| - | Or, to distill it out: | + | |
| - | + | ||
| - | * arrange so as to gain advantage | + | |
| - | + | ||
| - | Combining with our previous definitions, | + | |
| - | + | ||
| - | * a set of storage locations that are arranged in such a way so as to give us an advantage- the most recently stored item (the last to be placed onto the stack) is the first to be retrieved. | + | |
| + | * (generically): | ||
| + | * (computing): | ||
| ====Lists and Nodes==== | ====Lists and Nodes==== | ||
| So, how does all this list and node stuff play into our queue implementation? | So, how does all this list and node stuff play into our queue implementation? | ||
| Line 234: | Line 227: | ||
| ===Reverting back to using your code=== | ===Reverting back to using your code=== | ||
| - | If you were trying out the reference implementation to verify | + | If you were trying out the reference implementation to verify |
| <cli> | <cli> | ||
| Line 273: | Line 266: | ||
| =====Expected Results===== | =====Expected Results===== | ||
| - | To assist you in verifying a correct implementation, | + | 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==== | ====list library==== | ||
| Line 321: | Line 296: | ||
| But aside from this change to **display()**, | But aside from this change to **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: | ||
| - | </ | ||
| ====queue library==== | ====queue library==== | ||
haas/fall2014/data/projects/dlq0.1415452494.txt.gz · Last modified: 2014/11/08 13:14 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
