Plot the output in an Excel graph. Explain your findings. Adjust your inputs to get meaningful outputs. //Write a program that simulates a paging system using the aging algorithm. The number of page //frames is a parameter. The sequence of page references should be read from a file. //For a given input file, plot the number of page faults per 1000 memory references as a function of //the number of page frames available.

1. Plot the output in an Excel graph. Explain your findings. Adjust your inputs to get meaningful outputs.

//Write a program that simulates a paging system using the aging algorithm. The number of page
//frames is a parameter. The sequence of page references should be read from a file.
//For a given input file, plot the number of page faults per 1000 memory references as a function of
//the number of page frames available.

#include <stdio.h>
#include <stdlib.h>
#include <stdbool.h>

//THE PAGE FREQUENCY PER 1000 MEMORY REFERENCE DATA IS STORED IN A SEPARATE FILE CALLED DATA.TXT.
//DATA POINTS CAN BE USED TO PLOT THE GRAPH

void AgeIncrease (int frames);
int OldestIndex (int frames);

struct PageTable {
int frame_number;
bool valid;
}*PageTable;

struct FrameTable {
int page_number;
int age;
}*FrameTable;

int main (void){
printf("Number of pages:\n");
int pages;
scanf("%d", &pages);

printf("Number of frames:\n");
int frames;
scanf("%d", &frames);

PageTable=malloc(sizeof(PageTable)*pages);
FrameTable=malloc(sizeof(FrameTable)*frames);

int i;
for (i=0;i<pages; i++){
PageTable[i].valid=false;
}

for (i=0;i<frames;i++){
FrameTable[i].age=0;
}

FILE *fp=fopen("file.txt", "r");

int request;
int frame_table_counter=0;
int page_fault_counter=0;
int request_counter=0;
int memory_ref_counter=0;
//add frame size to page faults later
while (!feof(fp)){
fscanf(fp, "%d", &request);
request_counter++;
if (PageTable[request].valid==false){
FrameTable[frame_table_counter].page_number=request;
PageTable[request].valid=true;
PageTable[request].frame_number=frame_table_counter;
frame_table_counter++;
page_fault_counter++;
memory_ref_counter++;
}

if (request_counter==1000){
FILE *fp=fopen("data.txt", "a");
fprintf (fp, "%d\n", memory_ref_counter);
memory_ref_counter=0;
request_counter=0;
fclose(fp);
}
if (frame_table_counter==frames){
break;
}
}


while (!feof(fp)){
fscanf(fp, "%d", &request);
request_counter++;
AgeIncrease(frames);
if (PageTable[request].valid==false){
int oldest_page=OldestIndex(frames);
PageTable[FrameTable[oldest_page].page_number].valid=false;
FrameTable[oldest_page].page_number=request;
FrameTable[oldest_page].age=0;
PageTable[request].frame_number=oldest_page;
PageTable[request].valid=true;
page_fault_counter++;
memory_ref_counter++;
}

if (request_counter==1000){
FILE *fp=fopen("data.txt", "a");
fprintf (fp, "%d\n", memory_ref_counter);
memory_ref_counter=0;
request_counter=0;
fclose(fp);
}
}

printf("Total page faults %d\n", page_fault_counter);

fclose(fp);
free(PageTable);
free(FrameTable);

return 0;
}

void AgeIncrease (int frames){
int i;
for (i=0;i<frames;i++){
FrameTable[i].age++;
}
}

int OldestIndex (int frames){
int oldest=-1;
int i;
int index;
for (i=0;i<frames;i++){
if (oldest<FrameTable[i].age){
oldest=FrameTable[i].age;
index=i;
}
}
return index;
}