Operating System

2. If you know at compile time where the process will reside in memory then........... code can be generated.
4. block where process scheduling information is store
7. Access to a page marked invalid causes
10. OS is ......... that manages computer hardware
11. the schedular which swaps the process
12. Fixed Partition Scheme support ......... fragmentation.
15. Instead of system call programmers use
18. another name for shortest-remaining-time-first scheduling
19. all the other processes wait for the one big process to get off the CPU.
21. diagram representation of process scheduling
23. Unit maps logical pages to physical page frames in Main memory
24. One solution to the problem of external fragmentation is

1. a part of a process memory used for dynamic memory allocation
3. hardware bit of the computer is used to indicate the current mode
5. the parent is exiting, and the operating system terminates all the children
6. program which is an active entity
8. Logical memory is divided into blocks of the same size called
9. software-generated interrupt
13. place where processes are ready to execute
14. A solution to the problem of indefinite blockage of low-priority processes is
16. synchronization tool to solve the critical-section problem
17. the module that gives control of the CPU to the process selected by the short-term scheduler.
20. The FCFS algorithm is thus particularly troublesome for systems
22. Register holds the smallest legal physical memory address.