GATE CSE 2007 | GATE CSE Year Wise Previous Years Questions

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes:

 /* P1 */
  while(true){
  want s1=true;
  while(wants2 == true){
  /* Critical Section */
   wants1 = false;
  }
  /* Reminder Section */
 }

 /* P2 */
  while(true){
  want s2=true;
  while(wants1 == true){
  /* Critical Section */
   Wants2 = false;
  }
  /* Reminder Section */
 }

Here wants1 and wants2 are shared variables, which are initialized to false. Which one of the following statements is TRUE about the above construct?

It does not ensure the mutual exclusion.

It does not ensure bounded waiting.

It requires that processes enter the critical section in strict alternation

It does not prevent deadlocks, but ensures mutual exclusion

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

An operating system uses Shortest Remaining Time first $$(SRT)$$ process scheduling algorithm. Consider the arrival times and execution times for the following processes: GATE CSE 2007 Operating Systems - Process Concepts and Cpu Scheduling Question 25 English

GATE CSE 2007 Operating Systems - Process Concepts and Cpu Scheduling Question 25 English

What is the total waiting time for process $$P2?$$

$$5$$

$$15$$

$$40$$

$$55$$

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Consider the following C function:

int f(int n)
{
   static int r = 0;
   if(n <= 0) return 1;
   if(n>3)
   {
     r = n;
     return f(n-2)+2;
   }
  return f(n-1)+r;
}

What is the value of f(5)?

GATE CSE 2007

MCQ (Single Correct Answer)

-0.6

Consider the following finite state automation GATE CSE 2007 Theory of Computation - Finite Automata and Regular Language Question 58 English

The minimum state automation equivalent to the above $$FSA$$ has the following number of states

$$1$$

$$2$$

$$3$$

$$4$$

PREVIOUS NEXT

GATE CSE Papers

2024