Operating Systems Internal Assessment 2

1234567891011121314
Across
  1. 3. the state in which system can allocate resources to each process in some order and still avoid a deadlock
  2. 5. The base register is also known as
  3. 6. run time mapping from virtual to physical addresses is done by a hardware device called
  4. 10. algorithm dynamically examines the Resource allocation state to ensure that a circular wait condition can never exist.
  5. 12. This can be prevented by defining a linear ordering of resource types
  6. 13. The address generated by the CPU
  7. 14. a technique for overcoming external fragmentation
Down
  1. 1. PTBR-The address of a page table in memory is pointed by
  2. 2. deadlock avoidance algorithm
  3. 4. swaps processes in and out of the memory.
  4. 7. loading a routine only when it is called.
  5. 8. CPU fetches the instruction from memory according to the value of
  6. 9. system call to create the new process in Unix.
  7. 11. If the resources are always preempted from the same process this can occur.