Why is contiguous storage allocation less flexible than linked storage allocatio

Question

Why is contiguous storage allocation less flexible than linked storage allocation?

The following shows the information for a file stored on disk using the  contiguous allocation approach shown in class. Modify the table if block 6 is deleted        from the file.

      file             starting address           length

       f1                         3                         4

The following shows a FAT of a file system. Modify the contents of the FAT if a new block is allocated to file f3 using the first-fit strategy shown in class.

      file name               starting address                                   FAT

            f1                              4                                                 0    6

            f2                              1                                                 1    5

            f3                              7                                                 2    -

                                                                                                3    8    

                                                                                                4    eof

                                                                                                5    3

                                                                                                6    eof

                                                                                                7    0

                                                                                                8    eof

                                                                                                9    -

Use the LOOK strategy shown in class to show the arm movement history     for the following disk requests. We assume the arm is currently moving toward the  smaller track    number side and the current position of the arm is at track 64.

      38, 79, 27, 18, 54, 44, 91, 62

Use the C-SCAN strategy shown in class to show the arm movement history for the following disk requests. We assume the arm is currently moving toward the smaller track    number side and the current position of the arm is at track 64.

      38, 79, 27, 18, 54, 44, 91, 62

Explanation / Answer

contegious storage allocation is less flexible since inserting an element in between reqires shifting of all the elements after that element back by one space..

for example, supppose in an array having elements 10 20 30 40 50 60...

if the element 30 which is at third position has to be removed then the elements 40 50 and 60 needs to be shifted back which is time consuming hence making the process slow..

where as in a linked storage allocation such as linked list, if an element has to be removed from between then all that has to be done is pointer manipulation which is faster then shifting operation, similarly addition of element in btwn is also easy..

Hence is more flexible compared to contegious memory allocation.

Hope my answer helped.. All the best:)   

Related Questions

Navigate

• Browse (All)
• Browse W
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.