With linked allocation, each file is a linked list of disk blocks; the disk blocks may be scattered anywhereon the disk. The directory contains a pointer to the first and last blocks of the file. Each block contains a pointerto the next block. Refer to the illustration below. Need help to fill in the codes in void main() --- #include<stdio.h>#include<stdlib.h>#define TOTAL_DISK_BLOCKS 32#define TOTAL_DISK_INODES 8int blockStatus[TOTAL_DISK_BLOCKS]; // free = 0int blockList[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES]; // list of blocks of a filestruct file_table {char fileName[20];int fileSize;struct block *sb;};struct file_table fileTable[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES];struct block {int blockNumber;struct block *next;};int AllocateBlocks(int Size) {---}void main(){int i = 0, j = 0, numFiles = 0, nextBlock= 0, ret = 1;char s[20]; struct block *temp;---for(i = 0; i < numFiles; i++) {---ret = AllocateBlocks(fileTable[i].fileSize);---}---//Seed the pseudo-random number generator used by rand() with the value seedsrand(1234);---} File NameFile size (kB)data.csv3info.docmusic.mp34Block Number23467.Linked list allocationFile Name File size (kB) Start nodedata.csvinfo.docmusic.mp3X.Blocks allocatedBlock Number81011 1213 14 1516 1718 1931414-19-111212-29-27-10-28Block Number 2021 222324752628 29303142121-23-17-30Task:1. Write a C program to simulate the Linked list file allocation in a very simple file system.2. Assume a disk of 32 blocks, each block is of 1 KB size3. First 8 blocks (0 to 7) are allocated to the "INodes" and can't be used by the file system. Hence blocksavailable for allocation are from block 8 to block 31.4. Minimum file size is 1 KB. Hence the file system can have minimum of one file of size 24 KB or maximumof 24 files.5. At the start, it is assumed that the file system has no files.6. The program shall ask the user to input the number of files to allocate and their respective names andfile sizes.7. The program shall randomly (set a seed with srand(seed) to replicate the randomness) select any freeblock as a start block. Subsequent blocks shall be randomly picked (based on file size) if free.8. All selected blocks of a file shall be maintained in a linked list.9. Afterallocating buffers for all the files, the program shall print file name, file size, and the allocatedlinked list of blocks for each file. Refer to the program output shown below.10. Required test case: Use the example file names and sizes shown above11. Not required test cases:If there are not enough contiguous blocks available for a file, the program can exit.Program need not implement file deletion or modification.1. Sample program output:File allocation method: LINKED LISTTotal blocks: 32File allocation start at block: 8File allocation end at block: 31Size (kB) of each block: 1Enter no of files: 3Enter the name of file #1: data.csvEnter the size (kB) of file #1: 3Enter the name of file #2: info.docEnter the size (kB) of file #2: 5Enter the name of file #3: music.mp3Enter the size (kB) of file #3: 4FILE NAMEdata.csvNO_OF_BLOCKSBLOCKS OCCUPIED314-19-11info.docmusic.mp3File allocation completed. Exiting.512-29-27-1e-28421-23-17-30

As in the problem only "main" function was to be completed, it is assumed that the student has…

Answered: File allocation method: LINKED LIST…

Computer Networking: A Top-Down Approach (7th Edition)

7th Edition

ISBN:9780133594140

Author:James Kurose, Keith Ross

Publisher:James Kurose, Keith Ross

Chapter1: Computer Networks And The Internet

Section: Chapter Questions

Problem R1RQ: What is the difference between a host and an end system? List several different types of end...

See similar textbooks

Related questions

Question

With linked allocation, each file is a linked list of disk blocks; the disk blocks may be scattered anywhere
on the disk. The directory contains a pointer to the first and last blocks of the file. Each block contains a pointer
to the next block. Refer to the illustration below.

Need help to fill in the codes in void main() ---

#include<stdio.h>
#include<stdlib.h>
#define TOTAL_DISK_BLOCKS 32
#define TOTAL_DISK_INODES 8
int blockStatus[TOTAL_DISK_BLOCKS]; // free = 0
int blockList[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES]; // list of blocks of a file
struct file_table {
char fileName[20];
int fileSize;
struct block *sb;
};
struct file_table fileTable[TOTAL_DISK_BLOCKS - TOTAL_DISK_INODES];
struct block {
int blockNumber;
struct block *next;
};
int AllocateBlocks(int Size) {
---
}
void main()
{
int i = 0, j = 0, numFiles = 0, nextBlock= 0, ret = 1;
char s[20]; struct block *temp;
---
for(i = 0; i < numFiles; i++) {
---
ret = AllocateBlocks(fileTable[i].fileSize);
---
}
---
//Seed the pseudo-random number generator used by rand() with the value seed
srand(1234);
---
}