Awesome q2a theme
0 votes
63 views
Consider a file currently consisting of 100 blocks. Assume that the file-control block (and the index block, in the case of indexed allocation) is already in memory. In the contiguous-allocation case, assume that there is no 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. Calculate how many disk I/O operations are required for contiguous, linked, and indexed (single-level) allocation strategies, if one block is added at the beginning.


1.
201, 1, 1


2.

101, 52, 1


3.

1, 3, 1


4.

198, 1,0


Please give explaination for above question.
in Operating System by (135 points) | 63 views

Please log in or register to answer this question.

Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Top Users 2020 Aug 10 - 16
  1. Arkaprava

    40 Points

  2. jayeshasawa001

    11 Points

  3. Nilabja Sarkar

    8 Points

  4. siddharths067

    4 Points

  5. 404 found

    3 Points

  6. shashankrustagi2021

    2 Points

  7. Ashutosh777

    2 Points

  8. Mellophi

    2 Points

  9. sparshgarg

    1 Points

  10. sonam13

    1 Points

Weekly Top User (excluding moderators) will get free access to GATE Overflow Test Series for GATE 2021
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Top Users Aug 2020
  1. Mellophi

    152 Points

  2. Ashutosh777

    78 Points

  3. anurag sharma

    48 Points

  4. Arkaprava

    40 Points

  5. jayeshasawa001

    16 Points

  6. Kushagra गुप्ता

    15 Points

  7. Shaik Masthan

    13 Points

  8. srestha

    13 Points

  9. shashankrustagi2021

    12 Points

  10. munishchaturvedi

    10 Points

7,745 questions
1,844 answers
11,190 comments
95,103 users