This article provides solutions to Operating System questions related to page replacement algorithms, scheduling algorithms, and more. It includes solved examples and explanations for better understanding.
Contribute Materials
Your contribution can guide someone’s learning journey. Share your
documents today.
Running head: OPERATING SYSTEM Operating System Name of the Student: Name of the University: Author Note
Secure Best Marks with AI Grader
Need help grading? Try our AI Grader for instant feedback on your assignments.
1 OPERATING SYSTEM Answer to question number 1 a.Page 4 is at that start of frame 1 b.Yes, Page 2 has been mapped to frame 2. No page 3 has not been mapped to frame 3. c.3,6 and 7 are the pages which are yet to be loaded into the memory. d.When the process A is referencing any type of address in page number 3, the address is looked up in the reference table by the CPU and CPU would not be able to get the address from the reference table and a miss would be returned from the cache. Hence the CPU would have to look for the resource which is present in the memory of the computer and this would result in to the process going in to the waiting phase. e.The address corresponding to the logical addresses are: 1023 mod log (1023) = 1 3000 mod log (3000) = 2988 4120 mod log (4120) = 4107 5000 mod log (5000) = 4987 Answer to question number 2 a.
2 OPERATING SYSTEM The pages would be replaced in the following order: 3, 16,8,1,18,4,15,12. b. The status bit is used for the LRU algorithm for the new entries and validation of the new entries. Order of replacement of the bit is in the LRU algorithm: 18,12,8,3,0,16,14,6. Answer to question number 3 a. FCFS AAAAAAAAAAAABBBBBCCDDDDDDDDDDDE 01234567891 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 3 0 3 1
3 OPERATING SYSTEM SJN AABBCCBBBEAAAAAAAAAADDDDDDDDDDD 01234567891 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 3 0 3 1 SRT AABBCCBBBEAAAAAAAAAADDDDDDDDDDD 01234567891 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 3 0 3 1 Round Robin AAABBBCCDDDEAAABBDDDAAADDDAAADD 01234567891 0 1 1 1 2 1 3 1 4 1 5 1 6 1 7 1 8 1 9 2 0 2 1 2 2 2 3 2 4 2 5 2 6 2 7 2 8 2 9 3 0 3 1 b. Turnaround time: The turnaround time is measured by the total time required by a process to be completed. Waiting time: The total waiting time is the total time that a process would have to wait before it gets allocated for processing. FCFS ProcessArrival TimeBurst TimeCompletion Time Turnaround Time Waiting Time A01212120 B25171510 C42191513 D611302413
Paraphrase This Document
Need a fresh take? Get an instant paraphrase of this document with our AI Paraphraser
4 OPERATING SYSTEM E91312221 Average Turnaround Time: (12+15+15+24+22)/5 = 17.6 Average Waiting Time: (0+10+13+13+21)/5 = 11.4 SJN ProcessArrival TimeBurst TimeCompletion Time Turnaround Time Waiting Time A01220208 B25972 C42620 D611312514 E911010 Average Turnaround Time: (20+7+2+25+1)/5 = 11 Average Waiting Time: (8+2+0+14+0)/5 = 4.8 SRT ProcessArrival TimeBurst TimeCompletion Time Turnaround Time Waiting Time A01220208 B25972 C42620 D611312514 E911010
5 OPERATING SYSTEM Average Turnaround Time: (20+7+2+25+1)/5 = 11 Average Waiting Time: (8+2+0+14+0)/5 = 4.8 Round Robin ProcessArrival TimeBurst TimeCompletion Time Turnaround Time Waiting Time A012292917 B25171510 C42842 D611312514 E911232 Average Turnaround Time: (29+15+4+25+3)/5 = 15.2 Average Waiting Time: (17+10+2+14+2)/5 = 9
6 OPERATING SYSTEM Bibliography [1] Moraru, I., Andersen, D.G., Kaminsky, M., Tolia, N., Ranganathan, P. and Binkert, N, November. Consistent, durable, and safe memory management for byte-addressable non volatile main memory. InProceedings of the First ACM SIGOPS Conference on Timely Results in Operating Systems(p. 1). ACM., 2013. [2] Sirohi, A., Pratap, A. and Aggarwal, M. Improvised Round Robin (CPU) Scheduling Algorithm.International Journal of Computer Applications,99(18), pp.40-43., 2014.