Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Please help me this pseudocode otur process s *otur select(otur schedule s *schedule); choose the best process, remove it from the appropriate ready queue, then
otur process s *otur select(otur schedule s *schedule); choose the best process, remove it from the appropriate ready queue, then return its pointer. algorithm to find the best process to choose: if there are any processes in the ready queue - high linked list, start there: if there are critical processes, the best is the first one in the list. if not, then the best is the first process in the list. only if there are none in ready queue - high, then go to ready queue - normal: the best is the first process in the list. once you have found the best process, remove that process from the linked list it is in. remember to update the pointers! then set the selected process' age to 0 (it was just picked) set the running state bit of the state member to a 1. only one of the three state flags should be set (1) at any given time. this means ready and defunct bits should be Os. make sure to set this without changing the critical or high bits. then set the selected process' next to null. finally, return a pointer to that same process you just removed from the linked list. return pointer to the same selected process or return a null if the two ready queues were both empty or if any error conditions were found
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started