Table of Contents

Corning Community College

CSCS2320 Data Structures

Project: SLL2

Errata

This section will document any updates applied to the project since original release:

Objective

In this project, we complete the node transactions core of our singly-linked list implementation by exploring the remaining functions: obtain(), clearlist(), rmlist(), swapnode(), and sortlist()

Project Overview

For this project, we're going to be implementing the following functions: 

List *obtain (List *, Node **);         // obtain/disconnect node from list
List *clearlist(List *);                // empty an existing list
List *rmlist(List *);                   // deallocate list
List *swapnode(List *, Node *, Node *); // swap positions of given nodes in list
List *sortlist(List *, int);            // sort list (according to mode)

list library

In src/list/, you will find 5 new C files:

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.

List library unit tests

In unit/list/, you will find these new files:

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).

Of particular importance, I want you to take a close look at:

list testing applications

palindrome

Now that we've completed our list functionality, we can use these individual functions to piece together solutions to various everyday problems where a list could be effective. After all, that's a big aspect to learning data structures- they open doors to new algorithms and problem solving capabilities.

Our first endeavor will be that of palindromes (ie words/phrases that, when reversed, spell the same thing).

This implementation will be considered an extra credit opportunity, so as to offer those who have fallen behind (but working to get caught up) a reprieve on some of the credit they've lost.

It is also highly recommended to undertake as it will give you further experience working with these concepts.

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: 

lab46:~/src/data/sll2$ 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/sll2$

list library

Here is what you should get for all the functions completed so far in the list library (sll0+sll1+sll2): 

lab46:~/src/data/sll2$ 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:  15, Matches:  15, Mismatches:   0
    [obtain] Total:  28, Matches:  28, Mismatches:   0
 [clearlist] Total:   3, Matches:   3, Mismatches:   0
    [rmlist] Total:   3, Matches:   3, Mismatches:   0
  [swapnode] Total:   9, Matches:   9, Mismatches:   0
  [sortlist] Total:  27, Matches:  27, Mismatches:   0
======================================================
   [RESULTS] Total: 161, Matches: 161, Mismatches:   0
======================================================
lab46:~/src/data/sll2$

sll2 specific functions

And of course, the make check functionality will show you your current progress on sll2 specifically (be sure to run this and not get distracted by the others). 

lab46:~/src/data/sll2$ make check
======================================================
=    Verifying Singly-Linked  List Functionality     =
======================================================
    [obtain] Total:  28, Matches:  28, Mismatches:   0
 [clearlist] Total:   3, Matches:   3, Mismatches:   0
    [rmlist] Total:   3, Matches:   3, Mismatches:   0
  [swapnode] Total:   9, Matches:   9, Mismatches:   0
  [sortlist] Total:  27, Matches:  27, Mismatches:   0
======================================================
   [RESULTS] Total:  70, Matches:  70, Mismatches:   0
======================================================
lab46:~/src/data/sll2$

Submission

Project Submission

When you are done with the project and are ready to submit it, you simply run make submit: 

lab46:~/src/data/PROJECT$ make submit
...

Submission Criteria

To be successful in this project, the following criteria must be met:

  • Project must be submit on time, by the posted deadline.
    • Early submissions will earn 1 bonus point per full day in advance of the deadline.
      • Bonus eligibility requires an honest attempt at performing the project (no blank efforts accepted)
    • Late submissions will lose 25% credit per day, with the submission window closing on the 4th day following the deadline.
      • To clarify: if a project is due on Wednesday (before its end), it would then be 25% off on Thursday, 50% off on Friday, 75% off on Saturday, and worth 0% once it becomes Sunday.
      • Certain projects may not have a late grace period, and the due date is the absolute end of things.
  • 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).
  • Output generated must conform to any provided requirements and specifications (be it in writing or sample output)
    • output obviously must also be correct based on input.
  • Processing must be correct based on input given and output requested
  • Project header files are NOT to be altered. During evaluation the stock header files will be copied in, which could lead to compile-time problems.
  • Code must compile cleanly.
    • Each source file must compile cleanly (worth 3 total points):
      • 3/3: no compiler warnings, notes or errors.
      • 2/3: one of warning or note present during compile
      • 1/3: two of warning or note present during compile
      • 0/3: compiler errors present (code doesn't compile)
  • Code must be nicely and consistently indented (you may use the indent tool)
    • You are free to use your own coding style, but you must be consistent
    • Avoid unnecessary blank lines (some are good for readability, but do not go overboard- double-spacing your code will get points deducted).
    • Indentation will be rated on the following scale (worth 3 total points):
      • 3/3: Aesthetically pleasing, pristine indentation, easy to read, organized
      • 2/3: Mostly consistent indentation, but some distractions (superfluous or lacking blank lines, or some sort of “busy” ness to the code)
      • 1/3: Some indentation issues, difficult to read
      • 0/3: Lack of consistent indentation (didn't appear to try)
  • Unless fundamentally required, none of your code should perform any inventory or manual counting. Basing your algorithms off such fixed numbers complicates things, and is demonstrative of a more controlling nature.
  • 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.
    • Commenting will be rated on the following scale (worth 3 total points):
      • 3/3: Aesthetically pleasing (comments aligned or generally not distracting), easy to read, organized
      • 2/3: Mostly consistent, some distractions or gaps in comments (not explaining important things)
      • 1/3: Light commenting effort, not much time or energy appears to have been put in.
      • 0/3: No original comments
      • should I deserve nice things, my terminal is usually 90 characters wide. So if you'd like to format your code not to exceed 90 character wide terminals (and avoid line wrapping comments), at least as reasonably as possible, those are two sure-fire ways of making a good impression on me with respect to code presentation and comments.
    • Sufficient comments explaining the point of provided logic MUST be present
  • Code must be appropriately modified
    • Appropriate modifications will be rated on the following scale (worth 3 total points):
      • 3/3: Complete attention to detail, original-looking implementation- also is not unnecessarily reinventing existing functionality
      • 2/3: Lacking some details (like variable initializations), but otherwise complete (still conforms, or conforms mostly to specifications), and reinvents some wheels
      • 1/3: Incomplete implementation (typically lacking some obvious details/does not conform to specifications)
      • 0/3: Incomplete implementation to the point of non-functionality (or was not started at all)
    • Implementation must be accurate with respect to the spirit/purpose of the project (if the focus is on exploring a certain algorithm to produce results, but you avoid the algorithm yet still produce the same results– that's what I'm talking about here).. worth 3 total points:
      • 3/3: Implementation is in line with spirit of project
      • 2/3: Some avoidance/shortcuts taken (note this does not mean optimization– you can optimize all you want, so long as it doesn't violate the spirit of the project).
      • 1/3: Generally avoiding the spirit of the project (new, different things, resorting to old and familiar, despite it being against the directions)
      • 0/3: entirely avoiding.
    • Error checking must be adequately and appropriately performed, according to the following scale (worth 3 total points):
      • 3/3: Full and proper error checking performed for all reasonable cases, including queries for external resources and data.
      • 2/3: Enough error checking performed to pass basic project requirements and work for most operational cases.
      • 1/3: Minimal error checking, code is fragile (code may not work in full accordance with project requirements)
      • 0/3: No error checking (code likely does not work in accordance with project requirements)
  • Any and all non-void functions written must have, at most, 1 return statement
    • points will be lost for solutions containing multiple return statements in a function.
  • Absolutely, positively NO (as in ZERO) use of goto statements.
    • points will most definitely be lest for solutions employing such things.
  • Track/version the source code in a repository
  • Filling out any submit-time questionnaires
  • Submit a copy of your source code to me using the submit tool (make submit will do this) by the deadline.