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 - Midterm Questions 2005 | 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 2005;

Typology: Exams

Pre 2010

Uploaded on 09/02/2009

koofers-user-em5
koofers-user-em5 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
CSE 430
SPRING 2005 MIDTERM 1
(3:15 CLASS)
NAME
Put Name on Every Page
1. (30) Scheduling
Given the following jobs:
Job # Arrival Time Run Time
A 0 3
B 2 6
C 4 4
D 6 5
E 8 2
(a) (18) Draw a Gantt chart to illustrate the execution of these jobs for each of the
following 3 CPU scheduling algorithms: Shortest Remaining Time First; FCFS; and
Round Robin with q=4. Make the following assumptions to handle 'ties.' In Shortest
Remaining Time First, if two jobs have the same shortest remaining time, the one that
arrived first gets to go. Helpful Hint: Take your time. Be careful on SRTF and RR.
(b) (6) What is the average waiting time for Shortest Remaining Time First?
(c) (3) What determines the practical lower bound on the time quantum for Round Robin process
scheduling and why is this so?
(d) (3) Why is it essentially impossible to implement Shortest Remaining Time First?
pf3
pf4

Partial preview of the text

Download Operating Systems - Midterm Questions 2005 | CSE 430 and more Exams Operating Systems in PDF only on Docsity!

CSE 430

SPRING 2005

MIDTERM 1

(3:15 CLASS)

NAME

Put Name on Every Page

1. (30) Scheduling Given the following jobs: Job # Arrival Time Run Time A 0 3 B 2 6 C 4 4 D 6 5 E 8 2 (a) (18) Draw a Gantt chart to illustrate the execution of these jobs for each of the following 3 CPU scheduling algorithms: Shortest Remaining Time First; FCFS; and Round Robin with q=4. Make the following assumptions to handle 'ties.' In Shortest Remaining Time First, if two jobs have the same shortest remaining time, the one that arrived first gets to go. Helpful Hint : Take your time. Be careful on SRTF and RR. (b) (6) What is the average waiting time for Shortest Remaining Time First? (c) (3) What determines the practical lower bound on the time quantum for Round Robin process scheduling and why is this so? (d) (3) Why is it essentially impossible to implement Shortest Remaining Time First?

Put Name on Every Page SPRING 2005 (3:15 CLASS)

2. (30) Threads (a) (4) In multithreaded operating systems some items are typically contained in a thread control block and some in a process control block. List two examples of each. (b) (6) Explain why threads provide a simpler programming model than a finite state machine. (c) (4) State why a multi-threaded process provides more parallelism than a single threaded process. (d) (8)Give an advantage that a user-level thread package has over kernel-managed threads. Note: If you give more than one advantage only the first will be graded. Another Note: Just saying faster or higher performance gets you zero points – you need to say why. (e) (8) Give an advantage that having threads managed by the kernel has over a user-level thread management package. Note: If you give more than one advantage only the first will be graded. Another Note: Just saying faster or higher performance gets you zero points – you need to say why.

Put Name on Every Page SPRING 2005 (3:15 CLASS)

4. (20) RPC (a) (15) List the 6 steps in the simplified overview of RPC as presented in class. Identify which involve procedure calls, procedure returns and message passing. (b) (5) Two of the above steps actually are more complicated, involving three substeps. For one of these say what the substeps are. 5. (3 points extra credit) Scheduling Algorithm Evaluation State an advantage simulation has over analytical modeling for evaluating scheduling algorithms.