projects
projects
Corning Community College
CSCS2320 Data Structures
~~TOC~~
This section will document any updates applied to the project since original release:
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()
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)
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.
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:
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.
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:
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$
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$
When you are done with the project and are ready to submit it, you simply run make submit:
lab46:~/src/data/PROJECT$ make submit ...
To be successful in this project, the following criteria must be met: