Suppose a UNIX file system has some constraints–say, 2 KB blocks and 8B disk addresses. What is the maximum file size if inodes contain 13 direct entries, and one single, double, and triple indirect entry each?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Suppose a UNIX file system has some constraints–say, 2 KB blocks and 8B disk addresses. What is the maximum file size if inodes contain 13 direct entries, and one single, double, and triple indirect entry each?
This explains it for you:
http://www.cis.temple.edu/~ingargio/cis307/readings/stable.html
Swap 8KB for your 2KB, and adjust the entries for the smaller block size.
It’s not clear to me from your question if the 13 entries include the singles, doubles and triples, or if they are separate, but that should be easy to adjust — just change the 10 in the expression to a 13.
I think I’ve adjusted all the math correctly… double check it =| Hope this isn’t homework I did for you 😉