מערכות הפעלה

For Mutual exclusion to prevail in the system

1

שאלה #43585

		at least one resource must be held in a non sharable mode
		the processor must be a uniprocessor rather than a multiprocessor
		there must be at least one resource in a sharable mode
		all of the mentioned

Explanation: If another process requests that resource (non – shareable resource), the requesting process must be delayed until the resource has been released.

מיין לפי

For a Hold and wait condition to prevail

1

שאלה #43586

		A process must be not be holding a resource, but waiting for one to be freed, and then request to acquire it
		A process must be holding at least one resource and waiting to acquire additional resources that are being held by other processes
		A process must hold at least one resource and not be waiting to acquire additional resources
		None of the mentioned

נערך לפני 4 שנים stav shlomovich

מיין לפי

Deadlock prevention is a set of methods

1

שאלה #43587

		to ensure that at least one of the necessary conditions cannot hold
		to ensure that all of the necessary conditions do not hold
		to decide if the requested resources for a process have to be given or not
		to recover from a deadlock

מיין לפי

For non sharable resources like a printer, mutual exclusion

1

שאלה #43588

		must exist
		must not exist
		may exist
		none of the mentioned

Explanation: A printer cannot be simultaneously shared by several processes.

מיין לפי

For sharable resources, mutual exclusion

1

שאלה #43589

		is required
		is not required
		may be or may not be required
		none of the mentioned

Explanation: They do not require mutually exclusive access, and hence cannot be involved in a deadlock.

נערך לפני 4 שנים stav shlomovich

מיין לפי

To ensure that the hold and wait condition never occurs in the system, it must be ensured that

1

שאלה #43590

		whenever a resource is requested by a process, it is not holding any other resources
		each process must request and be allocated all its resources before it begins its execution
		a process can request resources only when it has none
		all of the mentioned

Explanation: c – A process may request some resources and use them. Before it can can request any additional resources, however it must release all the resources that it is currently allocated.

מיין לפי

The disadvantage of a process being allocated all its resources before beginning its execution is

1

שאלה #43591

		Low CPU utilization
		Low resource utilization
		Very high resource utilization
		None of the mentioned

נערך לפני 4 שנים stav shlomovich

מיין לפי

To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it

1

שאלה #43592

		then the process waits for the resources be allocated to it
		the process keeps sending requests until the resource is allocated to it
		the process resumes execution without the resource being allocated to it
		then all resources currently being held are preempted

מיין לפי

One way to ensure that the circular wait condition never holds is to

1

שאלה #43593

		impose a total ordering of all resource types and to determine whether one precedes another in the ordering
		to never let a process acquire resources that are held by other processes
		to let a process wait for only one resource at a time
		all of the mentioned

מיין לפי

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

1

שאלה #43594

		resource allocation state
		system storage state
		operating system
		resources

Explanation: Resource allocation states are used to maintain the availability of the already and current available resources.

מיין לפי

Discuss, Learn and be Happy דיון בשאלות

For Mutual exclusion to prevail in the system

For a Hold and wait condition to prevail

Deadlock prevention is a set of methods

For non sharable resources like a printer, mutual exclusion

For sharable resources, mutual exclusion

To ensure that the hold and wait condition never occurs in the system, it must be ensured that

The disadvantage of a process being allocated all its resources before beginning its execution is

To ensure no preemption, if a process is holding some resources and requests another resource that cannot be immediately allocated to it

One way to ensure that the circular wait condition never holds is to

A deadlock avoidance algorithm dynamically examines the __________ to ensure that a circular wait condition can never exist.

בקשה לשינוי התשובה / תיקון שאלה gavel

בקשה למחיקת השאלהmood_bad

בקשה לשינוי התשובה / תיקון שאלה

בקשה למחיקת השאלה