B-Q1 15 marks Virtual Memory-Paging Table 1 maps pages to frames (e.g. page 1 to frame 0, page 4 to frame 1, etc.) for a process. The page and frame size is 1K, and the OS uses 1K (starting at address 0) of memory. OS 0 0 Page 1 1 1 Page 4 2 2 Page 2 3 3 free 4 4 Page 8 5 5 free 6 6 Page 0 7 7 Page 5 8 8 free PAGES FRAMES Table 1 Answer the following questions: a 2 mark What is the address at the start of frame 1? What is the address at the end of frame 1? b 2 mark Is page 2 mapped to frame 2? (Yes/No); Is page 3 mapped to frame 3? (Yes/No) c 1 mark Which pages have not been loaded into memory as yet? d 2 mark When Process A references an address in page 3, explain what the paging system does? What happens to Process A as a consequence according to process transition? e 8 marks Memory Management Unit (MMU) performs translation of logical addresses to physical addresses. In addition, it also performs memory protection. Map the following logical addresses to physical addresses (in decimal) and also check the protection during translation. Show the calculations and steps involved during logical to physical address translation process: Logical address maps to Physical address 1023 3000 4120 5000 B-Q2 30 marks Process Management and Scheduling a 20 marks Given the following arrival time and CPU cycle times. Job Arrival Time CPU cycles required A 0 12 B 2 5 C 4 2 D 5 11 E 8 1 Draw a timeline for each of the following scheduling algorithms and also show the details of the ready queue formation during the time line. (5 marks each) i) FCFS ii) SJN iii) SRT iv) Round Robin (use time quantum of 3) b 10 marks Using either internet resources or books, understand the concept of waiting time and turnaround time. Define those terms (waiting time and turnaround time) in your own words. Then calculate waiting time and turnaround time for every job for all four scheduling algorithms mentioned in B-Q2-a (Details of the calculations is essential). You must provide references and cite the sources that you consulted for this task.