Computer Science 162 - Spring 1992 - Anderson - Midterm 2

Computer Science 162 - Spring 1992 - Anderson - Midterm 2 -...

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

View Full Document Right Arrow Icon
CS162, Midterm #2, Spring/1992 CS162, Spring/1992 Midterm #2 Professor Thomas Anderson General Information: This is a closed book examination. You have 60 minutes to answer as many question 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 anwers as concise as possible (you needn't cover every available nano-acre with writing). Problem #1 (6 points) For each of the following statements, indicate in one sentence whether the statement is true or false, and why. (a) Binary semaphores are those that are used by no more than two threads. Answer: False, binary semahpores contain two states 0 or 1. (b) The Banker's algorithm is a way of preventing deadlock Answer: True, no process is allowed into a section if deadlock is possible. (c) A multi-level indexed file permits faster random access than a contiguously allocated file. Answer: False, contiguous files may be easily jumped through, while the multi-level file must seek right blocks. Problem #2 (8 points) file:///C|/Documents%20and%20Settings/Jason%20Raft. ..Spring%201992%20-%20Anderson%20-%20Midterm%202.htm (1 of 5)1/27/2007 4:01:14 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 #2, Spring/1992 For each of the following items, write a sentence definition:
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 Berkeley.

Page1 / 5

Computer Science 162 - Spring 1992 - Anderson - Midterm 2 -...

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