Lab46 Wiki

User Tools

Site Tools

You are here: start » haas » spring2015 » data » projects » sll1
haas:spring2015:data:projects:sll1

Differences

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

Link to this comparison view

Both sides previous revisionPrevious revision
Next revision		Previous revision
haas:spring2015:data:projects:sll1 [2015/02/21 14:09] – [Objective] wedgehaas:spring2015:data:projects:sll1 [2015/03/10 12:28] (current) – [list library] wedge
Line 16: Line 16:
 We've commenced on our list explorations, implementing some of the core functionality (adding nodes to a list through insertion) as well as some helper functionality to make our list transactions even more effective (creating, displaying, getting node positions, and setting node positions). We've commenced on our list explorations, implementing some of the core functionality (adding nodes to a list through insertion) as well as some helper functionality to make our list transactions even more effective (creating, displaying, getting node positions, and setting node positions).
  
-In this project, we continue our list implementation by exploring the appending of nodes to a list, searching for nodes within a list, copying a list, and displaying a list in reverse.+In this project, we continue our list implementation by exploring the appending of nodes to a list, searching for nodes within a list, copying a list, displaying a list in reverse, and comparing two lists for equality.
  
 =====Project Overview===== =====Project Overview=====
Line 26: Line 26:
  
 <code c> <code c>
-Node *searchlist(List *, int);          // locate node containing value +List *append(List *, Node *, Node *);   // append new node into list after specified place 
-List *obtain (List *, Node **       );  // obtain/disconnect node from list +Node *searchlist(List *, int);          // is there a node containing value in list? 
-List *rmlist(List *);                   // remove all nodes from list +List *cplist(List *);                   // duplicate existing list 
-List *swapnode(List *, Node *, Node *); // swap positions of given nodes in list+void displayb(List *, int);             // display list backwards 
 +int compare(List *, List *);            // compare two lists for equality 
 </code> </code>
  
-As a suggestion, I'd recommend implementing them in the order listed above, starting with **searchlist()** and then **obtain()**. By doing this, you get to review a bit from the previous weeks (**searchlist()**) and then continue with base functionality (**obtain()**), which will help you in your implementation of the other functions.+As a suggestion, I'd recommend implementing them in the order listed above, starting with **append()** and then **searchlist()**. By doing this, you get to review a bit from the previous weeks before you continue with base functionality, which will help you in your implementation of the other functions.
  
 An important perspective to keep when implementing these list functions is to be mindful of what functionality can be a unit of something else. Do not reinvent the wheel- utilize functions you've written- it will shorten your code, and reduce the chance of error. Plus, that IS the intent.. to have each function be specific and focused on its particular task; to do one thing, and do that one thing extremely well. We can then use them as base units to build more sophisticated functionality. An important perspective to keep when implementing these list functions is to be mindful of what functionality can be a unit of something else. Do not reinvent the wheel- utilize functions you've written- it will shorten your code, and reduce the chance of error. Plus, that IS the intent.. to have each function be specific and focused on its particular task; to do one thing, and do that one thing extremely well. We can then use them as base units to build more sophisticated functionality.
  
-In this project, **searchlist()** and **obtain()** are those basic operations, where **rmlist()** and **swapnode()** can be build using various functions you'll be writing in this project and in previous projects.+In this project, **append()** can be considered that basic operation, where **cplist()** can be built using **append()** (along with any other list/node functions from this and previous projects).
  
 ====list library==== ====list library====
-In **src/list/**, you will find 4 new C files:+In **src/list/**, you will find 5 new C files:
  
-  * **obtain.c**   - which will house the list obtain function (to disconnect nodes from a list) +  * **append.c**   - which will house the append function 
-  * **rm.c**       - which will handle clearing the list +  * **cp.c**       - which will house the list copy function
   * **search.c**   - which will house the list search function   * **search.c**   - which will house the list search function
-  * **swap.c**     - which will handle swapping two nodes within a list+  * **displayb.c** - which will handle displaying the list backwards 
 +  * **compare.c**  - which will handle comparing two lists for equality
  
-Take a look at the code there. These are the files that contain functions which will be compiled and archived into the node library (**liblist.a**) we will be using in this and future projects.+Take a look at the code there. These are the files that contain functions which will be compiled and archived into the list library (**liblist.a**) we will be using in this and future projects.
  
 Figure out what is going on, make sure you understand it. Figure out what is going on, make sure you understand it.
Line 57: Line 60:
 In **testing/list/unit/**, you will find these new files: In **testing/list/unit/**, you will find these new files:
  
-  * **unit-rmlist.c**     - unit test for **rmlist()** library function +  * **unit-append.c**     - unit test for **append()** library function 
-  * **unit-obtain.c**     - unit test for **obtain()** library function+  * **unit-cplist.c**     - unit test for **cplist()** library function
   * **unit-searchlist.c** - unit test for **searchlist()** library function   * **unit-searchlist.c** - unit test for **searchlist()** library function
-  * **unit-swapnode.c**   - unit test for **swapnode()** library function+  * **unit-displayb.c**   - unit test for **displayb()** library function 
 +  * **unit-compare.c**    - unit test for **compare()** library function
  
 These are complete runnable programs (when compiled, and linked against the list library, which is all handled for you by the **Makefile** system in place). These are complete runnable programs (when compiled, and linked against the list library, which is all handled for you by the **Makefile** system in place).
Line 75: Line 79:
     * make sure you understand what is going on     * make sure you understand what is going on
     * ask questions to get clarification!     * ask questions to get clarification!
 +
 +=====Expected Results=====
 +To assist you in verifying a correct implementation, a fully working implementation of the node library and list library (up to this point) should resemble the following:
 +
 +====node library====
 +Here is what you should get for the node library:
 +
 +<cli>
 +lab46:~/src/data/sll1$ bin/verify-node.sh 
 +====================================================
 +=    Verifying Singly-Linked Node Functionality    =
 +====================================================
 + [mknode] Total:   4, Matches:   4, Mismatches:   0
 + [cpnode] Total:   5, Matches:   5, Mismatches:   0
 + [rmnode] Total:   2, Matches:   2, Mismatches:   0
 +====================================================
 +[RESULTS] Total:  11, Matches:  11, Mismatches:   0
 +====================================================
 +lab46:~/src/data/sll1$ 
 +</cli>
 +
 +====list library (so far)====
 +Here is what you should get for all the functions completed so far in the list library (sll0+sll1):
 +
 +<cli>
 +lab46:~/src/data/sll1$ bin/verify-list.sh 
 +======================================================
 +=     Verifying Singly-Linked List Functionality     =
 +======================================================
 +    [mklist] Total:   5, Matches:   5, Mismatches:   0
 +    [insert] Total:  11, Matches:  11, Mismatches:   0
 +  [displayf] Total:   4, Matches:   4, Mismatches:   0
 +    [getpos] Total:   8, Matches:   8, Mismatches:   0
 +    [setpos] Total:   9, Matches:   9, Mismatches:   0
 +    [append] Total:  11, Matches:  11, Mismatches:   0
 +[searchlist] Total:  11, Matches:  11, Mismatches:   0
 +    [cplist] Total:  11, Matches:  11, Mismatches:   0
 +  [displayb] Total:   6, Matches:   6, Mismatches:   0
 +   [compare] Total:   9, Matches:   9, Mismatches:   0
 +======================================================
 +   [RESULTS] Total:  85, Matches:  85, Mismatches:   0
 +======================================================
 +lab46:~/src/data/sll1$ 
 +</cli>
  
 =====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:
  
-  * Code must compile cleanly (no warnings or errors)+  * Project must be submit on time, by the posted deadline. 
 +    * Late submissions will lose 25% credit per day, with the submission window closing on the 4th day following the deadline. 
 +  * All code must compile cleanly (no warnings or errors)
     * all requested functions must be implemented in the related library     * 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   * 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   * Processing must be correct based on input given and output requested
-  * Output must be correct (i.e. the list visualization, where applicable) based on values input+  * 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 nicely and consistently indented (you may use the **indent** tool)
   * Code must be commented   * 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
 +  * Any and all functions written must have, **at most**, 1 **return** statement
 +    * points will be lost for solutions containing multiple return statements in a function.
   * Track/version the source code in a repository   * 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.   * Submit a copy of your source code to me using the **submit** tool (**make submit** will do this) by the deadline.
haas/spring2015/data/projects/sll1.1424527758.txt.gz · Last modified: 2015/02/21 14:09 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
CC Attribution-Share Alike 4.0 International Donate Powered by PHP Valid HTML5 Valid CSS Driven by DokuWiki