14. A zombie process is one that: 18. Suppose a virtual memory system has 8 virtual A. does not have a child or parent B. on the way out, but still in the systeman out of memory, thus unable to run normally D. is unknown to the operating system apages and S frames. Then the total number of bits required in the page table for valid bits is: e A 3 B.4 G8 D. 16 5. Consider three processes of size 50, 100, and 19. Page tables help map 150, and time-slice quantum of 50 in RR uling. Then the all processes will finish A. virtual addresses to logical addresses within: A. 100 B. 150 C. 250 B300 For a given active memory system, physical B. CPU addresses to virtual addresses C. virtual addresses to CPU addresses D virtual addresses to physical addresses page sizes are In priority CPU scheduling, the problem of liferent from each other B. all the staryation is solved by using round robin same size C usually same, sometimes dif- B. changing the quan- ferent D. the size will depend on the processtum C. aging D. increasing memory demands allocation