Skip to content

Highmoonlander/First-Come-First-Served_Process-Scheduling_OS

View on GitHub ↗Related repositories →

This C program implements the FCFS algorithm. It takes the number of processes, arrival time, and burst time as input from the user. It calculates the waiting time and turn around time for each process and displays them along with average waiting time and turn around time. The program is implemented using arrays and loops.

active 2023-09-092023-09-14 (UTC)

Partial coverage20,542 / 26,298 hourly files (78%) · 2 absent upstream · 5,753 failed, retryable2023-08-152026-08-14 (UTC)— sampled evenly across the window, so rankings and trends hold; absolute counts scale up.
Events
6
Pushes
4
Pull requests
0
Issues
0
Stars
0
Forks
0

Activity over time

Daily event counts in the loaded window

Line chart, 6 days from 2023-09-09 to 2023-09-14. Pushes: 4 total, peak 3 in a day. Pull requests: 0 total, peak 0 in a day. Issues: 0 total, peak 0 in a day. Comments: 0 total, peak 0 in a day. Stars: 0 total, peak 0 in a day.

  • Pushes
  • Pull requests
  • Issues
  • Comments
  • Stars

Top contributors

Pushes, PRs, issues, reviews and comments — stars and forks excluded, so this is contribution rather than popularity

ContributorContributionsPushesPRsComments
Highmoonlander4400

Recent activity

Latest issues, pull requests and releases

No issue or PR events — this repo's activity is pushes only.

Totals cover only the window loaded into ClickHouse and count events, not GitHub's lifetime totals — 0 stars here means stars gained during the window, not the repo's star count.