Academic Integrity: tutoring, explanations, and feedback — we don’t complete graded work or submit on a student’s behalf.

True/false If a resource-allocation graph has a cycle, the system must be in a d

ID: 3572790 • Letter: T

Question

True/false

If a resource-allocation graph has a cycle, the system must be in a deadlocked state.

The banker's algorithm is useful in a system with multiple instances of each resource type.

Fragmentation does not occur in a paging system.

There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table.

In general, virtual memory decreases the degree of multiprogramming in a system.

RAID level 0 provides no redundancy.

Disk controllers do not usually have a built-in cache.

A relative path name begins at the root.

Explanation / Answer

1. If a resource-allocation graph has a cycle, the system must be in a deadlocked state. (False)

(If a resource allocation graph has a cycle, it means that there is a possibility of deadlock but it is not that the system is in deadlock. If a resource allocation graph contains a cycle and if each resource contains only a single instance the system is said to be in deadlock.

If a resource-allocation graph does contain cycles and each resource category contains only a single instance, then a deadlock exists.)

2. The banker's algorithm is useful in a system with multiple instances of each resource type. (True)

(Banker’s algorithm is used to avoid deadlock when a resource in the system has multiple instances)

3. Fragmentation does not occur in a paging system. (False)

(During dynamic memory allocation when there are multiple free spaces but are not able to service a particular request, a fragmentation occurs, this does not occur in a paging system)

4. There is a 1:1 correspondence between the number of entries in the TLB and the number of entries in the page table. (False)

(TLB stores a cache of recently used mappings from the page table, hence there will always be a one-to-one correspondence between TLB and Page Table)

5. In general, virtual memory decreases the degree of multiprogramming in a system. (False)

(With Virtual Memory we can execute multiple programs at a time, hence it increases the degree of multiprogramming.)

6. RAID level 0 provides no redundancy. (True)

(RAID level 0 the data is split up into block or strips, it does not provide redundancy and ensures high performance by using multiple disks, must contain at least 2 disks )

7. Disk controllers do not usually have a built-in cache. (False)

(A Disk-controller is a controller circuit which is used to communicate with the hard disk or any kind of external memory, it does not have a built-in cache.)

8. A relative path name begins at the root. (False)

(The path that begins with root directory is called Absolute path, and just giving the file name is relative paths)