2,703 views

3 Answers

Best answer
11 11 votes
In the bitmap approach " every disk block will map with one binary bit (not matter it is free or not)"
total no of disk blocks=disk size/one disk block size = 80GB/8KB =10M
now one disk block contains 64 K bits so it contains info (free /busy) about 64K disk blocks.
so for 1 M blocks = 10M/64K=160 disk blocks.{--ans}
• selected by
7 7 votes
in bit map each block is represented by a single bit 0/1.

so total no. of blocks = 80GB/8KB

                                   = 10M blocks

block size = 8KB hence

it can contain information of  8K*8bit =64K blocks

so required blocks are = 10M / 64K

                                     = 160 blocks
Position:
Show:

Related questions

0 0 votes
0 0 answers
722
722 views
Overflow04 asked Dec 16, 2022
722 views
Which of the following is correct?1)In acyclic-graph directory, a file can have two different relative path name, but not two different absolute path name.2)A dangling po...
3 3 votes
1 answers 1 answer
7.6k
7.6k views
LRU asked Dec 28, 2021
7,586 views
A disk drive has 5000 cylinders, numbered 0 to 4999. The drive is serving arequest at cylinder 143 currently and the previous request was at 125. The disk I/O queue, ...
2 2 votes
0 0 answers
429
429 views
harsh_20 asked Oct 22, 2024
429 views
A file system uses contiguous file allocation. The total size of the available disk space is 100 MB with below allocation in the same orderfile A ( 20MB )file B (30 MB )f...
0 0 votes
0 0 answers
354
354 views
RahulVerma3 asked May 5, 2024
354 views
A unix style I-Node had 10 direct pointers, 1 double indirect, 1 triple indirect and 1 quadruple indirect pointers. Disk block size is 1KB. if the maximum number of bytes...