Bissoy.com
Doctors Medicines MCQs Q&A

For any type of access, contiguous allocation requires ______ access to get a disk block.

For any type of access, contiguous allocation requires ______ access to get a disk block. Correct Answer only one

We can easily keep the initial address of the file in memory and calculate immediately the disk address of the ith block and read it directly.

Related Questions

Which of the following are true? (i) A programming language option does not permit global variables of any king and has no nesting of procedures/functions, but permits recursion can be implemented with static storage allocation (ii) Multi-level access link (or display) arrangement is needed to arrange activation records-only if the programming language being implemented has nesting of procedures/function (iii) Recursion in programming languages cannot be implemented with dynamic storage allocation (iv) Nesting of procedures/functions and recursion require a dynamic heap allocation scheme and cannot be implemented with a stack-based allocation scheme for activation records (v) Languages which permit a function to return a function as its result cannot be implemented with a stack-based storage allocation scheme for activation records.
An operating system uses the Banker’s algorithm for deadlock avoidance when managing the allocation of three resource types X, Y, and Z to three processes P0, P1, and P2. The table given below presents the current system state. Here, the Allocation matrix shows the current number of resources of each type allocated to each process and the Max matrix shows the maximum number of resources of each type required by each process during its execution.   Allocation Max   X Y Z X Y Z P0 0 0 1 8 4 3 P1 3 2 0 6 2 0 P2 2 1 1 3 3 3   There are 3 units of type X, 2 units of type Y and 2 units of type Z still available. The system is currently in a safe state. Consider the following independent requests for additional resources in the current state: REQ1: P0 requests 0 units of X, 0 units of Y and 2 units of Z REQ2: P1 requests 2 units of X, 0 units of Y and 0 units of Z Which one of the following is TRUE?
In which type of allocation method each file occupy a set of contiguous block on the disk?
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512 bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797 KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>. What is the cylinder number of the last sector of the file, if it is stored in a contiguous manner?
Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383) and each cylinder contains 64 sectors(0-63). Data storage capacity in each sector is 512 bytes. Data are organized cyclinder-wise and the addressing format is . A file of size 42797KB is stored in the disk and the starting disk location of the file is <1200,9,40>. What is cylinder number of the last sector of the file, if it is stored in a contiguous manner?
Pyroxenes are class of silicate minerals, which exhibit a polymeric chain structure, as shown below
S-Block and P-Block Elements mcq question image
Its simplest repeating unit is
Your Windows 2000 Server computer contains a stripe set with parity on a four-disk array. You convert the stripe set with parity to a dynamic RAID-5 volume. Six months later, users report that disk access on the server is slower than it had been on the previous day, You use Disk Management and discover that the status of the third disk in the array is Missing. You want to recover the failed RAID-5 volume. What should you do first?
Your Windows 2000 Server computer contains a stripe set with parity on a four-disk array. You convert the stripe set with parity to a dynamic RAID-5 volume. Six months later, users report that disk access on the server is slower than it had been on the previous day. You use Disk Management and discover that the status of the third disk in the array is missing. You want to recover the failed RAID-5 volume. What should you do first?
Suppose you have a Linux file system where the block size is 2K bytes, a disk address is 32 bits, and an i-node contains the disk addresses of the first 12 direct blocks of file, a single indirect block, and a double indirect block. Approximately, what is the largest file that can be represented by an i-node?  
In a file allocation system, which of the following allocation scheme(s) can be used if no external fragmentation is allowed? I. Contiguous II. Linked III. Indexed