Corning Community College
CSCS2320 Data Structures
Onto Queues! Another very commonly used data structure, we will be building it atop our list.
Don't forget to contribute to project documentation! That helps to ensure everyone is invested in the project.
Our queue, like our stack, will in many ways be a restricted-access list: access with the queue functions will only manipulate the list at certain points, creating a consistency we don't have with full-access lists.
Queues are a First In, Last Out structure (or Last In, First Out), and understanding the value that provides is key to effectively leveraging this data structure.
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-dlq0
You will want to go here to edit and fill in the various sections of the document:
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:
91:dlq0:final tally of results (91/91) *:dlq0:obtained project by the Sunday prior to duedate [6/6] *:dlq0:clean compile, no compiler messages [13/13] *:dlq0:implementation passes unit tests [13/13] *:dlq0:adequate modifications to code from template [26/26] *:dlq0:program operations conform to project specifications [26/26] *:dlq0:code tracked in lab46 semester repo [7/7]