Ikibazo gihuza ibibazo · Hagati Urwego
AI for School Master Scheduling Quiz
Test school master scheduling: hard and soft constraints, course access, student pathways, staffing, optimization tradeoffs, and schedule review.
Ikibazo 1 Bya 8
Ni iki gitandukanya igih constraints gikomeye mu gutegura gahunda n'ibyifuzo byoroshye?
Reba buri kibazo8 ibibazo
Ibisubizo nibisobanuro bigaragara mugihe ufata ikibazo.
- Ni iki gitandukanya igih constraints gikomeye mu gutegura gahunda n'ibyifuzo byoroshye?
- A hard constraint must be satisfied; a soft preference is optimized when possible
- A hard constraint is a suggestion
- Soft preferences cannot be measured
- Both terms mean the same thing
- Umukemura utanga gahunda idafite impaka ikabuza abanyeshuri gukurikira urukurikirane rw'amasomo y'ikirenga. Ibi byerekana iki?
- The solver has proven the course sequence is unnecessary
- Conflict-free schedules are always equitable
- Feasibility under coded constraints does not guarantee good student access
- The students must change their graduation requirements
- Which objective may conflict with student access?
- Ensuring teachers are not double-booked
- Maximizing room utilization without checking course availability
- Respecting room capacity
- Scheduling required support services
- Ni gute ishuri ryakora igenzura ry'ibipimo byinshi by'ibikorwa?
- Weights do not affect optimization
- A model can choose values without policy input
- Sensitivity testing removes all conflicts
- Different weights can change which feasible schedule is selected and who bears the tradeoff
- Ni iki cy'ubushakashatsi bw'ibipimo by'ibanze gifasha mu gutegura gahunda?
- It determines the school’s educational values
- It guarantees enrollment forecasts are correct
- It searches combinations of assignments that satisfy constraints and optimize an objective
- It replaces staff review of pathways
- Ni ikihe kigereranyo kigomba gukorwa nyuma yo gukora gahunda?
- Independently verify student conflicts, capacity, teacher assignments, and required services
- Assume solver feasibility means every student can graduate
- Check only room utilization
- Publish without reviewing exceptions
- Why keep a schedule version and override log?
- It guarantees no student will request a change
- It increases the solver’s search speed
- It replaces communication with families
- It shows which constraints, assumptions, and human changes produced the final schedule
- Which value should guide human review of a school schedule?
- Whether every period maximizes room occupancy even when students cannot enroll in requested courses
- Whether students can access required courses and support, not just whether the solver found a feasible result
- Whether the software can publish a schedule without identifying students who could not enroll in required courses
- Whether the solver used the fewest variables, regardless of course access