Coursework (Software implementation of dynamic lists)

Term paper on the subject of structures and data processing algorithms. -------------------------------------------------- -------------------- Subject: Software implementation of dynamic lists Requirements for the program: -Support the combined data structure: each element main the structure is the beginning of the support structure; -Information constituent elements of the structure are stored separately heap pointer address; software implementation runs in a Windows environment using the package Delphi using standard components displaying data or as a console application with a simple dialog. A typical set of steps: • Add a new element in the main, and in a supporting structure; Deleting a given element, as the basic structure of (Thus remove all supporting structure) and from the auxiliary; -Search given element; -View of the entire structure. The content of the explanatory note: 1. Cover Sheet 2. Content 3. Problem Statement (purpose of the work, the original data, the result, the requirements for implementation) 4. The theoretical description of the data structures used with references to the literature 5. A description of the overall structure of the planned program 6. Verbal description of the logic of the basic routines 7. The test results with examples of screens 8. References 9. Listing of all routines with brief comments -------------------------------------------------- -------------------- The program is implemented in the Delphi programming environment with a window interface. The finished course work in the archive exchange, there are sources (Delphi 7) with detailed comments. Evaluation of the teacher posed: Excellent. -------------------------------------------------- -------------------- PS Do not forget in the course and in the source code of the program to insert, for a place my name, your data, otherwise the teacher will not believe that it is your job.