A directed graph which represents the deadlock is called :

1.	A directed graph which represents the deadlock is called :
A.	cycle graph
B.	deadlock graph
C.	wait-for graph
D.	none of the above
Answer» D. none of the above

Discussion

No Comment Found

Related MCQs

NTFS stands for __________ and it was developed by ________.
In MS-Word, you can use ______ to navigate a long document through small pictures of each page.
Consider a system where each file is associated with a 16-bit number. For each file, each user should have the read and write capability. How much memory is needed to store each user’s access data?
On computers where there are multiple operating system, the decision to load a particular one is done by _____.
Consider the Unix i-node which uses 12 direct DBAs, 1 single indirect, 1 double indirect, 1 triple indirect. The disk block address requires 32 bits and disk block size is 1 KB. What is the maximum file size?
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed?I. ContiguousII. LinkedIII. Indexed
Consider the following statements :(a) UNIX provides three types of permissions* Read* Write* Execute(b) UNIX provides three sets of permissions* permission for owner* permission for group* permission for othersWhich of the above statement/s is/are true ?
Consider the following programmain(){fork() ;fork() ;fork( ) ;}How many new processes will be created ?
Consider a linear list based implementation in a file system. Each directory is a list of nodes, where each node contains the file name along with the file metadata, such as the list of pointers to the data blocks. Consider a given directory foo.Which of the following operations will necessarily require a full scan of foo for successful completion?
File operations that manipulate the ‘open-count’ maintained for each entry in open file table include:

A directed graph which represents the deadlock is called :

Discussion

No Comment Found

Related MCQs

Reply to Comment