Operating System Mcqs

Page No. 13

Which is the most optimal scheduling algorithm?


aFCFS – First come First served

✖


bSJF – Shortest Job First

✓


cRR – Round Robin

✖


dNone of the mentioned View Answer

✖



In the bakery algorithm to solve the critical section problem ____________


aeach process is put into a queue and picked up in an ordered manner

✖


beach process receives a number (may or may not be unique) and the one with the lowest number is served next

✓


ceach process gets a unique number and the one with the highest number is served next

✖


deach process gets a unique number and the one with the lowest number is served next

✖



A minimum of _____ variable(s) is/are required to be shared between processes to solve the critical section problem.


aone

✖


btwo

✓


cthree

✖


dfour

✖


View Answer two

Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section ____________


aafter a process has made a request to enter its critical section and before the request is granted

✓


bwhen another process is in its critical section

✖


cbefore a process has made a request to enter its critical section

✖


dnone of the mentioned

✖



Mutual exclusion implies that ____________


aif a process is executing in its critical section, then no other process must be executing in their critical sections

✓


bif a process is executing in its critical section, then other processes must be executing in their critical sections

✖


cif a process is executing in its critical section, then all the resources of the system must be blocked until it finishes execution

✖


dnone of the mentioned

✖



Which of the following conditions must be satisfied to solve the critical section problem?


aMutual Exclusion

✖


bProgress

✖


cBounded Waiting

✖


dAll of the mentioned

✓


View Answer All of the mentioned

The segment of code in which the process may change common variables, update tables, write into files is known as ____________


aprogram

✖


bcritical section

✓


cnon – critical section

✖


dsynchronizing

✖


View Answer critical section

A situation where several processes access and manipulate the same data concurrently and the outcome of the execution depends on the particular order in which access takes place is called ____________


adata consistency

✖


brace condition

✓


caging

✖


dstarvation

✖


View Answer race condition

Concurrent access to shared data may result in ____________


adata consistency

✖


bdata insecurity

✖


cdata inconsistency

✓


dnone of the mentioned

✖


View Answer data inconsistency

The code that changes the value of the semaphore is ____________


aremainder section code

✖


bnon – critical section code

✖


ccritical section code

✓


dnone of the mentioned

✖


View Answer critical section code

Goto Page No.

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