• C

linked lists and RAM

I'm dealing with folder management. I should have clients which will have folders in tree structure which will in turn have list of records. Now, i should have 2 fields of the records in the RAM as interlinked pointers and do all my operations on them and this will correspondingly change the data in the secondary memory which it is pointing to. Once I power off my system, I will lose my pointers. But if i lose my pointers, that means I have lost my sorted list of reference also, as data in secondary memory won't be sorted and it is only the pointers which will undergo every operation. What should I do to get back my list of pointers with the latest modified status with the above mentioned requirements?
motianAsked:
Who is Participating?
 
Kent OlsenData Warehouse Architect / DBACommented:

Hi motian,

Are you writing an operating system where the process that you mention will be THE definitive entity that manages the folders, or are you writing a program that will run underneath another operating system to manage these folders?

If you are writing your own operating system, this data will have to be flushed back to disk on a regular basis to keep the "real" copy and your table synchronized.  I refer to the disk copy as "real" since it is the only thing that is preserved across boots.


In either case, whenever your program starts up, it needs to scan the directory and build your tables.

Kent
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.

All Courses

From novice to tech pro — start learning today.