Process Scheduling First Come First Served & Shortest Job First

So, late posts and hopefully this and all the posts afterwards will still count towards my grade in OPESYS1 since I've obviously overshot the deadline for it but yeah, if not, I'll just post it anyway.

One of the topics we discussed in OPESYS1 this term is process scheduling following different algorithms. First algorithms we discussed and were taught were First Come First Served(FCFS) which, you can garner from its name is pretty straightforward, and Shortest Job First. Shortest Job First(SJF) is actually pretty interesting if you think about it and it's further divided into non-preemptive and preemptive. I say SJF is pretty interesting in that it's actually impossible to implement realistically since as was told multiple times to us by sir Justin, it's a theoretical algorithm and is impossible to happen from a realistic point-of-view since you wouldn't know how long you plan to use a specific process from the start. From what I observed from my classmates and my group-mates, the preemptive version of the SJF is one of the harder algorithms to get the gist of and understand. I think the name is pretty self explanatory though and that sir Justin did a good job of explaining and teaching it. I guess it's just that each person has different learning curves for different things.

If I recall correctly, Davvid was absent for the SJF preemptive lesson so when group-work came, aside from working on our group's paper, I was teaching and explaining bit by bit while working to both him and Kenneth. Well, due to that though I got decent practice for multi-tasking and solving these types of problems as fast and as efficient as I possibly can. I don't blame Kenneth since I understand that there are really just times where you have a hard time understanding a particular subject, as for Davvid, he does what he can and him asking questions and asking to be taught is a good way to better the knowledge that I already know by teaching it to someone else.