Blog

When using the resource allocation graph, what feature identifies deadlocks?

________________ involves moving part or all of a process from main memory to disk.

The portion of the Operating System that selects the next process to run is called the __________.

Are the real-time periodic tasks A, B, and C schedulable if A arrives every 10 units and takes 4 units, B arrives every 20 units and takes 3 units, and C arrives every 5 units and takes 3 units. Show all the steps.

Most round-robin schedulers use a fixed size quantum. What is a disadvantage of a long quantum?

In interprocess communication (IPC), system calls are used in

How many blocks are required for a 169,353-byte file with 8 k clusters?

For a Windows system, what is the difference between a cumulative update and a build?

Instruction traces are a series of what values over time?

Assume we are dealing with a system that places programs in memory following a first-fit dynamic partitioning scheme. At some point in time, we have just loaded a program that needed 48 MB, and memory is as depicted below (not to scale). Shaded (blue) regions are full, blanks are holes (with sizes in megabytes as indicated); the cross-hatched region is the location of the most recently loaded program, it is at least 48 MB in size. Show, on the memory diagram, where the following sequence of new programs will be positioned and the resultant holes. The programs require in order 32MB, 7 MB, 10 MB, 5 MB, and 35 MB of memory. Show memory at each modification.