cs604 mid term current paper fall December 2011

[Vuhelper]

PAPER#1
Total 23 Questions
MCQs 16
1. List and define the different metrics by which might evaluate a
scheduler (List at least 4). 5 marks
2. Write brief the multilevel feedback queue scheduling. 5 marks
3. Assumption made while formulating a solution to the critical
section problem. 2 marks
4. There are many commands. Write the method through which
these commands can communicate with each other. 3 marks
5. Write Difference between SJF and Shortest Remaining Time First
Scheduling algorithm. 3 marks
6. Write formula for calculating waiting time in preemptive Shortest
Job First Algorithm. 2 marks
7. Define race condition and how prevent this condition. 2 marks

PAPER#2
Question No: 17 ( Marks: 2 )
What is Convoy Effect?

Question No: 18 ( Marks: 2 )
What are the common data structures in Bakery Algorithm?

Question No: 19 ( Marks: 2 )
How a pipe can be created?

Question No: 20 ( Marks: 3 )
Define Progress and Bounded Waiting.

Question No: 21 ( Marks: 3 )
What is Starvation and how it occures

Question No: 22 ( Marks: 5 )
What are the advantages of Round Robin Scheduling Algorithm?

Question No: 23 ( Marks: 5 )
Analyze the following algorithm to solve the critical section problem
and explain whether it satisfies the Mutual Exclusion Characteristic

Flag[i] = True;
Turn = j;
do{

while(Flag[j] = True && turn==j);
critical section
Flag[i] = False;
remainder section } While(1)