Q. A CPU scheduling algorithm determined an order for the execution of its scheduled processes. Convinced n processes to be scheduled on one processor how numerous possible different schedules are there? Provide a formula in terms of n.
Answer: n! (n factorial = n × n - 1 × n - 2 × ... × 2 × 1).