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

ANS --1:-

Option c. 266 KB is correct because explanation is shown below -

With the 10 direct addresses we get file size 10 KB because all bocks size are 1 KB so, every direct address will contain 1 KB. With a single indirect address assume 32 bit address, then we can point to one block of addresses that means 1 KB / 4 bytes = 256 addresses or block so, 256 * 1024 bytes = 256 KB address needed for indirect addresses. Therefore we have largest possible file size = 256 KB + 10 KB = 266 KB.

-

Other options are wrong:-

Option a. 466 KB is wrong because after calculation largest possible file size is 266 KB.

Option b. 566 KB is wrong because after calculation largest possible file size is 266 KB.

Option d. 366 KB is wrong because after calculation largest possible file size is 266 KB.

-

-

ANS --2:-

Option a, b and c are correct.

option a is correct because in linked list allocation, one block contain address of next block not any other so, it is fast for contiguous but not for random because if we want to access last block then it will move one by one block from which speed will be extremely slow.

option b is correct because linked list means contain next element address so, each block only contain address of next block and in every block first word contain address of next block but rest of the word contain data.

option c is correct because pointer take some bytes from which some space is lost in every block that's why the amount of data in each block not in the form of power of 2.

-

Other option is wrong:-

Option d is wrong because there is no space lost in linked list allocation therefore no external fragmentation is available in linked list allocation but internal fragmentation is remain in the file.

-

-

ANS --3:-

Option c. sequencial, direct or indexed sequential is correct because file can be organized on magnetic disks as sequentially, direct or indexed sequentially but not indirect because magnetic disk used as secondry storage and has less acces time.

-

Other options are wrong:-

Option a is wrong because file cannot be organized in indirect way but can organized as sequencial or direct on magnetic disks.

Option b is wrong because file cannot be organized as indexed direct or indexed indirect or random but can organized indexed sequencial on magnetic disks.

Option d is wrong because  file cannot be organized as random or indirect but can organized sequencial on magnetic disks.

-

-

ANS --4:-

Option a. 16 MB is correct because disk block size is 1 MB and i-node has only direct addresses that is 16 so, as block size is 1 MB then every direct address will contain 1 MB. Therefore largest possible file size = 16 * 1 MB = 16 MB.

-

Other options are wrong:-

Option b. 19 MB is wrong because after calculation largest possible file size is 16 MB.

Option c. 17 MB is wrong because after calculation largest possible file size is 16 MB.

Option d. 18 MB is wrong becauseafter calculation largest possible file size is 16 MB.