0 Replies - 1257 Views - Last Post: 17 July 2014 - 06:39 PM

#1 lamentofking  Icon User is offline

  • D.I.C Head

Reputation: 0
  • View blog
  • Posts: 172
  • Joined: 03-July 13

Tree Class for Virtual File System?

Posted 17 July 2014 - 06:39 PM

Hello,

I need to simulate a Virtual File System in C++, which I will also give GUI functionality (in other words, I'll be using C++ CLI). I'm having a little trouble designing a class for such a task though...partly because the structure that I believe I need to use (Trees) isn't a class so there aren't any built-in header functions that I can use (unless I missed something and there are). The problem description follows below:

Quote

You are to simulate accessing a virtual file system.

First create three separate "drives" A, B, and C. Each is to have it's own
tree structure with directories and common files. Restrict the number of
files under each directory to no more than five. Each common file is to have
it's own i-node which need contain only filename, extension, and one line of
UNIQUE data (in lieu of a pointer to the data on "disk"). For simplicity,
do not make the depth of any directory tree exceed four levels.

On top of these file systems build a VFS that makes the three separate systems
appear as one big system. All user accesses should be via the VFS through
the v-nodes that are provided. The only functions that the VFS is to provide
is add a new file, delete a file, and "print"(show the one line of data) a
file. You must demonstrate all three operations and show the user's view of
the file structure, as well as, the actual file system structure before and
after each operation.

As before, all commands are to be entered via a GUI except that a data
file may be used to build the initial system (instead of entering the
pieces one file at a time).



So after reading the description I can see that the way to go would be to use Trees...partly because I see the word "node" in the description as well as directory tree. Now I did find some user-defined Binary Search Tree classes implemented around the internet but I couldn't use a BST because each node can only have up to 2 children and I need to be able to have up to five files(children) in a directory. So if a BST node struct is defined as follows:

template class <T>
struct Node
{
 T data
 Node* lhs
 Node* rhs
}




Then for a non-BST node struct can't I just add node pointers inside my struct for as many children I would need in each node? Is there any reason why I shouldn't do that? I didn't want to assume that a non-BST node struct was as simple as adding more pointers.

Is This A Good Question/Topic? 0
  • +

Page 1 of 1