Which type of memory has the fastest access rate?

Which of the following page replacement algorithms can exhibit Belady's anomaly?

Lossy and lossless are classifications of compression algorithms

Which scheduling algorithm is a starvation-free scheduling algorithm?

What is the non-preemptive scheduling algorithm?

Which memory management technique is used to temporarily remove non-active programs from the main memory of a computer system?

What is the result of the following program?

   main()
  {
     if(fork()>0)
     sleep(100);
  }

What is a trap in an operating system?

The following program consists of 3 concurrent processes and 3 binary semaphores. The semaphores are initialized as S0 = 1, S1 = 0, S2 = 0.

Process P0

while(true)
{

   wait(S0);
   print '0';
   release(S1);
   release(S2);
}
Process P1
wait(S1);
release(S0);

Process P2
wait(S2);
release(S0);

Consider three concurrent processes P1, P2 and P3 as shown below, which access a shared variable D that has been initialized to 100.

The process are executed on a uniprocessor system running a time-shared operating system. If the minimum and maximum possible values of D after the three processes have completed execution are X and Y respectively, then the value of Y–X is