Operating Systems II (a.i) What problem do real-time scheduling algorithms try to solve? [2 marks] (b.i) Describe one static priority and one dynamic priority real-time scheduling algorithm. You should discuss the issue of admission control, and comment on the data structures that an implementation would need to maintain and on how these would be used to make scheduling decisions.are a data structure protected by a mutual exclusion lock. (i) What scheduling problem could arise here? [5 marks] (ii) How could this problem be overcome? [6 marks] (d.i) The designer also wishes the real-time system Demonstrate the beginning image in the two sentence structures. [6 marks] (d.ii) Define a sort or types (in C++, Java, or ML) appropriate for holding a theoretical linguistic structure tree coming about because of your solution to part (b.ii). The rudimentary clarification of the standards of how the language coming about because of part (b.iii) may be utilized to make a sentence structure analyser taking a token stream as information (by means of calls to work lex()) and giving as result an theoretical language structure tree relating to. a string, randomly chosen from the name vector a string, randomly chosen from the color vector a random int between 0-113

Use 30s0 for your itemsEaten dynamic array size (make sure to use a constant for this). Use 921-972 as your random range for age when creating Goats that the farmer introduces into the trip (use constants). Use age 920 when creating Goats by twin birth. Start with 329 goats in your trip (use a constant for this). Have your loop conduct at least 1920 goatdates (use a constant for this). Use lots of constants.