Sp01 midterm 1

Operating System Concepts, Seventh Edition

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

View Full Document Right Arrow Icon
Page 1/11 University of California, Berkeley College of Engineering Computer Science Division – EECS Spring 2001 Anthony D. Joseph Midterm Exam March 7, 2001 CS162 Operating Systems Your Name: SID AND 162 Login: TA: Discussion Section: General Information: This is a closed book and notes examination. You have ninety minutes to answer as many questions as possible. The number in parentheses at the beginning of each question indicates the number of points given to the question; there are 100 points in all. You should read all of the questions before starting the exam, as some of the questions are substantially more time consuming. Write all of your answers directly on this paper. Make your answers as concise as possible. If there is something in a question that you believe is open to interpretation, then please ask us about it! Good Luck!! Problem Possible Score 1 12 2 24 3 23 4 18 5 23 Total 100
Background image of page 1

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

View Full Document Right Arrow Icon
CS 162 Spring 2001 Midterm Exam March 7, 2001 Page 2/11 1. (12 points total) “Lightweight” versus “Heavyweight” processes – Pros and Cons: a. (4 points) List two advantages of running a group of applications as single-threaded “heavyweight” processes over running the applications as multiple “lightweight” processes, all in one address space. Be explicit in your answers. i) b. (8 points) List two reasons why lightweight processes are better than heavyweight ones. i) ii) 2. (24 points total) Suppose that we have a multiprogrammed computer in which each job has identical characteristics. In one computation period, T , for a job, half the time is spent in I/O and the other half in processor activity. Each job runs for a total of N periods. Assume that a simple round-robin scheduling scheme is used and that I/O operations can overlap with processor operation. We define the following quantities: Turnaround time = actual time to complete a job. Processor utilization = percentage of time that the processor is active (not waiting).
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

Page1 / 11

Sp01 midterm 1 - University of California Berkeley College...

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

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