In the bakery algorithm to solve the critical section problem ____________(a) each process is put into a queue and picked up in an ordered manner(b) each process receives a number (may or may not be unique) and the one with the lowest number is served next(c) each process gets a unique number and the one with the highest number is served next(d) each process gets a unique number and the one with the lowest number is served nextI got this question in an online interview.My question comes from The Critical Section (CS) Problem and Solutions topic in portion Process Synchronization of Operating System

In the bakery algorithm to solve the critical section problem ________

1.	In the bakery algorithm to solve the critical section problem ____________(a) each process is put into a queue and picked up in an ordered manner(b) each process receives a number (may or may not be unique) and the one with the lowest number is served next(c) each process gets a unique number and the one with the highest number is served next(d) each process gets a unique number and the one with the lowest number is served nextI got this question in an online interview.My question comes from The Critical Section (CS) Problem and Solutions topic in portion Process Synchronization of Operating System
Answer» The correct option is (B) each PROCESS receives a NUMBER (may or may not be unique) and the one with the lowest number is SERVED next Explanation: None.

Discussion

No Comment Found

Related InterviewSolutions

The shrinking phase is a phase in which?(a) A transaction may obtain locks, but does not release any(b) A transaction may obtain locks, and releases a few or all of them(c) A transaction may release locks, but does not obtain any new locks(d) A transaction may release locks, and does obtain new locksThe question was asked during an online interview.The origin of the question is Atomic Transactions in chapter Process Synchronization of Operating System
The growing phase is a phase in which?(a) A transaction may obtain locks, but does not release any(b) A transaction may obtain locks, and releases a few or all of them(c) A transaction may release locks, but does not obtain any new locks(d) A transaction may release locks, and does obtain new locksI have been asked this question during an online interview.Origin of the question is Atomic Transactions topic in division Process Synchronization of Operating System
The two phase locking protocol consists of ____________(a) growing & shrinking phase(b) shrinking & creation phase(c) creation & growing phase(d) destruction & creation phaseThe question was posed to me during an interview for a job.Asked question is from Atomic Transactions topic in portion Process Synchronization of Operating System
A locking protocol is one that ____________(a) governs how locks are acquired(b) governs how locks are released(c) governs how locks are acquired and released(d) none of the mentionedI have been asked this question in semester exam.Question is taken from Atomic Transactions topic in portion Process Synchronization of Operating System
Serializable schedules are ones where ____________(a) concurrent execution of transactions is equivalent to the transactions executed serially(b) the transactions can be carried out one after the other(c) a valid result occurs after execution transactions(d) none of the mentionedThe question was posed to me in class test.The query is from Atomic Transactions topic in section Process Synchronization of Operating System
Consider a transaction T1 that committed prior to checkpoint. The record appears in the log before the record. Any modifications made by T1 must have been written to the stable storage either with the checkpoint or prior to it. Thus at recovery time ____________(a) There is a need to perform an undo operation on T1(b) There is a need to perform a redo operation on T1(c) There is no need to perform an undo and redo operation on T1(d) All of the mentionedI had been asked this question during a job interview.This question is from Atomic Transactions topic in division Process Synchronization of Operating System
The system periodically performs checkpoints that consists of the following operation(s) ____________(a) Putting all the log records currently in main memory onto stable storage(b) putting all modified data residing in main memory onto stable storage(c) putting a log recordonto stable storage(d) all of the mentionedI have been asked this question in a national level competition.I need to ask this question from Atomic Transactions in section Process Synchronization of Operating System
The undo and redo operations must be _________ to guarantee correct behaviour, even if a failure occurs during recovery process.(a) idempotent(b) easy(c) protected(d) all of the mentionedThe question was asked in an interview.This interesting question is from Atomic Transactions topic in chapter Process Synchronization of Operating System
An actual update is not allowed to a data item ____________(a) before the corresponding log record is written out to stable storage(b) after the corresponding log record is written out to stable storage(c) until the whole log record has been checked for inconsistencies(d) all of the mentionedThe question was asked during a job interview.Asked question is from Atomic Transactions topic in division Process Synchronization of Operating System
In the write ahead logging a _____________ is maintained.(a) a memory(b) a system(c) a disk(d) a log recordThe question was asked at a job interview.Asked question is from Atomic Transactions topic in division Process Synchronization of Operating System

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment