fa11mt - Page 1/14 University of California, Berkeley...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Page 1/14 University of California, Berkeley College of Engineering Computer Science Division – EECS Fall 2011 Anthony D. Joseph and Ion Stoica Midterm Exam October 13, 2011 CS162 Operating Systems Your Name: SID AND 162 Login: TA Name: Discussion Section Time: General Information: This is a closed book and one 2-sided note examination. You have 80 minutes to answer as many questions as possible. The number in parentheses at the beginning of each question indicates the number of points for that question. 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!! QUESTION POINTS ASSIGNED POINTS OBTAINED 1 12 2 42 3 18 4 28 TOTAL 100 CS 162 Fall 2011 Midterm Exam October 13, 2011 Page 2/14 1. (12 points total) Short answer questions: a. (4 points) List the four requirements for deadlock: We gave one point for each requirement for deadlock. b. (3 points) Operating System terms. i) (1 point) List a synchronization mechanism that is an abstraction of a counting number (non-negative integer). 1 point for correctly described term; in very few cases we gave partial credit. ii) (1 point) What is the portion of a process’ code that manipulates shared variables? 1 point for correctly described term; in very few cases we gave partial credit. iii) (1 point) What is the OS data structure that represents a running process? 1 point for correctly described term; in very few cases we gave partial credit. c. (5 points) What are the differences between a Hoare monitor and a Mesa monitor? Your answer should be brief (no more than 3 sentences). For Hoare Monitors we gave 1 point for transfer lock, 1 point for transfer cpu, and 1 point to thread being woken. For Mesa Monitors, we gave 1 point for putting the thread into ready queue, and 1 point for rechecking the condition and content for resources (1pt) We subtracted 1pt for mentioning that the lock and cpu are not transferred for Mesa monitors. CS 162 Fall 2011 Midterm Exam October 13, 2011 Page 2/14 1. (12 points total) Short answer questions: a. (4 points) List the four requirements for deadlock: We gave one point for each requirement for deadlock. b. (3 points) Operating System terms. i) (1 point) List a synchronization mechanism that is an abstraction of a counting number (non-negative integer). 1 point for correctly described term; in very few cases we gave partial credit. ii) (1 point) What is the portion of a process’ code that manipulates shared variables?...
View Full Document

This note was uploaded on 03/12/2012 for the course CS 162 taught by Professor Kubiatowicz during the Spring '02 term at Berkeley.

Page1 / 14

fa11mt - Page 1/14 University of California, Berkeley...

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