OS File Management And I/O Management Quiz

20 Questions | Total Attempts: 532

SettingsSettingsSettings
Please wait...
OS File Management And I/O Management Quiz


Questions and Answers
  • 1. 
    A basic element of data in a file is .....................
    • A. 

      Memory

    • B. 

      Record

    • C. 

      Field

    • D. 

      Value

  • 2. 
    Records are treated as a unit.
    • A. 

      True

    • B. 

      False

  • 3. 
    __________________ refers to the logical structuring of records.
    • A. 

      Physical organisation

    • B. 

      Logical organisation

    • C. 

      Structural organisation

    • D. 

      File Organisation

  • 4. 
    In the ……………………… file organization, data are collected in the order in which they arrive where each record consists of one burst of data.
    • A. 

      Pile

    • B. 

      Sequential

    • C. 

      Indexed Sequential

    • D. 

      Indexed

  • 5. 
    The ……………………… maintains the key characteristic of the sequential file: Records are organized in sequence based on a key field.
    • A. 

      Pile

    • B. 

      Sequential

    • C. 

      Indexed Sequential

    • D. 

      Indexed

  • 6. 
    Airline reservation systems and inventory control system are the examples of …………………….. system.
    • A. 

      Pile

    • B. 

      Indexed

    • C. 

      Sequential

    • D. 

      Indexed Sequential

  • 7. 
    The …………………. greatly reduced the time required to access a single record, without sacrificing the sequential nature of the file.
    • A. 

      Pile

    • B. 

      Sequential

    • C. 

      Indexed Sequential

    • D. 

      Indexed

  • 8. 
    In free space management, ………………….. method has negligible space overhead because there is no need for a disk allocation table, merely for a pointer to the beginning of the chain and the length of the first portion.
    • A. 

      Bit tables

    • B. 

      Chained Free Portions

    • C. 

      Indexing

    • D. 

      Free Block List

  • 9. 
    ………………….. is a preallocation strategy, using variable size portions where the file allocation table needs just a single entry for each file, showing the starting block and the length of the file.
    • A. 

      Chained allocation

    • B. 

      Indexed allocation

    • C. 

      Contiguous allocation

    • D. 

      Variable allocation

  • 10. 
    In ………………………….. method, the file allocation table contains a separate one level index for each file, the index has one entry for each portion allocated to the file.
    • A. 

      Chained allocation

    • B. 

      Indexed allocation

    • C. 

      Contiguous allocation

    • D. 

      Variable allocation

  • 11. 
    Typically, ………………… is on an individual block basis where each block contains a pointer to the next block in the chain.
    • A. 

      Chained Allocation

    • B. 

      Indexed Allocation

    • C. 

      Contiguous Allocation

    • D. 

      Variable Allocation

  • 12. 
    In the ______ algorithm, the disk arm starts at one end of the disk and moves toward the other end, servicing requests till the other end of the disk. At the other end, the direction is reversed and servicing continues.
    • A. 

      LOOK

    • B. 

      SCAN

    • C. 

      C-SCAN

    • D. 

      C-LOOK

  • 13. 
    In the _______ algorithm, the disk head moves from one end to the other, servicing requests along the way. When the head reaches the other end, it immediately returns to the beginning of the disk without servicing any requests on the return trip.
    • A. 

      LOOK

    • B. 

      SCAN

    • C. 

      C-SCAN

    • D. 

      C-LOOK

  • 14. 
    In the ______ algorithm, the disk arm goes as far as the final request in each direction, then reverses direction immediately without going to the end of the disk.
    • A. 

      LOOK

    • B. 

      SCAN

    • C. 

      C-SCAN

    • D. 

      C-LOOK

  • 15. 
    The time taken to move the disk arm to the desired cylinder is called the ____________
    • A. 

      Positioning Time

    • B. 

      Seek Time

    • C. 

      Random Access Time

    • D. 

      Rotational Latency

  • 16. 
    The time taken for the desired sector to rotate to the disk head is called ____________
    • A. 

      Positioning Time

    • B. 

      Seek Time

    • C. 

      Rotational Latency

    • D. 

      Random Access Time

  • 17. 
    Which RAID type doesn’t use parity for data protection?
    • A. 

      RAID 1

    • B. 

      RAID 4

    • C. 

      RAID 5

    • D. 

      RAID 6

  • 18. 
    Which one of these is characteristic of RAID 5?
    • A. 

      Distributed parity

    • B. 

      No Parity

    • C. 

      All parity in a single disk

    • D. 

      Double Parity

  • 19. 
    What is the unique characteristic of RAID 6
    • A. 

      Distributed Parity

    • B. 

      Striping

    • C. 

      Two independent distributed parity

    • D. 

      Mirroring

  • 20. 
    SSTF algorithm, like SJF __________ of some requests.
    • A. 

      May cause starvation

    • B. 

      Will cause starvation

    • C. 

      Does not cause starvation

    • D. 

      Causes aging

Back to Top Back to top