File System Interface Directory Structure MCQ

Test your knowledge with important File System Interface Directory Structure MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more File System Interface Directory Structure MCQs at Bissoy

• When a cycle exists, the reference count maybe non zero, even when it is no longer possible to refer to a directory or file, due to _______
  ক

  the possibility of one hidden reference

  খ

  the possibility of two hidden references

  গ

  the possibility of self referencing

  ঘ

  none of the mentioned
• When keeping a list of all the links/references to a file, and the list is empty, implies that _____________
  ক

  the file has no copies

  খ

  the file is deleted

  গ

  the file is hidden

  ঘ

  none of the mentioned
• The deletion of a link ________ the original file.
  ক

  deletes

  খ

  affects

  গ

  does not affect

  ঘ

  none of the mentioned
• In UNIX, what is a link?
  ক

  a directory entry

  খ

  a pointer to another file or subdirectory

  গ

  implemented as an absolute or relative path name

  ঘ

  all of the mentioned
• With a shared file _____________
  ক

  actual file exists

  খ

  there are two copies of the file

  গ

  the changes made by one person are not reflected to the other

  ঘ

  the changes made by one person are reflected to the other
• A tree structure ______ the sharing of files and directories.
  ক

  allows

  খ

  may restrict

  গ

  restricts

  ঘ

  none of the mentioned
• When two users keep a subdirectory in their own directories, the structure being referred to is _____________
  ক

  tree structure

  খ

  cyclic graph directory structure

  গ

  two level directory structure

  ঘ

  acyclic graph directory
• In a tree structure, when deleting a directory that is not empty?
  ক

  The contents of the directory are safe

  খ

  The contents of the directory are also deleted

  গ

  contents of the directory are not deleted

  ঘ

  none of the mentioned
• A relative path name begins at the _____________
  ক

  leaf

  খ

  stem

  গ

  current directory

  ঘ

  root
• An absolute path name begins at the _____________
  ক

  leaf

  খ

  stem

  গ

  current directory

  ঘ

  root
• Which of the following are the types of Path names?
  ক

  absolute & relative

  খ

  local & global

  গ

  global & relative

  ঘ

  relative & local
• The current directory contains, most of the files that are _____________
  ক

  of current interest to the user

  খ

  stored currently in the system

  গ

  not used in the system

  ঘ

  not of current interest to the system
• In the tree structured directories _____________
  ক

  the tree has the stem directory

  খ

  the tree has the leaf directory

  গ

  the tree has the root directory

  ঘ

  all of the mentioned
• What is the disadvantage of the two level directory structure?
  ক

  it does not solve the name collision problem

  খ

  it solves the name collision problem

  গ

  it does not isolate users from one another

  ঘ

  it isolates users from one another
• When a user refers to a particular file?
  ক

  system MFD is searched

  খ

  his own UFD is not searched

  গ

  both MFD and UFD are searched

  ঘ

  every directory is searched
• When a user job starts in a two level directory system, or a user logs in _____________
  ক

  the users user file directory is searched

  খ

  the system’s master file directory is not searched

  গ

  the master file directory is indexed by user name or account number, and each entry points to the UFD for that user

  ঘ

  all of the mentioned
• What will happen in the two level directory structure?
  ক

  each user has his/her own user file directory

  খ

  the system doesn’t its own master file directory

  গ

  all of the mentioned

  ঘ

  none of the mentioned
• The directory can be viewed as a _________ that translates file names into their directory entries.
  ক

  symbol table

  খ

  partition

  গ

  swap space

  ঘ

  cache
• To organise file systems on disk _______________
  ক

  they are split into one or more partitions

  খ

  information about files is added to each partition

  গ

  they are made on different storage spaces

  ঘ

  all of the mentioned