Corning Community College CSCS2320 Data Structures ~~TOC~~ ======Project: DSI0====== =====Errata===== This section will document any updates applied to the project since original release: * __revision 1__: added some additional output specifications that need to be followed. There will probably be more as time goes by, so keep checking for updates (20160813) * __revision 2__: nice to see people already getting started; I've had a few questions about project specifications I've clarified below, namely: your display function(s), unlike all the others, DO need to perform output. Also, I am looking for discrete append(), insert(), and obtain(), and some sort of display() functions. How you encapsulate the other functionality is left to you (combine forward/reverse? break them into separate functions?). Also, I'd recommend against using ANY global variables. Pass and return them from functions (this will be more in line with how the later projects work) (20160814) * __revision 3__: clarification- all prompts should display to STDERR. Only produced output (such as displaying or showing the obtained value) should go to STDOUT (20160820) * __revision 4__: added the "Verify your Program" section to highlight the availability of the 'projeval' tool (20160827) =====Objective===== In this project, we get started with some course initialization and review activities. =====Project Overview===== ====Course Homepage==== You're reading this, so you've likely already found your way to the course homepage. It consists of the syllabus plus additional course resources. Please familiarize yourself with it, bookmarking important resources as appropriate, so that you can refer back when needed. I'd recommend knowing how to get to the projects page (where you found the link for this project), as new content will be posted there. ====Syllabus==== Be sure to read through and over the syllabus, ensuring there are no questions on the material and organization of the course. ====Journal Intro==== Familiarize yourself with your Journal, and once there: * customize it (title/subtitle) * add an introduction * create your first week content **NOTE:** Week 1 journal entry will be due before Monday of week2, the remainder of the intro Journal content will be due by this project's deadline. ====Mailing List==== Using the resources found on the course homepage (or the lab46 website in general), locate and subscribe a preferred and frequently checked e-mail address to the class mailing list (known as **DATA**). We will use this for class discussions (along with irc, the notes wiki page, your Journal, etc.) and to disseminate announcements and other information. Once subscribed, please send a message to the list introducing yourself (also so I can know to associate a particular e-mail address with you). ====Class Chat (IRC)==== Using the [[/haas/spring2015/common/class_chat|tutorial]], set up a screen session and join the **#csci** channel on irc. This has proven useful for more interactive (debugging!) conversations. Additionally, the C/C++ Programming students will be on this channel, so you could further review your C skills by helping them out. ====Lab46 Shell==== Ensure you can still (or if you are new to this, that you can successfully) log into lab46 via an ssh or mosh client. Lab46 will be the primary and supported development environment for the course. While you are free to use your own systems for any projects not intimately tied to Lab46 or the LAIR, any assigned projects: * MUST be submitted via lab46 (typically via the **submit** tool) * MUST compile, run, and function as required ON lab46 Remember, during open LAIR times you can always come in and use the pods. NOTE that **many** of the projects in this class are heavily tied into Lab46, so you'll want to get used to using it as a development platform. ====Personal/Per-User Lab46 Mercurial Repository==== To both aid you and help you develop better development skills, I'd like for you to make regular commits and pushes to your [[/haas/fall2016/common/repo|Lab46 mercurial repository]]. This way, you can have a regular snapshot of your work as you go along, plus have the ability to grab an older copy should something go wrong. Like the Journal, I will be looking for a minimal amount of repository-related activity PER WEEK (for example, I will be looking for AT LEAST 1 commit in relation to your program for week 1). ====Program to Implement==== As a means of simultaneous review, along with starting to acclimate ourselves to new concepts that we'll be encountering on a regular basis, I'd like for you to implement a program (in C) that does the following: ===menu=== * Presents the user with a menu, having the listed features. * use numbers for input (don't get fancy) * use numbers in for the functionalities given (it will make it easier for me to evaluate) * accept menu and general program input from STDIN (value followed by ENTER). ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> ===build list=== * build list * prompt the user to enter number after number, appending it to the list, until the user terminates the action by entering a -1. Prompt will display to STDERR. * We will check for the -1 in the array to signify the end of our list * if you're crafty about it, this doesn't have to be a unique function, but a loop (even from the menu code) calling an existing function. >>> 0 enter value (-1 to finish): 2 enter value (-1 to finish): 4 enter value (-1 to finish): 6 enter value (-1 to finish): 8 enter value (-1 to finish): -1 ===display list=== * display list forward * From the first (zero-th) element of the array clear through to the element containing the -1, * display the contained numbers, along with their array index. * as output is a core necessity of displaying, your function displaying the list can and should perform output. * I would like to see some sort of **display()** function; you can have a separate one for displaying forward (**displayf()**) and backward (**displayb()**), or one combining both functionalities. I leave that up to you. ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 1 [0] 2 -> [1] 4 -> [2] 6 -> [3] 8 -> [4] -1 * display list backward * From the last element (before the -1) to the beginning * display the contained numbers, along with their array index. * as output is a core necessity of displaying, your function displaying the list can and should perform output. ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 2 [4] -1 -> [3] 8 -> [2] 6 -> [1] 4 -> [0] 2 ===insert=== * insert into list * prompt for array index (prompt will display to STDERR) * accept new value from the user * without destroying any array contents, place new value BEFORE specified array index * this will likely involve shifting a bunch of data down an index * this functionality should be encapsulated in a discrete **insert()** function * avoid using global variables; pass and return necessary data ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 3 Enter index to insert before: 2 Enter value to insert into list: 5 If you were to display the list (forward) after doing this insert, you should have: 2 4 5 6 8 (we inserted the 5 before the current element 2 (containing the 6)). ===append list=== * append into list * prompt for array index (prompt will display to STDERR) * accept new value from the user * without destroying any array contents, place new value AFTER specified array index * this will likely involve shifting a bunch of data down an index * this functionality should be encapsulated in a discrete **append()** function * avoid using global variables; pass and return necessary data ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 4 Enter index to append after: 3 Enter value to append into list: 7 ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 1 [0] 2 -> [1] 4 -> [2] 5 -> [3] 6 -> [4] 7 -> [5] 8 -> [6] -1 ===obtain=== * obtain from list * prompt for array index (prompt will display to STDERR) * obtain value at array index and place it in a standalone variable (to be displayed to STDOUT) * adjust array contents to no longer include this obtained value (we've removed it from the list) * this functionality should be encapsulated in a discrete **obtain()** function * avoid using global variables; pass and return necessary data ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 5 Enter index to obtain: 3 The value you obtained is: 6 ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit >>> 1 [0] 2 -> [1] 4 -> [2] 5 -> [3] 7 -> [4] 8 -> [5] -1 ===clear list=== * clear list * empty the array, leaving it in an initial state (-1 at the 0 index, more places if it messes up your reverse list display) * if you're crafty about it, this doesn't have to be a unique function, but a loop (even from the menu code) calling an existing function. ===quit=== * quit * Each menu item should correspond to a discrete activity you'll be performing on the list or program, and each item is implemented out in separate functions (with the exception of the quit option, although you can if you really want). * Additionally, with the exception of displaying, you should perform no I/O within any of these functions (do it all in main(), or where-ever your core menu logic is located). * basically, when appending, have a function that handles the actual append operation, but do the input and output in/around your menu code (so your append() function basically just manipulates the list). * This list, for now, will be housed within a statically declared integer array (of 20 elements). You are to perform whatever manipulations are needed on that array. * What if you exceed the array? You exceed it... the program may crash and or infinitely loop or otherwise be unpredictable. This program is really just to start you practicing on the important operations of inserting, appending, and obtaining. * A "list" is, for all intents and purposes, a sequence of values located together. They do not have to be sorted, merely considered part of a group or category. Here, we will use the containing features of the array to accomplish that (while simultaneously reviewing C!) ====Further output requirements==== The menu: ====dsi0==== 0. build list 1. display list forward 2. display list backward 3. insert into list 4. append into list 5. obtain from list 6. clear list 7. quit and prompt (note the trailing space after ">>> "): >>> are to go to STDERR, and **NOT** STDOUT. The output from running the various menu options is to go to STDOUT. ===Display arrows=== The display option arrows are to take the form " -> " (note the single space padded both before and after). ===Display values=== The index value is enclosed in square brackets (first one flush against left margin), followed by a space, then the array element (then the padded display arrow). These output specifications play important roles, from facilitated program evaluation to testing how well you can code according to specifications (the latter a very important development skill to have). I may have been more lax in C, but here in Data Structures precision and conformance to requirements will be increasingly important (not only for the scope of the project, but for your own sanity as deviating from it will likely make things far more difficult for you in implementation). Might seem a bit nitpicky, and on some level it is... but on others, a very important learning opportunity for the types of things you'll be encountering in the future. ====Review C==== In addition to writing this program, please be sure you brush up on (at least) the following: * functions (prototypes, definitions, calling, parameters, return types) * structs * pointers =====Verify Your Program===== When your program is functional, you can test it for correctness by using the **projeval** tool on lab46. A series of tests will be run, and you will be able to see if you program is in spec (SUCCESS) or out of spec (MISMATCH). An example of a fully compliant test run follows: lab46:~/src/data/dsi0$ projeval dsi0program [projeval] Evaluating dsi0 for username [test 0] display 4 element populated list forward ... you have: [0] 2 -> [1] 4 -> [2] 6 -> [3] 8 -> [4] -1 should be: [0] 2 -> [1] 4 -> [2] 6 -> [3] 8 -> [4] -1 Result: SUCCESS! [test 1] inserting into empty list ... you have: [0] 7 -> [1] -1 should be: [0] 7 -> [1] -1 Result: SUCCESS! [test 2] appending into empty list ... you have: [0] 7 -> [1] -1 should be: [0] 7 -> [1] -1 Result: SUCCESS! [test 3] obtaining from 1 entry list ... you have: The value you obtained is: 7 should be: The value you obtained is: 7 Result: SUCCESS! [test 4] obtaining first entry from 2 entry list ... you have: The value you obtained is: 7 should be: The value you obtained is: 7 Result: SUCCESS! [test 5] obtaining second entry from 2 entry list ... you have: The value you obtained is: 8 should be: The value you obtained is: 8 Result: SUCCESS! [test 6] inserting before first entry in list ... you have: [0] 6 -> [1] 7 -> [2] -1 should be: [0] 6 -> [1] 7 -> [2] -1 Result: SUCCESS! [test 7] inserting before second entry in list ... you have: [0] 7 -> [1] 8 -> [2] 9 -> [3] -1 should be: [0] 7 -> [1] 8 -> [2] 9 -> [3] -1 Result: SUCCESS! [test 8] appending after last entry in list ... you have: [0] 7 -> [1] 8 -> [2] 9 -> [3] -1 should be: [0] 7 -> [1] 8 -> [2] 9 -> [3] -1 Result: SUCCESS! [test 9] appending after second to last entry in list ... you have: [0] 7 -> [1] 8 -> [2] 9 -> [3] -1 should be: [0] 7 -> [1] 8 -> [2] 9 -> [3] -1 Result: SUCCESS! [test 10] clearing list then appending ... you have: [0] 7 -> [1] -1 should be: [0] 7 -> [1] -1 Result: SUCCESS! [test 11] obtaining second entry from 2 entry list (check list integrity) ... you have: [0] 7 -> [1] -1 should be: [0] 7 -> [1] -1 Result: SUCCESS! [test 12] obtaining first entry from 2 entry list (checking list integrity) ... you have: [0] 8 -> [1] -1 should be: [0] 8 -> [1] -1 Result: SUCCESS! [test 13] obtaining from 1 entry list (checking list integrity) ... you have: [0] -1 should be: [0] -1 Result: SUCCESS! lab46:~/src/data/dsi0$ =====Submission Criteria===== To be successful in this project, the following criteria must be met: * 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 or program * 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, 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 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 * Track/version the source code in your lab46 repository * Submit a copy of your source code to me using the **submit** tool (**make submit** will do this) by the deadline. ====Submit Tool Usage==== Let's say you have completed work on the project, and are ready to submit, you would do the following (assuming you have a program called arraylist.c): lab46:~/src/data/dsi0$ submit data dsi0 arraylist.c Submitting data project "dsi0": -> arraylist.c(OK) SUCCESSFULLY SUBMITTED lab46:~/src/data/dsi0$