How the hash table will work,

Hash Table
This hash table is 16 entries big... It can be resized if need be. 
The hash table is used for quick lookup of files when they are asked for. It is much quicker than looking thru the FS.

| 0x00E7 | 0x008E | 0x0015 | 0x00C5 | 0x00D5 | 0x006D | 0x00BB | 0x003C | 0x006A | 0x0040 | 0x0038 | 0x004A | 0x00FA | 0x0064 | 0x001F | 0x00BB |

now. when a file is asked for it will has the directory and filename hashed together (the actual hash algorithm has not been written down yet). 
If the hash ends up being 0x01D2 then you would divide that by the size of the hash table (16 entries = 0x0010) and look at the remainder. 
The remainder is 0x0002. If you look at that entry you see 0x008E. Now all you have to do is jump to that place in the FS and see what file you hit. 
if it is the wrong file then grab the hash pointer in that file and goto the next 1 until you find the file. This is how files are looked up.