cs162_fa08_mt1-3 - allowing groups of reads that arrive...

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
CS 162 Fall 2008 Midterm Exam I October 15, 2008 Page 5/21 Problem 1f[4pts]: Suppose that you were to redesign the code in (1e). What is the minimum number of condition variables that we would we need in order to handle the above requests in an order that guarantees that a read always returns the results of writes that have arrived before it but not after it? (Another way to say this is that the reads and writes occur in the order in which they arrive, while still
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: allowing groups of reads that arrive together to occur simultaneously.) Provide a two or three sentence sketch of your scheme (do not try to write code!). Problem 1g[3pts]: What are exceptions? Name two different types of exceptions and give an example of each type: Problem 1h[2pts]: What was the problem with the Therac-25? Your answer should involve one of the topics of the class....
View Full Document

{[ snackBarMessage ]}

Ask a homework question - tutors are online