Scribd
Upload
11 views1 page

AMAN29

The document outlines an experiment focused on implementing various file storage allocation techniques, including contiguous allocation using arrays, linked-list allocation, and indexed allocation. It provides an algorithm for indexed allocation and includes a sample C program that prompts the user for a filename and index block, then collects child index block data. The program concludes by displaying the filename alongside its corresponding index block.

Uploaded by

itmgida186
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
11 views1 page

AMAN29

The document outlines an experiment focused on implementing various file storage allocation techniques, including contiguous allocation using arrays, linked-list allocation, and indexed allocation. It provides an algorithm for indexed allocation and includes a sample C program that prompts the user for a filename and index block, then collects child index block data. The program concludes by displaying the filename alongside its corresponding index block.

Uploaded by

itmgida186
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

EXPERMENT NUMBER -4

Object :-

Implement file storage allocation technique:

i. Contiguous(using array)

ii. Linked-list(using linked-list)

iii. Indirect allocation (indexing)

i) FILE ALLOCATION TECHNIQUE-INDEXED ALLOCATION

ALGORITHM:

Step 1: Start the Program

Step 2:Obtain the required data through char and int datatypes.

Step 3:Enter the filename, index block.

Step 4: Print the file name index loop.

Step 5:Fill is allocated to the unused index blocks

Step 6: This is allocated to the unused linked allocation.

Step 7: Stop the execution.

PRORAM CODING

#Include<stdio.h>

void main()

char a[10];

int i,ib,cib[10];

printf("\n enter the file name:");

scanf("%s",a);

printf("\n index block:");

scanf("%d",&ib);

for(i=1;i<=5;i++)

printf("\n enter the child of index block %d:", i);

scanf("%d",&cib[i]);

printf("\n the list of files\t index block\n");

printf("%s\t\t%d",a,ib);

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy