Corning Community College
CSCS2320 Data Structures
To continue our journey on doubly-linked data structures, and collaboratively authoring and documenting the project and its specifications.
We continue now delving into the realm of doubly-linked data structures. And we will start by reimplementing some of the same base data structures (specifically, nodes and lists), this project: we start on doubly-linked lists.
To assist with consistency across all implementations, project files for use with this project, along with the integration of the work you did on the last project, is made possible via a special recipe in the Makefile.
Simply go into the project base directory, and run:
lab46:~/src/SEMESTER/DESIG/prevPROJECT$ make upgrade-dll0
You will want to go here to edit and fill in the various sections of the document:
Six functions to make this week:
mklist()
cplist()
append()
display()
insert()
find()
These functions are similar to the ones we made for the singly linked list, in fact, almost identical. The only difference is we haven't made a find() function yet. Only a search() function. Find will either start from lead or a node specified by what is passed in. Other than that, the only difference between the other four functions and the doubly linked version is you have to care for both sides of the nodes. Mainly, changing the left pointer to the node before, if there is one.
*Our task is to ask questions on Discord or in class and document our findings on this wiki page collaboratively, regarding the functionality of this project.
*For anybody interested in editing the wiki page, here is the dokuwiki user guide: https://www.dokuwiki.org/wiki:syntax#basic_text_formatting -Ash
NOTE: mklist() also has a status code of DLL_INVALID, this is not listed inside the mk.c file.
NOTE: If you are finding it difficult to read all of your different check cases (for list null, empty etc.), you can make use of flags that way you can do all of the checks at the top. This might help of you are experiencing incorrect error outputs.
NOTE: For find() please be aware that the foundNode node when not NULL, is in fact where the search should start. For example, if you have a tmp = NULL & then a find(list, 2, tmp) the following will search everything after the 2 that was found: find(list, 2, tmp since tmp is now equal to where the previous 2 was found.
1. Mklist()
2. Append()
3. Insert()
4. Display()
5. Find()
6. Copylist()
Useful tools for debugging issues are gdb and examining the test files themselves. to utilize gdb, run the test program with the gdb command (not make check), with a command that might look like “gdb ./bin/unit-lobtain”. Once in gdb the “run” command with start the program, and “break (line number)” will cause the program to stop at the specified line number. Once you have hit the breakpoint you can use “display (variable name)” to see the value of a variable at every step, “n” to step to the next line, and “continue” to continue running the program until the next breakpoint. Note that if you encounter a seg fault the program will tell the where the seg fault occurs, and you can use “run” again to restart the program.
No output to stdout other than from display() will come from any of the functions. Functions should return status codes specified inside the function commented above your code. These will already be included and listed for you.
Similar to every other week, make clean, make, and make check are essential tosee how your functions are doing. It will be very helpful to check the errors file that's created after running make in order to see what errors you are getting (Recommended to start with the first error). 142 total tests spread amongst all the functions. Mk has 12 tests, cp with 18, append and insert with 36 each, display with 12, and finally find with 28. Test output is split amongst list display, reverse list display, and status codes.
To be successful in this project, the following criteria (or their equivalent) must be met:
Let's say you have completed work on the project, and are ready to submit, you would do the following:
lab46:~/src/SEMESTER/DESIG/PROJECT$ make submit
You should get some sort of confirmation indicating successful submission if all went according to plan. If not, check for typos and or locational mismatches.
I'll be evaluating the project based on the following criteria:
78:dll0:final tally of results (78/78) *:dll0:obtained project by the Sunday prior to duedate [13/13] *:dll0:clean compile, no compiler messages [13/13] *:dll0:implementation passes unit tests [13/13] *:dll0:adequate modifications to code from template [13/13] *:dll0:program operations conform to project specifications [13/13] *:dll0:code tracked in lab46 semester repo [13/13]