Review Quiz 1

Review Quiz 1 - Sheet1 Page 1 The synchronization of...

Info iconThis preview shows pages 1–2. 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: Sheet1 Page 1 The synchronization of processes can be done more efficiently than the synchronization of threads. --FALSE A counting semaphore only uses two values: 0 and 1.--FALSE Different processes can call different procedures of the same monitor simultaneously. --FALSE Which of the following are not algorithms for mutual exclusion?--Diffie-Helman --Byzantine General algorithm --Bully algorithm MPEG is an acronym that stands for --Motion Pictures Experts Group Which of the following is not a type of failure discussed in the textbook?--Canonical failure Hides where a resource is located --Location Transparency Hides the differences in data representation and how a resource is accessed--Access Transparency Hides the failure and recovery of a resource --Failure Transparency Hides whether a resource is in memory or on a disk --Persistence Transparency Hides that a resource may be shared by several competitive users --Concurrent Transparency The concept of a monitor already exists in most procedure-oriented programming languages, such as C and Pascal.The concept of a monitor already exists in most procedure-oriented programming languages, such as C and Pascal....
View Full Document

Page1 / 2

Review Quiz 1 - Sheet1 Page 1 The synchronization of...

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

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