CPU Scheduling Assignment Help

The assignment is fully prepared and I just need an OS-savvy mind to work through it for me. It focuses on CPU scheduling, with Multilevel Feedback Queue taking center stage, so skill and confidence with promotion/demotion rules, time quantums, and aging are essential.

Here is the exact scope:

Part 1 – Multilevel Queue (static)
• Draw a complete Gantt chart, annotate every ready-queue state, mark the first process to finish, test for starvation, then explain how a 40 ms aging policy would alter the outcome.

Part 2 – MLFQ Scheduling (highest priority)
• Build the timeline, track every promotion and demotion, calculate waiting and turnaround times, show how aging helps, and compare starvation behaviour with Part 1.

Part 3 – Short theory section
• Discuss starvation in fixed queues, how MLFQ mitigates it, contrast Windows and Linux schedulers, and judge which approach works best.

Deliverables (Word or PDF only)
1. Clean, labelled Gantt charts / timelines.
2. Clear explanations and numerical results.
3. Concise answers to the four theory questions.

Everything must be wrapped up within 24 hours, so only respond if you can hit that deadline. When you bid, highlight relevant operating-systems or scheduling experience—no lengthy proposals, just proof you’ve tackled similar problems before.