Mcq's were 80% from virtualians file.
Questions that I can recall:
1. Which algorithm decreases the wait times for short processes much more than it increases the wait times for long processes? Answer is SJF.
2.Had to provide the shortcomings for this one:
do
{
key=true;
while(key == true)
Swap(lock,key);
Critical section
lock=false;
Remainder section
} while(1);
3. Critical Section: A piece of code in a cooperating process in which the process may
updates shared data (variable, file, database, etc.). Is it true or not?
4. Which command is used to view the current process information?
Questions that I can recall:
1. Which algorithm decreases the wait times for short processes much more than it increases the wait times for long processes? Answer is SJF.
2.Had to provide the shortcomings for this one:
do
{
key=true;
while(key == true)
Swap(lock,key);
Critical section
lock=false;
Remainder section
} while(1);
3. Critical Section: A piece of code in a cooperating process in which the process may
updates shared data (variable, file, database, etc.). Is it true or not?
4. Which command is used to view the current process information?
Comments
Post a Comment
Please give us your feedback & help us to improve this site.