This document contains a 3 question test on operating systems concepts administered on October 22, 2015 from 11:15am to 12:15pm in room DKG 31. The test covers: [1] comparing active and passive multiprocessing and fixed and dynamic partition systems, [2] performing a page trace analysis using FIFO and LRU page replacement algorithms, and [3] drawing timelines to illustrate FCFS, SJF, and round robin scheduling algorithms. Students are instructed to answer all questions in complete sentences.
This document contains a 3 question test on operating systems concepts administered on October 22, 2015 from 11:15am to 12:15pm in room DKG 31. The test covers: [1] comparing active and passive multiprocessing and fixed and dynamic partition systems, [2] performing a page trace analysis using FIFO and LRU page replacement algorithms, and [3] drawing timelines to illustrate FCFS, SJF, and round robin scheduling algorithms. Students are instructed to answer all questions in complete sentences.
This document contains a 3 question test on operating systems concepts administered on October 22, 2015 from 11:15am to 12:15pm in room DKG 31. The test covers: [1] comparing active and passive multiprocessing and fixed and dynamic partition systems, [2] performing a page trace analysis using FIFO and LRU page replacement algorithms, and [3] drawing timelines to illustrate FCFS, SJF, and round robin scheduling algorithms. Students are instructed to answer all questions in complete sentences.
This document contains a 3 question test on operating systems concepts administered on October 22, 2015 from 11:15am to 12:15pm in room DKG 31. The test covers: [1] comparing active and passive multiprocessing and fixed and dynamic partition systems, [2] performing a page trace analysis using FIFO and LRU page replacement algorithms, and [3] drawing timelines to illustrate FCFS, SJF, and round robin scheduling algorithms. Students are instructed to answer all questions in complete sentences.
Answer all questions. Write your answers in cornplete sentences"
1,. A. Briefly compare active and passlve multiprogramrning. b. Compare and contrast a fixed partition system and a dynamic partition system.
2. Given that main memory is composed of three page frames for public use and that a program requests pages in the following order:
e, b, 6, c, 6,'f , e,1,'*, t, 6, A
a. using the FlFo page removal algorithm, perform a page trace analysis indicating page faults with asterisks {*)" Then cornpute the failure and success ratios. b. Using the LRU page removai algorithm, perform a page trace analysis and compute the failure and success ratios. c. Which is better? Why do you think it is better? 0 I f^z) q t^ l'L rr t
3. Given the following information: 1'
\1.. I t - .{ 4 | ,n li; tX rtx r t+x ') \) t0
Draw a timeline for each of the following scheduling algorithm.
a. FCFS b. sRr & r \ f-zCgrLh rj c. Round robin (using a time {uantum of 3, ignore context switching and natural wait) t ->
