Select the incorrect statement about the base-limit approach to relocation:

Suppose there are two programs A and B, and the Operating System uses swapping without memory abstraction. Which of the following situations cannot happen?

For each of these sentences, select the real-time scheduling algorithm to which it applies:

In Priority Scheduling for interactive systems, how can the scheduler ensure that low priority processes get a chance to run?

Consider the situation in Slide 11 of the "scheduling algorithms for batch systems" lecture. What is the average turnaround time for FCFS and SJF?

Consider the solution to the readers and writers problem based on semaphores (slides 6-7). Why do we need to check the variable rc in the following line of the reader procedure?

if (rc == 1) down(&db);

What causes a deadlock in the naive solution to the dining philosophers problem (slide 5)?

Which resources are shared among the philosopher in the dining philosophers problem?

Select the incorrect statements about monitors: