Crowdly

Add to Chrome

Universities
moodle.royalholloway.ac.uk
25-26 CS2850: Operating Systems

25-26 CS2850: Operating Systems

Looking for 25-26 CS2850: Operating Systems test answers and solutions? Browse our comprehensive collection of verified answers for 25-26 CS2850: Operating Systems at moodle.royalholloway.ac.uk.

Get instant access to accurate answers and detailed explanations for your course questions. Our community-driven platform helps students succeed!

This question is about free memory handling. For each of the following statements, select the algorithms to which it applies:

It selects the first hole in the list that fits the process

It selects the first hole in the list that fits the process, after the one used for the previous process

It selects the biggest hole in the list that fits the process

It keeps separate lists for processes and holes

It selects the smallest hole in the list that fits the process

View this question

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

A and B are both on the disk

A is in memory and B is on the disk

A and B are both in memory in distinct memory areas

View this question

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

The system responds to events that occur at regular intervals

The system responds to events that occur unpredictably

Deadlines must be met

Deadlines can occasionally be missed

View this question

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

Round-robin is used within each priority class

Processes are grouped into priority classes

Priorities are decreased at each clock interrupt

Each process is assigned a time quantum it is allowed to run

View this question

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

5 and 5

13 and 11

14 and 11

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

Some philosophers do not put their forks back on the table

All the philosophers eat at the same time

All the philosophers take their left forks at the same time

View this question

For each statement, select to which scheduling type it applies:

it is mainly used in batch systems

it is also called short-term scheduling

it selects processes to be moved from main memory to the disk

View this question

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?