What is the directory implementation

Directory implementation

the selection of directly allocation and directory management significantly affect the efficiency performance and reliability of the file system in this section we discuss the trade of involved in choosing one of these algorithm...

linear list

the simplest method of implementing a directory is to use a liner list of the file name with pointer to the data blocks these method is simple to program but time consuming to Executive two correct a few file be must first search the directory to be sure that no anciting file has the same name...

Hash table another Data

Structure used for a file directly is a hastable hair in linear list store the directly enters but has Data Structure is also use the highest table tags a value computed from the file name and returns a pointer to the file name in the linear list...

allocation method

the Direct Access nature of gives us flexibility in the implementation of files in almost every case many files are storage on the same the same problem is how to allotted his face to these files to that this space if utilise ability and files can be access quietly..