Assignment
(i) Implement the following basic data types. Follow specifications presented in the textbook in full detail.
1. Lists: two implementations, array and pointer (pages 41-46), operations: FIRST, END, RETRIEVE, LOCATE, NEXT, PREVIOUS, INSERT, DELETE, MAKENULL,
2. Stacks: two implementations, array and pointer (pages 53-56), operations: TOP, POP, PUSH, EMPTY, MAKENULL,
(ii) Develop the code for the following timing experiments. Report your results in the form of tables. The first column should indicate the size of the data structure. The remaining columns should report the measured times for the procedures that you apply. Derive conclusions out of your experiments and write them down.
3. Perform time measurements of the following five operations on lists: iterated insertion (in front, at the back), traversal, iterated deletion (in front, at the back). Run each of your procedures on three types of lists: a selected list type library data structure, your implementation of the list ADT with arrays, your implementation of the list ADT with pointers.
4. Perform time measurements of the following two operations on stacks: iterated insertion (PUSH operation), iterated deletion (POP operation). Run each of your procedures on three types of stacks: a selected stack type library data structure, your implementation of the stack ADT with arrays, your implementation of the stack ADT with pointers.
Each student needs to submit four separate programs and a report of timing results of part (ii). Each of the programs should contain test input data and a testing code, which demonstrate that all the operations and algorithms work properly. You will need to submit your code and your report following the submission rules that will be provided at a later date.
The choice of data representation is up to you, but you need to preserve all the essential features of the implementations discussed in the textbook. In particular all actions occurring in textbook implementations have to have their counterparts in your code.
Many interesting examples of C implementations directly transferable into C++ are available on the website accompanying our CS 270 textbook Foundations of Computer Science by Alfred Aho and Jeffrey Ullman.
Text Book: Foundations of Computer Science by Al Aho and Jeff Ullman, C Edition.
Examples of Python code explaining how to substitute pointers by references are discussed in chapters 17,19,20 of the book How to Think Like a Computer Scientist by Allen Downey, Jeffrey Elkner and Chris Meyers.
Text Book: Data Structures and Algorithms by Alfred V. Aho, John E. Hopcroft and Jeffrey D. Ullman.