Select all correct answers regarding directory implementation techniques.
A. In Hierarchal directory* structure, the disk block allocation for directory information and file data are similar. However, the directory
entries are organized in such a way that they allow file system to create subdirectories and files as tree structure,
'B. Linear list' is simple to implement and searching the directory is very fast. It allows for organizing the fles for each user and can
handle hies that have the same names
'C. Hierarchical directory" structure is the most common technique. It allows for grouping file names. having files with the same
sharing files, subdirectories, and file permissions.
[I D. "Hash table" implementation is fast in searching file names in the directory. The collision of different file names can be handled using
cained overtlow nasniD:
