Computer Science 162 - Fall 1993 - Anderson - Midterm 1

Computer Science 162 - Fall 1993 - Anderson - Midterm 1 -...

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

View Full Document Right Arrow Icon
CS162, Midterm #1, Fall/1993 CS162, Fall/1993 Midterm 1 General Information This is a closed bok examination. You have 60 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 60 points in all. Write all of your answers directly on this paper. Make your answers as concise as possible (you needn't cover every available nano-acre with writing). If there is something in a question you believe is open to interpretation, then please go ahead and interpret BUT state your assumptions in your answer. Problem #1: (6 points) For each of the following statements, indicate in one sentence whether the statement is true or false, and why. (a) If a set of cooperating threads can correctly time-share one processor, then they will correctly execute on separate processors of a multiprocessor. (b) The CPU scheduling policy that minimizes average response time can never lead to starvation. (c) If a system employing only segmentation wants to enlarge an addresss space, it is always possible if the total amount of free memory is bigger than the requested enlargement. Problem #2: (8 points) file:///C|/Documents%20and%20Settings/Jason%20Raft. ..20Fall%201993%20-%20Anderson%20-%20Midterm%201.htm (1 of 5)1/27/2007 3:49:03 PM
Background image of page 1

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

View Full DocumentRight Arrow Icon
CS162, Midterm #1, Fall/1993 For each of the following items, write a one sentence definition. (a) Interrupt (b) Fully associative cache (c) Working set (d) Throughput Problem #3: (12 points) (a) What is the worst possible CPU scheduling algorithm - the one that yields the worst average response time? Assume that the algorithm must run a thread if there is one available, and that a context
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.

This note was uploaded on 05/17/2009 for the course CS 162 taught by Professor Kubiatowicz during the Spring '02 term at University of California, Berkeley.

Page1 / 5

Computer Science 162 - Fall 1993 - Anderson - Midterm 1 -...

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