OOP: Dynamic turn ordered arrays

Pay with:
i agree with "Terms for Customers"
Sold: 4
Refunds: 0

Uploaded: 31.10.2012
Content: 21031160345980.rar (475,16 kB)


Hirono information about the seller and his items
offlineAsk a question

Seller will give you a gift certificate in the amount of 25 RUB for a positive review of the product purchased..


OOP: Dynamic turn ordered arrays

Subject: Object implementation Container-based composite structure, "Dynamical all ordered arrays"
Objective: To obtain the skills development of object programs, including the creation of their own sets of related classes for object the realization of a specialized container. The container is designed for data storage and processing of information a problem (maintenance tasks specified in the approval of the teacher work theme). The container is a two-tier structure of the data, in which levels are implemented in different ways - on the basis of a static array (continuous implementation), another - dynamically using targeted links (connected implementation).

1. Full implementation of the definition of object classes for all items sold structure: data objects (a must!), Facilities-list items (dynamic implementation), lists of objects, a container object
2. Respect for the principle of encapsulation - classroom use only private property and implementation of the necessary set of access methods
3. The implementation of the class of all the necessary methods: constructors, methods, access properties and methods to add and remove each of the two levels, the search method (if necessary)
4. Ability to save the entire structure in an external file on the back-loading
5. The presence of the module, showing all possible to create a class library and has a convenient user interface window
6. Language and development environment - by choice: Delphi, Java, C ++, C #

The structure of the explanatory note
1. Cover Sheet
2. Table of Contents
3. Problem Statement (purpose of the work, the original data, the expected results, the requirements for implementation)
4. The theoretical description of the data structures used to implement the main algorithms of operations
5. A description of the basic concepts and mechanisms of the PLO
6. Description of the developed classes (object model)
7. The description of the demo module with the characteristic use of standard components
8. Description of the Project
9. Listing of all routines with brief comments
10. References

Additional information

Данные для написания курсовой работы:
1. Информационные объекты - дома с парой свойств (НомерДома и ЧислоКвартир).
2. Дома с помощью упорядоченного (по номерам) массива объединяются в Улицу (свойство - название улицы)
3. Улицы с помощью динамической очереди объединяются в рамках города.

За небольшую доплату возможна доработка под Вашу задачу.

Программа реализована в среде программирования Delphi с оконным интерфейсом. Готовая курсовая работа, в архиве курсовой, находятся исходники (Delphi 7) с подробными комментариями а так же пояснительная записка.


No feedback yet.
1 month 3 months 12 months
0 0 0
0 0 0
Seller will give you a gift certificate in the amount of 25 RUB for a positive review of the product purchased..
In order to counter copyright infringement and property rights, we ask you to immediately inform us at support@plati.market the fact of such violations and to provide us with reliable information confirming your copyrights or rights of ownership. Email must contain your contact information (name, phone number, etc.)