Operating Systems Quiz

23 Questions  I  By Sbreland18
Please take the quiz to rate it.

Operating System Quizzes & Trivia
The multiple choice questions off the final.

  
Changes are done, please start the quiz.


Questions and Answers

Removing question excerpt is a premium feature

Upgrade and get a lot more done!
  • 1. 
    _____ is the dynamic storage-allocation algorithm which results in the largest leftover hole in memory.
    • A. 

      First fit

    • B. 

      Best fit

    • C. 

      Worst fit

    • D. 

      None of the above


  • 2. 
    Consider a logical address with a page size of 8 KB. How many bits must be used to represent the page offset in the logical address?
    • A. 

      10

    • B. 

      8

    • C. 

      13

    • D. 

      12


  • 3. 
    Consider a logical address with 18 bits used to represent an entry in a conventional page table. How many entries are in the conventional page table?
    • A. 

      262144

    • B. 

      1024

    • C. 

      1048576

    • D. 

      18


  • 4. 
    Given the logical address 0xAEF9 (in hexadecimal) with a page size of 256 bytes, what is the page number?
    • A. 

      0xAE

    • B. 

      0xF9

    • C. 

      0xA

    • D. 

      0x00F9


  • 5. 
    Consider a 32-bit address for a two-level paging system with an 8 KB page size. The outer page table has 1024 entries. How many bits are used to represent the second-level page table?
    • A. 

      10

    • B. 

      8

    • C. 

      12

    • D. 

      9


  • 6. 
    In systems that support virtual memory, ____.
    • A. 

      Virtual memory is separated from logical memory.

    • B. 

      Virtual memory is separated from physical memory.

    • C. 

      Physical memory is separated from secondary storage.

    • D. 

      Physical memory is separated from logical memory.


  • 7. 
    Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what is the number of page faults for the given reference string?
    • A. 

      14

    • B. 

      8

    • C. 

      13

    • D. 

      10


  • 8. 
    Suppose we have the following page accesses: 1 2 3 4 2 3 4 1 2 1 1 3 1 4 and that there are three frames within our system. Using the FIFO replacement algorithm, what will be the final configuration of the three frames following the execution of the given reference string?
    • A. 

      4, 1, 3

    • B. 

      3, 1, 4

    • C. 

      4, 2, 3

    • D. 

      3, 4, 2


  • 9. 
    The path name /home/people/os-student/chap10.txt is an example of
    • A. 

      A relative path name

    • B. 

      An absolute path name

    • C. 

      A relative path name to the current directory of /home

    • D. 

      An invalid path name


  • 10. 
    A mount point is _____.
    • A. 

      A root of the file system

    • B. 

      A location of a shared file system

    • C. 

      Only appropriate for shared file systems

    • D. 

      The location within the file structure where the file system is to be attached.


  • 11. 
    The surface of a magnetic disk platter is divided into ____.
    • A. 

      Sectors

    • B. 

      Arms

    • C. 

      Tracks

    • D. 

      Cylinders


  • 12. 
    The SSTF scheduling algorithm ____.
    • A. 

      Services the request with the maximum seek time

    • B. 

      Services the request with the minimum seek time

    • C. 

      Chooses to service the request furthest from the current head position

    • D. 

      None of the above


  • 13. 
    Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 100, 87. Using the SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders?
    • A. 

      116 - 22 - 3 - 11 - 75 - 185 - 100 - 87

    • B. 

      100 - 116 - 185 - 87 - 75 - 22 - 11 - 3

    • C. 

      87 - 75 - 100 - 116 - 185 - 22 - 11 - 3

    • D. 

      100 - 116 - 185 - 3 - 11 - 22 - 75 - 87


  • 14. 
    Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 100, 87. Using the FCFS scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders?
    • A. 

      116 - 22 - 3 - 11 - 75 - 185 - 100 - 87

    • B. 

      100 - 116 - 185 - 87 - 75 - 22 - 11 - 3

    • C. 

      87 - 75 - 100 - 116 - 185 - 22 - 11 – 3

    • D. 

      100 - 116 - 185 - 3 - 11 - 22 - 75 – 87


  • 15. 
    Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 100, 87. Using the SSTF scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders?
    • A. 

      116 - 22 - 3 - 11 - 75 - 185 - 100 - 87

    • B. 

      100 - 116 - 185 - 87 - 75 - 22 - 11 - 3

    • C. 

      87 - 75 - 100 - 116 - 185 - 22 - 11 - 3

    • D. 

      100 - 116 - 185 - 3 - 11 - 22 - 75 – 87


  • 16. 
    Consider a disk queue holding requests to the following cylinders in the listed order: 116, 22, 3, 11, 75, 185, 100, 87. Using the C-SCAN scheduling algorithm, what is the order that the requests are serviced, assuming the disk head is at cylinder 88 and moving upward through the cylinders?
    • A. 

      116 - 22 - 3 - 11 - 75 - 185 - 100 - 87

    • B. 

      100 - 116 - 185 - 87 - 75 - 22 - 11 - 3

    • C. 

      87 - 75 - 100 - 116 - 185 - 22 - 11 - 3

    • D. 

      100 - 116 - 185 - 3 - 11 - 22 - 75 – 87


  • 17. 
    Low-level formatting ____.
    • A. 

      Does not usually provide an error-correcting code

    • B. 

      Is usually performed by the purchaser of the disk device

    • C. 

      Is different from physical formatting

    • D. 

      Divides a disk into sections that the disk controller can read and write


  • 18. 
    Host-attached storage is ____.
    • A. 

      A special purpose storage system that is accessed remotely over a data network

    • B. 

      Not suitable for hard disks

    • C. 

      Accessed via local I/O ports

    • D. 

      Not suitable for use in raid arrays


  • 19. 
    Which of the following disk head scheduling algorithms does not take into account the current position of the disk head?
    • A. 

      FCFS

    • B. 

      SSTF

    • C. 

      SCAN

    • D. 

      LOOK


  • 20. 
    What are the two components of positioning time?
    • A. 

      Seek time + rotational latency

    • B. 

      Transfer time + transfer rate

    • C. 

      Effective transfer rate - transfer rate

    • D. 

      Cylinder positioning time + disk arm positioning time


  • 21. 
    A RAID structure ____.
    • A. 

      Is primarily used for security reasons

    • B. 

      Is primarily used to ensure higher data reliability

    • C. 

      Stands for redundant arrays of inexpensive disks

    • D. 

      Is primarily used to decrease the dependence on disk drives


  • 22. 
    RAID level ____ is the most common parity RAID system.
    • A. 

      0

    • B. 

      0+1

    • C. 

      4

    • D. 

      5


  • 23. 
    Which RAID level is best for storing large volumes of data?
    • A. 

      RAID levels 0 + 1 and 1 + 0

    • B. 

      RAID level 3

    • C. 

      RAID level 4

    • D. 

      RAID level 5


Back to top

Removing ad is a premium feature

Upgrade and get a lot more done!
Take Another Quiz
We have sent an email with your new password.