Operating Systems II

1. The time required by a process to complete execution.
3. Division of virtual memory in equal-size parts.
6. A situation where a set of processes are blocked because each process is holding a resource and waiting for another resource acquired by some other process.
10. Bit to be set when a page has been modified but has not been written to the disk.
11. Lightweight process.
14. OS mechanism for determining which process will be executed next.
16. Address read by the CPU.
17. The number of processes that finish their execution per unit time.
18. Combined with the base address provides the physical memory address.
21. Memory that sits between the main memory and the CPU registers.
22. Time a process has been waiting in the ready queue.
23. A module that provides control of the CPU to the process.
26. In this type of algorithm, the process which arrives first in the ready queue, gets the CPU first.
27. This bit is set to 1 if the page exists in the main memory.

2. Memory allocation of segments.
4. Return to some safe state, restart process for that state.
5. Allocation where all data is located at one place in the main memory
7. Multiple programs are present in memory at the same time.
8. In this scheduling the currently executing process does not give up the CPU voluntarily.
9. Appears in fragmentation.
12. Maximum execution time per time.
13. A memory management scheme in which any process page can be temporarily moved to a storage medium.
15. This is a page we are looking for to replace in demand paging.
19. It happens when a referenced page does not exist in the main memory.
20. It is required to convert an address from logical to physical.
24. Address seen by the memory unit.
25. Fast hardware mapping mechanism.