OS File Management And I/O: Quiz!

20 Questions | Total Attempts: 287

SettingsSettingsSettings
Please wait...
Computer Quizzes & Trivia

In computing terms, IO is the interaction between an information processing system, such as a computer, and the external world, probably a human or different information processing system. At the same time, OS file management is the organization of data. Take this quiz to test your knowledge about IO and file management.


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

      Memory

    • B. 

      Record

    • C. 

      Value

    • D. 

      Field

  • 2. 
    A basic element of data in a file is:
    • A. 

      Memory

    • B. 

      Record

    • C. 

      Value

    • D. 

      Field

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

      Physical organization

    • B. 

      Logical organization

    • C. 

      Structural organization

    • D. 

      File organization

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

      True

    • B. 

      False

  • 5. 
    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

    • D. 

      Indexed Sequential

  • 6. 
    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

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

      Sequential file

    • B. 

      Indexed file

    • C. 

      Indexed Sequential file

    • D. 

      None of the above

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

      Indexed file

    • B. 

      Sequential

    • C. 

      Indexed Sequential

    • D. 

      B and c

  • 9. 
    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. 

      Indexing

    • B. 

      Free Block List

    • C. 

      Chained Free portions

    • D. 

      Bit tables

  • 10. 
    ………………….. 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

  • 11. 
    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. 

      Contiguous allocation

    • B. 

      Chained Allocation

    • C. 

      Indexed Allocation

    • D. 

      Variable Allocation

  • 12. 
    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. 

      A and b

  • 13. 
    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. 

      C-SCAN

    • C. 

      SCAN

    • D. 

      C-LOOK

  • 14. 
    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

  • 15. 
    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-LOOK

    • D. 

      C-SCAN

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

      Random Access Time

    • B. 

      Positioning Time

    • C. 

      Seek Time

    • D. 

      Rotational Latency

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

      Positioning Time

    • B. 

      Access Time

    • C. 

      Seek Time

    • D. 

      Rotational Latency

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

      RAID 1

    • B. 

      RAID 4

    • C. 

      RAID 6

    • D. 

      RAID 5

  • 19. 
    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

  • 20. 
    What is the unique characteristic of RAID 6?
    • A. 

      Distributed Parity

    • B. 

      Striping

    • C. 

      Two Independent Distributed Parity

    • D. 

      Mirroring

Back to Top Back to top