COURSE (Software implementation of dynamic lists)

Coursework on the subject of Structures and data processing algorithms.
----------------------------------------------------------------------
Topic: Software implementation of dynamic lists
Program Requirements:
-support combined data structure: each element is basic
structure is the beginning of an auxiliary structure;
-informational components of structure elements are stored separately in
dynamic memory and are addressed by pointers;
-program implementation is performed in the Windows environment using the package
Delphi using standard data display components
or as a console application with a simple dialog.
Typical set of operations:
-adding a new element, both in the main one and in
auxiliary structure;
-deleting a given element as from the main structure
(while removing the entire auxiliary structure), and
from the auxiliary;
-search for a given element;
-Viewing the entire structure.
Content of the explanatory note:
1. Title page
2. Content
3. Statement of the problem (purpose of work, initial data, result, requirements for implementation)
4. Theoretical description of the data structures used with references to literature
5. Description of the general structure of the designed program
6. Verbal description of the logic of the main routines
7. Test results with examples of screen forms
8. References
9. Lists of all subroutines with short comments
----------------------------------------------------------------------
The program is implemented in the Delphi programming environment with window
interface. Finished term paper, archived term paper,
there are sources (Delphi 7) with detailed comments.
Assessment given by the teacher: EXCELLENT.
----------------------------------------------------------------------
PS Use this work as educational material, by the example of which, you
you will be able to develop your own program and hand over the work to the teacher perfectly.