Docsity
Docsity
Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity

Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan

Guidelines and tips
Guidelines and tips
Sell on Docsity
Sell on Docsity
Docsity AI
Docsity AI
Log inSign up

Prepare for your exams

Study with the several resources on Docsity

Find documents

Prepare for your exams with the study notes shared by other students like you on Docsity

Search for your university

Find the specific documents for your university's exams

Docsity AINEW

Summarize your documents, ask them questions, convert them into quizzes and concept maps

Explore questions

Clear up your doubts by reading the answers to questions asked by your fellow students

Earn points to download

Earn points by helping other students or get them with a premium plan

Share documents
download point icon20 Points

For each uploaded document

Answer questions
download point icon5 Points

For each given answer (max 1 per day)

All the ways to get free points
Get points immediately

Choose a premium plan with all the points you need

Study Opportunities

Choose your next study program

Get in touch with the best universities in the world. Search through thousands of universities and official partners

Community

Ask the community

Ask the community for help and clear up your study doubts

Free resources

Our save-the-student-ebooks!

Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors

Operating Systems - Final Exam | CSE 430, Exams of Operating Systems

Arizona State University (ASU) - TempeOperating Systems

Material Type: Exam; Class: Operating Systems; Subject: Computer Science and Engineering; University: Arizona State University - Tempe; Term: Spring 2001;

Typology: Exams

Pre 2010

Uploaded on 09/02/2009

koofers-user-zil
koofers-user-zil 🇺🇸

4

(1)

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE 430
SPRING 2001 FINAL EXAM
(Afternoon Class) NAME
Put name on EVERY page
(36) 1. Performance of Virtual Memory systems
Consider a demand-paging system with the following time measured utilizations:
CPU utilization 20%
Paging disk 97.7%
Other I/O devices 5%
(4) (a)What is probably causing this utilization pattern?
Which (if any) of the following will (probably) improve CPU utilization? Explain each of your
answers. (A brief statement relating your answer to your answer in part (a) above will suffice for some of the
parts below).
(4) (b) Install a faster CPU.
(4) (c) Install a bigger paging disk.
(4) (d) Increase the degree of multiprogramming.
(4) (e) Decrease the degree of multiprogramming.
(4) (f) Install more main memory.
(4) (g) Install a faster hard disk, or multiple controllers with multiple disks.
(4) (h) Add prepaging to the page fetch algorithms.
(4) (i) Increase the page size
pf3
pf4

Partial preview of the text

Download Operating Systems - Final Exam | CSE 430 and more Exams Operating Systems in PDF only on Docsity!

CSE 430

SPRING 2001

FINAL EXAM

(Afternoon Class)

NAME

Put name on EVERY page (36) 1. Performance of Virtual Memory systems Consider a demand-paging system with the following time measured utilizations: CPU utilization 20% Paging disk 97.7% Other I/O devices 5% (4) (a)What is probably causing this utilization pattern? Which (if any) of the following will (probably) improve CPU utilization? Explain each of your answers. (A brief statement relating your answer to your answer in part (a) above will suffice for some of the parts below). (4) (b)Install a faster CPU. (4) (c) Install a bigger paging disk. (4) (d)Increase the degree of multiprogramming. (4) (e) Decrease the degree of multiprogramming. (4) (f) Install more main memory. (4) (g)Install a faster hard disk, or multiple controllers with multiple disks. (4) (h)Add prepaging to the page fetch algorithms. (4) (i) Increase the page size

CSE 430 FINAL EXAM SPRING 2001

(Afternoon Class)

NAME

Put name on EVERY page (34) 2.Demand Paged Memory Management Given the following sequence of memory references from a 1000 word program: 200, 201, 300, 202, 203, 110, 550, 551, 552, 203, 490, 550, 302 (6) (a) Give the compressed reference string assuming a page size of 100 words. In parts (b), (c) and (d) assume 300 words of primary memory are available to the program. Note: To obtain partial credit on these parts you must show how you got your answers. (7) (b) Using a FIFO replacement algorithm find the number of page faults. (7) (c) Repeat the above for an LRU replacement algorithm. (7) (d) Repeat the above for the Optimal replacement algorithm. (7) (e) Given the following page reference trace and time t 1 Note: To obtain partial credit on this part you must show how you got your answer. ....2 6 1 5 7 7 7 7 5 1 6 2 3 4 1 2 3 4 4 4 3 4 3 4 4 4 1 3 2 3 4 4 4 3 4 4 4....  t 1 Increasing time  (i) what is the working set at time t 1 for a working set window of 6? (ii) what is the working set at time t 1 for a working set window of 14?

CSE 430 FINAL EXAM SPRING 2001

(Afternoon Class)

NAME

Put name on EVERY page (6 points extra credit) 4. Clock Page Replacement Algorithm Many modern industrial grade operating systems use a variant of the Clock algorithm for page replacement. (3) (a) Give an advantage the clock algorithm has over FIFO page replacement. (3) (b) Give an advantage the clock algorithm has over LRU page replacement.