i need to design a solid data store device. the prime use of the data store is to store text messages, with each message being structured as a linked list.
the logical concept of the store will be a continous finite stream of cells, each cell to be capable of storing just one character of a message. any message might occupy one or more blocks of cells. thus the need for a linked list data structure.
in addition to the cells that store the characters of the message, there will be need to store some sort of directory. conceptually, this direcory will have to: define which data cells are available and enable access to each message.
the simulation is to show:
1 messages being entered, retrieved, and deleted
2 the linked list structure at work
3 the dynamic of the directory as the free space changes
4 defragmentation of the data store
[/CENTER]please help me. idon't know where to start
the logical concept of the store will be a continous finite stream of cells, each cell to be capable of storing just one character of a message. any message might occupy one or more blocks of cells. thus the need for a linked list data structure.
in addition to the cells that store the characters of the message, there will be need to store some sort of directory. conceptually, this direcory will have to: define which data cells are available and enable access to each message.
the simulation is to show:
1 messages being entered, retrieved, and deleted
2 the linked list structure at work
3 the dynamic of the directory as the free space changes
4 defragmentation of the data store
[/CENTER]please help me. idon't know where to start