Solved

A Two-Level Directory Can Be Thought as a Tree of Height

Question 29

Multiple Choice

A two-level directory can be thought as a tree of height _________

A) 2 and its root is UFD
B) 1 and its root is MFD
C) 2 and its root is MFD
D) 1 and its root is UFD

Related Questions

Q24: In the case of UNIX, where sharing

Q25: What are the differences between per-process open-file

Q26: IBM's indexed sequential access method (ISAM)_.<br>A) uses

Q27: Acyclic-graph directory structure_<br>A) prohibits the sharing of

Q28: File's _ is a unique tag identifies

Q30: The current directory is<br>A) always included in

Q31: Writes to the file mapped in memory

Q32: What is the internal representation of a

Q33: All operating systems have to support at

Q34: What is the main disadvantage of having