0% found this document useful (0 votes)
38 views

Name: Course/year:: Micro Asia College of Science and Technology

The document is an exam for an operating systems course that contains multiple choice questions and essay questions. The multiple choice questions cover topics like mutual exclusion, deadlocks, critical sections, semaphores, and condition variables. The essay questions ask students to explain how deadlocks are detected and corrected, compare deadlock prevention and avoidance, explain the requirements for the critical section problem, describe what semaphores are and how they implement mutual exclusion, and describe hardware solutions to the critical section problem.

Uploaded by

TrisTan Dolojan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
38 views

Name: Course/year:: Micro Asia College of Science and Technology

The document is an exam for an operating systems course that contains multiple choice questions and essay questions. The multiple choice questions cover topics like mutual exclusion, deadlocks, critical sections, semaphores, and condition variables. The essay questions ask students to explain how deadlocks are detected and corrected, compare deadlock prevention and avoidance, explain the requirements for the critical section problem, describe what semaphores are and how they implement mutual exclusion, and describe hardware solutions to the critical section problem.

Uploaded by

TrisTan Dolojan
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Micro Asia College of Science and Technology

Zone 1, Iba , Zambales Operating Systems Semi Final Examination

Name: Course/year: I. Identification: Write all your answers on the test booklet. All forms of erasures are strictly considered as wrong answer. On part II Essay, no need to answer numbers 2, & 4.

1. the requirement of ensuring that no two concurrent processes are in their critical section at the same time. 2. It is endless waiting due to circular wait relationships. 3. It is unbounded waiting due to order of service policy. 4. Requests are not served in order they are made. 5. Algorithm breaks if processes die or messages are lost or garbled 6. a piece of code that accesses a shared resource (data structure or device) that must not be concurrently accessed by more than one thread of execution 7. is a software module consisting of one or more procedures, an initialization sequence and local data. 8. is a synchronization variable that tasks on positive integer values. 9. It occurs when multiple processes or threads read and write data items so that the final result depends on the order of execution of instructions in the multiple processes. 10. are a special data type in monitors, which are operated on by two functions 11. is a set of methods for ensuring that at least one of the necessary condition cannot hold. 12. occurs when two or more processes are waiting indefinitely for an event that can be caused only one of the waiting processes. 13. It never holds is to impose a total ordering of all resource types, and to require that each process requests resources in an increasing order of enumeration. 14. resources are added to the list of resources for which the process is waiting process will be restarted only when it can regain its old resources, as well as the new ones that it is requesting. 15. if the system can allocate resources to each process (up to its maximum) in some order and still avoid a deadlock. More formally, a system is in a safe state only if there exists a safe sequence.

Micro Asia College of Science and Technology


Zone 1, Iba , Zambales Operating Systems Semi Final Examination

II.

Essay:

Q.1 Explain how deadlocks are detected and corrected? Q.2 What are the difference between a deadlock prevention and deadlock Avoidance? Q.3 What are the requirement for critical section problem? Q.4 What are semaphores? How do they implement mutual exclusion? Q.5 Describe hardware solution to the critical section problem?

Micro Asia College of Science and Technology


Zone 1, Iba , Zambales Operating Systems Semi Final Examination

Answers: 1. 2. 3. 4. 5. 6. 7. 8. 9. 10. 11. 12. 13. 14. 15.

Mutual Exclusion Deadlock Starvation Unfairness fault intolerance Critical Section Monitor Semaphore race condition Condition variables Deadlock prevention deadlocked state Circular-wait condition
Preemption Safe State

You might also like