A. Overlays are used to increase the size of physical memory
B. Overlays are used to increase the logical address space
C. When overlays are used, the size of a process is not limited to the size of the physical memory
D. Overlays are used whenever the physical address space is smaller than the logical address space

A. Job queue
B. Pcb queue
C. Device queue
D. Ready queue

A. Time it was brought into memory
B. Size of the page in memory
C. Page after and before it
D. All of the mentioned

A. Single user, single tasking
B. Single user, multitasking
C. Multi user, single tasking
D. Multi user, multitasking

A. Dispatcher
B. Interrupt
C. Scheduler
D. None of the mentioned

A. First-come, first-served scheduling
B. Shortest job scheduling
C. Priority scheduling
D. None of the mentioned

A. Shortest job scheduling algorithm
B. Round robin scheduling algorithm
C. Priority scheduling algorithm
D. Multilevel queue scheduling algorithm

A. Kernel level thread
B. User level thread
C. Process
D. None of the mentioned

A. Physical address
B. Absolute address
C. Logical address
D. None of the mentioned

A. The speed of dispatching a process from running to the ready state
B. The time of dispatching a process from running to ready state and keeping the cpu idle
C. The time to stop one process and start running another one
D. None of the mentioned