-
Notifications
You must be signed in to change notification settings - Fork 0
/
9.b.c
104 lines (80 loc) · 2.52 KB
/
9.b.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
#include <stdio.h>
#include <stdlib.h>
#define MAX_PROCESSES 10
// Structure to represent a process
struct Process {
int id;
int arrivalTime;
int burstTime;
};
// Structure to represent a queue
struct Queue {
struct Process* items[MAX_PROCESSES];
int front, rear;
};
// Function to create an empty queue
struct Queue* createQueue() {
struct Queue* queue = (struct Queue*)malloc(sizeof(struct Queue));
queue->front = -1;
queue->rear = -1;
return queue;
}
// Function to check if the queue is empty
int isEmpty(struct Queue* queue) {
return (queue->front == -1);
}
// Function to check if the queue is full
int isFull(struct Queue* queue) {
return (queue->rear == MAX_PROCESSES - 1);
}
// Function to add a process to the queue (enqueue)
void enqueue(struct Queue* queue, struct Process* process) {
if (isFull(queue)) {
printf("Queue is full. Process enqueue failed.\n");
return;
}
if (isEmpty(queue)) {
queue->front = 0;
}
queue->rear++;
queue->items[queue->rear] = process;
}
// Function to remove and process the next process in the queue (dequeue)
struct Process* dequeue(struct Queue* queue) {
if (isEmpty(queue)) {
printf("Queue is empty. No process to execute.\n");
return NULL;
}
struct Process* process = queue->items[queue->front];
queue->front++;
if (queue->front > queue->rear) {
// Reset the queue when all processes are executed
queue->front = queue->rear = -1;
}
return process;
}
int main() {
int numProcesses;
printf("Enter the number of processes: ");
scanf("%d", &numProcesses);
struct Queue* processQueue = createQueue();
for (int i = 0; i < numProcesses; i++) {
struct Process* process = (struct Process*)malloc(sizeof(struct Process));
process->id = i + 1;
printf("Enter arrival time for Process %d: ", process->id);
scanf("%d", &process->arrivalTime);
printf("Enter burst time for Process %d: ", process->id);
scanf("%d", &process->burstTime);
enqueue(processQueue, process);
}
printf("Simulating FCFS CPU Scheduling:\n");
int currentTime = 0;
while (!isEmpty(processQueue)) {
struct Process* currentProcess = dequeue(processQueue);
printf("Executing Process %d (Burst Time: %d)\n", currentProcess->id, currentProcess->burstTime);
currentTime += currentProcess->burstTime;
free(currentProcess);
}
printf("All processes executed.\n");
return 0;
}