Question 1: Choose the correct answer: (10 Points/2 Points Each) 1. Before executing a program, Memory Manager: a. Determines number of pages in program b. Locates enough empty page frames in main memory c. Loads all of the program's pages into them d. All answers 2. Memory Map Table (MMT) contain: a. Location for each page frame b. Size of the job c. Memory location where its PMT is stored d. Page number and its corresponding page frame memory address 3. Factors to consider in designing cache memory: a. Cache size b. Block size c. Block replacement algorithm d. All answers 4. A good process scheduling policy should: a. Minimize response time by quickly turning around interactive requests h. Maximize turnaround time by moving entire jobs in and out of system quickly c Maximize waiting time by moving jobs out of READY queue as quickly as possible d. All answers 5. The type of memory that allows for very effective multiprogramming and relieves the user of memory size constraints is referred to as: a Real memory b. Virtual memory c. Main memory d. All answers 2 Question 2: Mark true or false for the following statements. (10 Points/2 Points Each) 1. Turnaround time is the total time taken between the submission of a process for execution and the return of the complete output to FINISHED Status. A. True B. False 2. In a system employing a memory management strategy that doesn't require an entire process to be in main memory at one time, the portion of a process that is actually in main memory at any given time is defined to be the resident set of the process. A. True B. False 3. Shortest Remaining Time (SRT) is an example of preemptive process scheduling algorithm A. True B. False 4. Shortest Job Next (SJN) is an example of preemptive process scheduling algorithm. A. True B. False 5. The File Manager is the software responsible for creating, deleting, modifying, and controlling access to files. A. True B. False