833 views

1 Answer

Best answer
1 votes
1 votes

Given : $32$ bits as disk block address size $\therefore$ conclude that there are $2^{32}$ blocks in the disk.

Now for a free space bit vector considering maximum possible file size.

Total space for free blocks = $2^{32}$ bits  $= \ 2^{29}$ bytes
Total blocks we need to store this info      $=\Large {\frac{2^{29}}{2^{12}}}$ $=2^{17}$ blocks

Answer given as : $2^{17}= \color{Red} {1024 \times 128}$

selected by

Related questions

2 votes
2 votes
0 answers
1
Shashank Chavan asked Nov 30, 2015
1,066 views
SHA 1 hash algo. create N-bit message digest out of a message of 512bit blocks. So is has a message digest of_?A.4 words of 32bitsB.5 words of 32bitsC.16 words of 32bitsD...
0 votes
0 votes
1 answer
2
focus _GATE asked Jun 5, 2015
6,539 views
16 KB, 4-way set-associative cache, 32-bit address, byte addressable memory, 32-byte cache blocks/linesHow many tag bits?Where would you find the word at address 0x200356...
0 votes
0 votes
1 answer
4
Sanjay Sharma asked Jun 22, 2016
1,240 views
In Bit vector algorithm for free space management the free space bit map for free disk blocks of 1,2,3,7,9 would be0111000101100011101011110001010000111010