Introduction / Context:
This scheduling logic question involves two swaps across a Monday–Thursday window. The challenge is to track original assignments and then apply trades to deduce the person who ends up on Tuesday.
Given Data / Assumptions:
- Each of four workers is assigned one unique day among Monday, Tuesday, Wednesday, Thursday.
- Ms. Johnson was originally Monday; Mr. Carter was originally Wednesday; Mr. Kirk was originally Thursday; Ms. Falk is the remaining person (thus originally Tuesday by elimination).
- Trades: Johnson ↔ Carter; Falk ↔ Kirk.
Concept / Approach:
First recover every original day by elimination. Then apply each trade to swap days between the two named people. The worker not involved in a particular trade retains their current day after that trade.
Step-by-Step Solution:
Original schedule: Johnson = Mon; Carter = Wed; Kirk = Thu; Falk = Tue (by elimination).Trade 1 (Johnson ↔ Carter): Johnson → Wed; Carter → Mon; Falk remains Tue; Kirk remains Thu.Trade 2 (Falk ↔ Kirk): Falk → Thu; Kirk → Tue; Johnson remains Wed; Carter remains Mon.Final schedule: Mon = Carter; Tue = Kirk; Wed = Johnson; Thu = Falk.
Verification / Alternative check:
Check uniqueness (each day has exactly one worker) and that each trade simply swapped the two names’ days—both conditions hold.
Why Other Options Are Wrong:
Carter moved to Monday; Johnson to Wednesday; Falk to Thursday. None of these is Tuesday.“No one worked Tuesday” contradicts the setup that each day has one worker.
Common Pitfalls:
Forgetting to assign Falk’s original day by elimination before executing the second trade.
Final Answer:
Mr. Kirk
Discussion & Comments