A system will never enter a deadlocked state if:__________A) the system chooses to ignore the problem altogether.B) the system uses the detection and recovery technique.C) the system uses the deadlock avoidance technique.D) None of the above.

A system will never enter a deadlocked state if the system uses the detection and recovery technique. Thus the correct option is B.

A deadlock in desktop software happens when a procedure or task enters a waiting state as a result of another waiting process holding the requested system resource.

When a group of processes is in a wait state, a deadlock occurs because each process is awaiting a resource that is being held by another waiting process.

The wait-for graph must be maintained by the system in order to detect deadlocks, and the system periodically runs an operation that looks for cycles in the wait-for graph.

There is no method used by the OS to avoid or stop deadlocks. The OS checks the system on a regular basis for any deadlocks in an effort to break them. Therefore, option B is appropriate.

Learn more about the detection and recovery technique, here:

https://brainly.com/question/29107758

#SPJ5

what are the SURVEYING INSTRUMENTS​

Determine the size of memory needed for CD recording of a piece of music, which lasts for 26 minutes, is done with a 20-bit Analog-to-Digital Converter (ADC) in stereo (2 channels), at the rate of 44.1 kSa/s, with the compression factor 6 (allow 10% error margin).