Teams class:

Picture a room filled with teams, each team has team name,three members and a score.

Every team member have a computers to work on$.$

teams work together really well.

team class has score as shared variable.

Teams send their solutions file to the submission Computer as process.

when a member of team submit solution file to submission station other members in same team has to wait so it use binary semaphore

Submission Station computer class:

This computer has all teams solution files.

submission Computer collected everyone's solutions files and made sure each team got a turn.

all files in submission station computer is shared with judges

Submission Station computer has counting semaphore and multiple teams send their files concurrently

Judges' class:

Judges receive teams solution files through the code submission station computer.

Each team's work was checked by the judge.

Judge look at the solutions files and evaluate it$.$

Every time a team solve a puzzle correctly judge say: "Well done!".

Judge pass the new score to scorekeeper the teams that submitted a correct solution file to puzzle receive points to there score.

scorekeeper class:

special computer that kept scores for each team.

like a big scoreboard shared to all teams to see$($shared resource for all teams$).$

Every time a team solve a puzzle and the judges said, "Well done!" the scorekeeper add points to their score.

scorekeeper use synchronize counting semaphore, multiple judges can update the scorekeeper data in concurrent way.

write pseudo code for system where multiple teams can code together, submit solutions, get judged, and see there score.

The focus is on synchronization.

implement a solution that ensures concurrent programming.

use counting semaphores to synchronize access to shared resources, such as the shared file system, submission platform, judging panels, and scoring system.