Operating System Mcqs

Page No. 21

The Banker’s algorithm is _____________ than the resource allocation graph algorithm.


aless efficient


bmore efficient


cequal


dnone of the mentioned


View Answer less efficient

The resource allocation graph is not applicable to a resource allocation system ____________


awith multiple instances of each resource type


bwith a single instance of each resource type


csingle & multiple instances of each resource type


dnone of the mentioned



If no cycle exists in the resource allocation graph ____________


athen the system will not be in a safe state


bthen the system will be in a safe state


call of the mentioned


dnone of the mentioned



All unsafe states are ____________


adeadlocks


bnot deadlocks


cfatal


dnone of the mentioned


View Answer not deadlocks

A system is in a safe state only if there exists a ____________


asafe allocation


bsafe resource


csafe sequence


dall of the mentioned


View Answer safe sequence

A state is safe, if ____________


athe system does not crash due to deadlock occurrence


bthe system can allocate resources to each process in some order and still avoid a deadlock


cthe state keeps the system protected and safe


dall of the mentioned



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


aresource allocation state


bsystem storage state


coperating system


dresources



Given a priori information about the ________ number of resources of each type that maybe requested for each process, it is possible to construct an algorithm that ensures that the system will never enter a deadlock state.


aminimum


baverage


cmaximum


dapproximate


View Answer maximum

Each request requires that the system consider the _____________ to decide whether the current request can be satisfied or must wait to avoid a future possible deadlock.


aresources currently available


bprocesses that have previously been in the system


cresources currently allocated to each process


dfuture requests and releases of each process



‘m’ processes share ‘n’ resources of the same type. The maximum need of each process doesn’t exceed ‘n’ and the sum of all their maximum needs is always less than m+n. In this setup, deadlock ____________


acan never occur


bmay occur


chas to occur


dnone of the mentioned


View Answer can never occur

Goto Page No.

Page 21 of 108

Alphabetical MCQs Categories

Here below You find all kind of categories of MCQs in alphabetical order.


"Comprehensive Collection of MCQs: Alphabetically Organized by Subject"

"Discover an extensive collection of multiple-choice questions (MCQs) neatly categorized by subject from A to Z. This resource is designed for anyone eager to explore various topics in a straightforward and organized manner. Whether you're a student preparing for exams, an educator seeking supplementary materials, or simply curious about different subjects, this compilation offers a convenient way to learn and assess your knowledge. With questions arranged alphabetically, navigation is effortless, allowing you to delve into subjects of interest at your own pace. Engage, learn, and expand your understanding with this accessible and comprehensive repository of MCQs!"


BolPakistan

bolpakistan.com.pk includes Job Mcqs and Pak Mcqs is the Top Largest Mcqs Forum in World, in which you can read Mcqs of All Subjects, PPSC test preparation, FPSC, NTS and PPSC PAST PAPERS, PPSC PAST MCQS. A Collection of Repeated MCQs for JOBs seekers.

Copyright © 2024, Designed & Developed by BolPakistan