Question

Please help me with 4 questions in 2 pictures below.

An i-nodes has contained 10 direct addresses and 1 single in-directed addresses of 4 bytes each and all disk blocks are 1KB. What is the largest possible file? Select one: a. 466 KB b. 566 KB C. 266 KB d. 366 KB Which of these statements about the Linked List Allocation are true? Select one or more: a. Random access is extremely slow b. First word of each block is used as pointer to the next one and the rest of the block is for data c. The amount of data storage in a block is not a power of two because the pointer takes up a few bytes d. Internal and External fragmentation are generated On magnetic disks, files can be organized in one of three ways; Select one: a. sequential, indirect, or direct b. indexed direct, indexed indirect, or random C. sequential, direct, or indexed sequential O d. sequential, random, or indirect

Answer 1

(1) Given block size = MKB block addrey fise = abytes each block Contains block size 1 KB 10 - 2 og block addren size toutes 21 8 2 addresses 7 ên direct addreses. Given There are 10 direer addresses t l in-direy address => #of blocks 8 10+q = 266 blocks each block size = 1kB Maximum possible file size = 266 Al KB blocks x block-sise of

Maximum file size = 266 KB (2). cinked list allocation each block is wed to anotha contains address of Toption - 6 point to block (ie, each block another block LOCK) -b is Correet so

There are (3) strategies three file allocation 1. Squential ( Contiguous) allocation 2. Direer (Random) allocating 3. Indexed Sequential

fopt tion-c). c i Correer 4. Given there are 16 direen blocks & block fize = 1 MB File size = #of blocks x blockcha 16x1MB 16 MB