From OSs File system management we know that Free blocks can be managed following two strategies:

a) Bit Vector (Bit Map) and b) Linked list.

1. Explain the two strategies and also write down the differences.

2. Assume that in a computer system the hard disk size is 64 GB and block size is 4 KB. It takes 32 bits to write the address of a block

2a) How many blocks are there in the hard disk?

2b) Calculate the size of the bit map in bits.

2c) How many blocks you will need to store the bit map?

2d) Calculate the number of block addresses a block can hold.

2e) Calculate the number of blocks needed to keep the addresses of all the FREE blocks. assume 98% of the total blocks are free.

2f) Compare the results found in c) with that in e) and right your analysis by comparing two methods