Here is the code snippet for it. http://codepad.org/COlqFBbR
let me know if you have any questions. Anand On Fri, May 28, 2010 at 12:37 PM, Atul Kumar <[email protected]> wrote: > Sorry the example should be > > file1 = sec2 -> sec7->sec9 -> sec11 -> null > file2 = sec10 -> sec12-> null > > as first sector contains the file information. > > google don't hear DFS or linear parsing, give me the code ;) > > On May 27, 11:28 am, Atul Kumar <[email protected]> wrote: > > There is a file system on the disc. the disc has many sectors. Always > > the first sector has the information about all the files. > > > > A file data is divided into sectors. Each sector can have data from a > > single file. > > > > Each sector has 2 parts, data and the pointer to the next sector of > > the file. Every last sector in the file has next pointer as null. > > > > say a disk has 18 sectors numbered 1 to 18. > > > > then the first sector would have this information about the file. > > > > file1 = sec1 -> sec7->sec9 -> sec11 -> null > > file2 = sec10 -> sec12-> null > > > > etc. > > > > Now the first sector has some error. write an algo to reconstruct the > > file information in the first sector. > > Write code in C. > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
