Allocation Methods MCQ

Test your knowledge with important Allocation Methods MCQ and their applications. These MCQs are beneficial for competitive exams too. Explore 30 + more Allocation Methods MCQs at Bissoy

• Consider a disk where blocks 2, 3, 4, 5, 8, 9, 10, 11, 12, 13, 17, 18, 25, 26 and 27 are free and the rest of the blocks are allocated. Then the free space bitmap would be _____________
  ক

  10000110000001110011111100011111…

  খ

  110000110000001110011111100011111…

  গ

  01111001111110001100000011100000…

  ঘ

  001111001111110001100000011100000…
• For any type of access, contiguous allocation requires ______ access to get a disk block.
  ক

  only one

  খ

  at least two

  গ

  exactly two

  ঘ

  none of the mentioned
• The pointer overhead of indexed allocation is generally _________ the pointer overhead of linked allocation.
  ক

  less than

  খ

  equal to

  গ

  greater than

  ঘ

  keeps varying with
• Indexed allocation _________ direct access.
  ক

  supports

  খ

  does not support

  গ

  is not related to

  ঘ

  none of the mentioned
• Each _______ has its own index block.
  ক

  partition

  খ

  address

  গ

  file

  ঘ

  all of the mentioned
• Contiguous allocation has two problems _________ and _________ that linked allocation solves.
  ক

  external – fragmentation & size – declaration

  খ

  internal – fragmentation & external – fragmentation

  গ

  size – declaration & internal – fragmentation

  ঘ

  memory – allocation & size – declaration
• A section of disk at the beginning of each partition is set aside to contain the table in _____________
  ক

  fat

  খ

  linked allocation

  গ

  hashed allocation

  ঘ

  indexed allocation
• The FAT is used much as a _________
  ক

  stack

  খ

  linked list

  গ

  data

  ঘ

  pointer
• If the extents are too large, then what is the problem that comes in?
  ক

  internal fragmentation

  খ

  external fragmentation

  গ

  starvation

  ঘ

  all of the mentioned
• A better way of contiguous allocation to extend the file size is _____________
  ক

  adding an extent (another chunk of contiguous space)

  খ

  adding an index table to the first contiguous block

  গ

  adding pointers into the first contiguous block

  ঘ

  none of the mentioned
• By using FAT, random access time is __________
  ক

  the same

  খ

  increased

  গ

  decreased

  ঘ

  not affected
• FAT stands for _____________
  ক

  File Attribute Transport

  খ

  File Allocation Table

  গ

  Fork At Time

  ঘ

  None of the mentioned
• What if a pointer is lost or damaged in a linked allocation?
  ক

  the entire file could get damaged

  খ

  only a part of the file would be affected

  গ

  there would not be any problems

  ঘ

  none of the mentioned
• What is the major disadvantage with a linked allocation?
  ক

  internal fragmentation

  খ

  external fragmentation

  গ

  there is no sequential access

  ঘ

  there is only sequential access
• There is no __________ with linked allocation.
  ক

  internal fragmentation

  খ

  external fragmentation

  গ

  starvation

  ঘ

  all of the mentioned
• In the linked allocation, the directory contains a pointer to which block? I. first block II. last block
  ক

  I only

  খ

  II only

  গ

  Both I and II

  ঘ

  Neither I nor II
• When in contiguous allocation the space cannot be extended easily?
  ক

  the contents of the file have to be copied to a new space, a larger hole

  খ

  the file gets destroyed

  গ

  the file will get formatted and lost all its data

  ঘ

  none of the mentioned
• During compaction time, other normal system operations _______ be permitted.
  ক

  can

  খ

  cannot

  গ

  is

  ঘ

  none of the mentioned
• For processes to request access to file contents, they need _____________
  ক

  to run a seperate program

  খ

  special interrupts

  গ

  to implement the open and close system calls

  ঘ

  none of the mentioned
• For each file there exists a ___________ that contains information about the file, including ownership, permissions and location of the file contents.
  ক

  metadata

  খ

  file control block

  গ

  process control block

  ঘ

  all of the mentioned
• Metadata includes _____________
  ক

  all of the file system structure

  খ

  contents of files

  গ

  both file system structure and contents of files

  ঘ

  none of the mentioned
• The file organization module knows about _____________
  ক

  files

  খ

  logical blocks of files

  গ

  physical blocks of files

  ঘ

  all of the mentioned
• A device driver can be thought of like a translator. Its input consists of _____ commands and output consists of _______ instructions.
  ক

  high level, low level

  খ

  low level, high level

  গ

  complex, simple

  ঘ

  low level, complex
• If too little space is allocated to a file _____________
  ক

  the file will not work

  খ

  there will not be any space for the data, as the FCB takes it all

  গ

  the file cannot be extended

  ঘ

  the file cannot be opened
• To solve the problem of external fragmentation ________ needs to be done periodically.
  ক

  compaction

  খ

  check

  গ

  formatting

  ঘ

  replacing memory
• The first fit and best fit algorithms suffer from _____________
  ক

  internal fragmentation

  খ

  external fragmentation

  গ

  starvation

  ঘ

  all of the mentioned
• _______ and ________ are the most common strategies used to select a free hole from the set of available holes.
  ক

  First fit, Best fit

  খ

  Worst fit, First fit

  গ

  Best fit, Worst fit

  ঘ

  None of the mentioned
• One difficulty of contiguous allocation is _____________
  ক

  finding space for a new file

  খ

  inefficient

  গ

  costly

  ঘ

  time taking
• Contiguous allocation of a file is defined by _____________
  ক

  disk address of the first block & length

  খ

  length & size of the block

  গ

  size of the block

  ঘ

  total size of the file
• What is the real disadvantage of a linear list of directory entries?
  ক

  size of the linear list in memory

  খ

  linear search to find a file

  গ

  it is not reliable

  ঘ

  all of the mentioned