♠ Posted by Unknown in CS604 Operating System solved Quiz No. 2 at 06:34
my latest solved quiz No. 2 CS604 Operating System
The section of code after the critical section is called
________
Entry section
Remainder section
Exit section
_____________
Algorithm is used for solving n-process critical section problem.
Bankers
Bakery
Babbles
None
of the given
A
solution to the critical section problem must satisfy the following
requirements except:
Progress
Mutual
Exclusion
Bounded
Waiting
Race
Condition
___________
is used in real time operating systems.
Non-preemptive
scheduling
Preemptive
scheduling
Dispatching
scheduling
FCFS
scheduling
The
scheduling of _____________ are done by the operating system.
Kernel
threads
User
level threads
Both
None
of these
The section of code after the critical section is called
……………
A
major problem with priority scheduling algorithms is _________________.
Select
correct option:
Deadlock
Aging
Starvation
None
of these
___________
is the basis of queuing theory which is branch of mathematics used to analyze
systems involving queues and servers.
Little’s
formula
Deterministic
theory
Queuing
theory
Queuing
analysis
Clock interrupt handler is example of ……………
EAGAIN
EINVAL
ENOMEM
None of the above
Binary
semaphore whose integer value cannot be > 1; can be simpler to implement.
Counting
Binary
Mutex
Bounded
buffer
==================================================
==================================================
If you have any suggestion, please feel free to contact and
comment us.
We will consider your positive response and suggestion.
==================================================
1 comments:
Q. Clock interrupt handler is example of ……………
EAGAIN
EINVAL
ENOMEM
None of the above🤔
Post a Comment