Differences

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

--- haas:fall2014:data:projects:sll2 [2014/10/05 20:22] – removed wedge
+++ haas:fall2014:data:projects:sll2 [2014/11/03 12:38] (current) – [Errata] wedge
@@ Line 1: / Line 1: @@
+<WRAP centeralign round box>
+<WRAP><color red><fs 200%>Corning Community College</fs></color></WRAP>
+<WRAP><fs 150%>CSCS2320 Data Structures</fs></WRAP>
+</WRAP>
+~~TOC~~
+======Project: SLL2======
+=====Errata=====
+This section will document any updates applied to the project since original release:
+  * __revision 1__: In anticipation for the release of our next project (**dll0**), I have made some tweaks to the base Makefile to allow for a smoother transition at project upgrade time. (20141026)
+  * __revision 2__: Typo in my original tweak preventing it from working. Now that I've tested it, we have a working solution, and dll0 can now be properly upgraded to... be sure to update before upgrading! (20141027)
+  * __revision 3__: Typo with for loop iterations (one too many) in unit-sortlist... now fixed. It makes a backup copy of the original, should any additional local changes have been made. (20141028)
+  * __revision 4__: Base Makefile aesthetic enhancements (20141103)
+=====Objective=====
+In this project, we wrap up our singly-linked list implementation by exploring the reverse display and sorting of nodes in a list, along with writing a few application programs to see our list in action.
+=====Project Overview=====
+For this project, we're going to be implementing the following functions:
+<code c>
+List *sortlist(List *, int);  // sort list (according to mode)
+void  displayb(List *, int);  // display list in reverse order
+</code>
+====list library====
+In **src/list/**, you will find 2 new C files:
+  * **sort.c**     - which will house the list sort function
+  * **displayb.c** - which will handle displaying the list backwards
+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.
+Figure out what is going on, make sure you understand it.
+====List library unit tests====
+In **testing/list/unit/**, you will find these new files:
+  * **unit-sortlist.c** - unit test for **sortlist()** library function
+  * **unit-displayb.c** - unit test for **displayb()** 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).
+Of particular importance, I want you to take a close look at:
+  * the source code to each of these unit tests
+    * the purpose of these programs is to validate the correct functionality of the respective library functions
+    * follow the logic
+    * make sure you understand what is going on
+    * ask questions to get clarification!
+  * the output from these programs once compiled and ran
+    * analyze the output
+    * make sure you understand what is going on
+    * ask questions to get clarification!
+====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.
+=====Submission Criteria=====
+To be successful in this project, the following criteria must be met:
+  * Project must be submit on time, by the posted deadline.
+    * The late submission window, if any, will be far shorter and once closed, will see no project evaluations done.
+  * Code must compile cleanly (no warnings or errors)
+    * 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
+    * output formatted, where applicable, must match that of project requirements
+  * 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
+  * Code must be nicely and consistently indented (you may use the **indent** tool)
+  * Code must be commented
+    * Any "to be implemented" comments **MUST** be removed
+    * Sufficient comments explaining the point of provided logic **MUST** be present
+  * 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.

Lab46 Wiki

User Tools

Site Tools

Differences

Page Tools