Advantages and disadvantages of tree-structured directories are that in the tree-structured directory, the directory themselves are files. This leads to the possibility of having sub-directories that can contain files and sub-subdirectories. As an interesting strategy decision in a tree- structured directory structure is how to handle the deletion of a directory. If a directory is empty, its entry in its containing directory can simply be deleted. However, suppose the directory to be deleted is not empty, but contains several files, or possibly sub-directories. Some systems will not delete a directory unless it is empty. However, to delete a directory, someone must first delete all the files in that directory. If are any sub-directories, this procedure must be applied recursively to them, so that they can be deleted also. This approach may result in an insubstantial amount of work. An alternative approach is just to assume that, when a request is made to delete a directory, all of that directory's files and subdirectories are also to be deleted.
The flat file system files in an is an organization of
in which all files are stored in a single directory. In contrast to a
hierarchical file system, in which there are directories and subdirectories and different files can have the same name as long as they are stored in different directories, in a flat file system every file must have a different name because there is only one list of files. Early versions of the Macintosh and DOS operating systems used a flat file system. In addition, flat file system require a lot of time for exploring files, change permissions in a flat filesystem, for part of the files, is not possible all at once - it needs changes on each individual files permissions, and may take seconds or minutes while the permissions are unclear and changing.
My personal preference will go with the MAC OS which applies the HFS+ file system. Which use the hierarchical system, this because the simplicity and the introduction of this technology to our generation, is more organized than it seems to be a flat file system when in the old days was. Since each folder has their own name file and path created make this simple and easier to find and explore an OS system. Also, the security issues that this might cause in an OS with the concerns of configuration, partitioning, compatibility. Among other characteristics that I prefer the hierarchical system are such the convenience of the new features that offers in comparison with the old flat systems, such as security, network connection, USB ports, CD ROM, etc. this by far is a more complete and diverges above the previous systems.
Reference:
TestOut. (2015). Linux Pro. Utah: Author. Retrieved from www.testout.com Chapter 4, “User Interfaces and Desktops”
Chapter 7, “Disk and File System Management”
Red Hat, Customer Portal. (2014). Chapter 9: Network file system (NFS). In Red Hat Enterprise Linux 4: Reference guide. Retrieved from http://docs.redhat.com/docs/en- US/Red_Hat_Enterprise_Linux/4/html/Reference_Guide/ch-nfs.html
Question : Expanding on the described strength or weakness of the tree-structured directory or by describing additional strengthens or weaknesses.
Step by stepSolved in 2 steps
- Objective Define a circular buffer data structure and test it. Problem Description: A circular buffer (also called a circular queue) is circular list of nodes where data items are added on one end of the buffer and removed from the other end. Because the nodes form a circular list, the list has no end or beginning: the tail node points to the head node, creating a ring of nodes. You may think of the nodes as containers or slots that are all initially empty but can be assigned a value in their data field info. Every time a new data item is inserted (inserting to a buffer is often referred as Writing), one slot is filled and the buffer has one less empty slot. Every time a data item is removed (referred to as Reading), the buffer has one more empty slot. Since the list has no beginning and no end, a pointer (writeIndex) is used to mark the next empty slot to write to and a second pointer (readIndex) is used to mark the next node to read from. The readIndex/writeIndex must be…arrow_forwardCompare and contrast the different types of linked lists, highlighting their advantages and disadvantages in terms of memory usage and operations like insertion and deletion.arrow_forwardCreate a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts to re-insert such components.Create a queue-like data type that only permits one insert per element. Use an existence symbol table to keep track of all items that have ever been inserted, and deny attempts…arrow_forward
- Computer Networking: A Top-Down Approach (7th Edi...Computer EngineeringISBN:9780133594140Author:James Kurose, Keith RossPublisher:PEARSONComputer Organization and Design MIPS Edition, Fi...Computer EngineeringISBN:9780124077263Author:David A. Patterson, John L. HennessyPublisher:Elsevier ScienceNetwork+ Guide to Networks (MindTap Course List)Computer EngineeringISBN:9781337569330Author:Jill West, Tamara Dean, Jean AndrewsPublisher:Cengage Learning
- Concepts of Database ManagementComputer EngineeringISBN:9781337093422Author:Joy L. Starks, Philip J. Pratt, Mary Z. LastPublisher:Cengage LearningPrelude to ProgrammingComputer EngineeringISBN:9780133750423Author:VENIT, StewartPublisher:Pearson EducationSc Business Data Communications and Networking, T...Computer EngineeringISBN:9781119368830Author:FITZGERALDPublisher:WILEY