Operating System Mcqs

Page No. 22

A system has 3 processes sharing 4 resources. If each process needs a maximum of 2 units then, deadlock ____________


acan never occur

✓


bmay occur

✖


chas to occur

✖


dnone of the mentioned

✖


View Answer can never occur

A computer system has 6 tape drives, with ‘n’ processes competing for them. Each process may need 3 tape drives. The maximum value of ‘n’ for which the system is guaranteed to be deadlock free is?


a2

✓


b1

✖


c3

✖


d4

✖


View Answer 2

Every time a request for allocation cannot be granted immediately, the detection algorithm is invoked. This will help identify ____________


athe set of processes that have been deadlocked

✓


bthe set of processes in the deadlock queue

✖


cthe specific process that caused the deadlock

✖


dall of the mentioned

✖



A deadlock eventually cripples system throughput and will cause the CPU utilization to ______


aincrease

✖


bdrop

✓


cstay still

✖


dnone of the mentioned

✖


View Answer drop

What is the disadvantage of invoking the detection algorithm for every request?


aoverhead of the detection algorithm due to consumption of memory

✖


bexcessive time consumed in the request to be allocated memory

✖


cconsiderable overhead in computation time

✓


dall of the mentioned

✖



If deadlocks occur frequently, the detection algorithm must be invoked ________


ararely

✖


bfrequently

✓


crarely & frequently

✖


dnone of the mentioned

✖


View Answer frequently

If the wait for graph contains a cycle ____________


athen a deadlock does not exist

✖


bthen a deadlock exists

✓


cthen the system is in a safe state

✖


deither deadlock exists or system is in a safe state

✖



An edge from process Pi to Pj in a wait for graph indicates that ____________


aPi is waiting for Pj to release a resource that Pi needs

✓


bPj is waiting for Pi to release a resource that Pj needs

✖


cPi is waiting for Pj to leave the system

✖


dPj is waiting for Pi to leave the system

✖



The wait-for graph is a deadlock detection algorithm that is applicable when ____________


aall resources have a single instance

✓


ball resources have multiple instances

✖


call resources have a single 7 multiple instances

✖


dall of the mentioned

✖



What is the solution to starvation?


athe number of rollbacks must be included in the cost factor

✓


bthe number of resources must be included in resource preemption

✖


cresource preemption be done instead

✖


dall of the mentioned

✖



Goto Page No.

Page 22 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