Banker’s algorithm for resource allocation deals with

Related MCQs

• In memory management :A-Fixed allocation policy, B-Variable allocation policy: 1-It gives a process a fixed number of frames in main memory within which to execute. 2-It allows the number of page frames allocated to a process to be varied over the life time of the process. 3-In it a number of allocated frames are decided at initial load time.
• Match the following for file system architecture : A-Basic file system, B-Logical I/O module, 1- Deals with blocks of data, 2- Deals with file records, 3- Provides general purpose record I/O capacity.
• In secondary storage management, “If allocation of file is made on an individual block basis and each block contains a pointer to the next block in the chain” then it is referred as
• External fragmentation solved by which allocation?
• The allocation map
• The memory allocation scheme subject to external fragmentation is
• In disk scheduling, SCAN algorithm states
• Dijkstra’s banker’s algorithm in an operating-system solves the problem of
• A disk scheduling algorithm in an operating system causes the disk arm to seek back and forth access the disc surface servicing all request in its path, this is a
• The FIFO algorithm