SampleFinal - ECE-C421 (Winter 2006) Final Exam (100...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
1 ECE-C421 (Winter 2006) Final Exam (100 points) Date: 20 March 2006 Instructor: N. Kandasamy 1. ( 5 points ) Consider a multilevel queue-scheduling algorithm where the ready queue is partitioned into several separate queues. Processes are permanently assigned to a queue based on their priority, and each queue has absolute priority over lower-priority queues. Assume a student process P 1 assigned to the lowest-priority queue. Does the above scheduling method guarantee P 1 ’s eventual execution. If not, suggest two possible modifications to the scheduling scheme that do. 2. ( 5 points ) Consider a page reference string for a process with a working set of M frames, initially all empty. The reference string is of length P with N distinct page numbers in it. For any page replacement algorithm, (a) What is the lower bound on the number of page faults? and (b) What is the upper bound on the number of page faults? 3. ( 5 points ) Consider a system with memory mapping via paging using a single-level page table.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 4

SampleFinal - ECE-C421 (Winter 2006) Final Exam (100...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online