.......0

Theory – long answer question. Describe how a file system could be implemented using a collection of inodes (http://en.wikipedia.org/wiki/Inode) and some variant of a B tree. 500-1000 words. Be sure to consider: unallocated space, bad allocations, lost and found, root directories, sub directories and files. Hint: Unix started out using inodes in an array. Feel free to do diagrams (either by hand and scan them, or on computer) if it would help.