A university schedules final exams, aiming to minimize conflicts. What happens to the number of distinct exam slots required if a small group of students retakes multiple courses?

💡 Explanation

The number of exam slots increases, because the exam scheduling can be modeled as a graph coloring problem, where courses are nodes and shared students are edges; the chromatic number represents the minimum slots, therefore more student overlap increases the chromatic number, rather than allowing for fewer slots.

• If a sorting algorithm's progress is measured by a monovariant that strictly decreases with each swap until the array is sorted, which property holds?
• If a social network mandates that among any six users, either three are mutually friends or three are mutually strangers, which consequence follows for the network's structure?
• A file server distributes tasks to processors. If processors handle tasks in order of arrival, using whichever is available, which effect dominates when several tasks arrive simultaneously?
• If a robot arm's control system utilizes a contraction mapping to achieve precise movements, which consequence follows regarding its positioning accuracy?
• If a digital circuit's output simplifies via De Morgan's laws from NOT(A AND B) to (NOT A) OR (NOT B), which consequence follows for test vectors?
• What happens to the computation of unique paths in a grid when a single cell is doubly counted?