Lets say, one day its a very sunny day! with a tree with all its leaves except 1, is still growing. Lets say the next day all the leaves blow off because of wind, because its a rainy grey day. But that day that one leaf finally grows, ( your that one leaf ) And well all the leaves that blew off crumbled. But when that one leaf fell ( as in you ) it didn't just fall apart it broke. ( As in you broke down and cried ) Lets say this happened Saturday night. You do know what i was trying to to tell you guys, right?

Consider a file currently consisting of 200 blocks. assume that the file control block (and the index block in the case of indexed allocation) is already in memory. calculate how many disk i/o operations are required for contiguous, linked, and indexed (single-level) allocation strategies, for each of the conditions listed below. in the contiguous-allocation case, assume that there is not room to grow at the beginning but there is room to grow at the end. also assume that the block information to be added is stored in memory.

What is the answer to these problems 30 pt

Acar weighs 15,000 n, and its tires are inflated to a pressure of 190kpa. how large is the area of the car's tires that are in contact with the road?