Operating Systems

star goldstar goldstar goldstar goldstar greyFemaleMale
10 Questions - Developed by: - Developed on: - 2,164 taken

Exam 2

  • 1
    Multiprogramming allows multiple processes to run at the same time.
  • 2
    Process execution consists of a cycle of CPU execution and I/O wait.
  • 3
    Deadlock can arise if the three conditions hold simultaneously: mutual exclusion, hold and wait, and no preemption.

  • 4
    If a resource allocation graph contains no cycles, there is no deadlock.
  • 5
    If a resource allocation graph contains a cycle, there is a deadlock.
  • 6
    A pair of base and limit registers define the logical address space.

  • 7
    Virtual memory can be implemented via demand paging.
  • 8
    Copy-on-write (COW) allows both parent and child processes to initially share the same pages in memory.
  • 9
    The least recently used algorithm is the optimal page replacement algorithm.
  • 10
    Page faults happen when there are no free frames.

Comments (0)