Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.
Customized for You
we will pick new questions that match your level based on your Timer History
Track Your Progress
every week, we’ll send you an estimated GMAT score based on your performance
Practice Pays
we will pick new questions that match your level based on your Timer History
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:
Originally posted by Bunuel on 26 Aug 2026, 03:03.
Last edited by Bunuel on 26 Aug 2026, 03:03, edited 1 time in total.
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Show timer
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide Answer
Correct Answer
Hide
Show
History
Dropdown 1: Casey
Dropdown 2: registration
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Select the dropdowns below and click "Submit" to add this question to your Error log.
Difficulty:
35%
(medium)
Question Stats:
73%
(01:57)
correct 27%
(02:08)
wrong
based on 125
sessions
History
Date
Time
Result
Not Attempted Yet
Six museum employees, Avery, Blake, Casey, Drew, Emery, and Flynn, must be assigned to three stations for a special event: registration, the exhibit hall, and the information desk. Each employee will work at exactly one station, and exactly two employees must be assigned to each station. A line in the graph connects two employees if and only if those employees cannot be assigned to the same station.
Select from each drop-down menu the option that completes the statement most accurately, assuming all of the constraints are satisfied.
If is assigned to registration, Blake must be assigned to .
Six museum employees, Avery, Blake, Casey, Drew, Emery, and Flynn, must be assigned to three stations for a special event: registration, the exhibit hall, and the information desk. Each employee will work at exactly one station, and exactly two employees must be assigned to each station. A line in the graph connects two employees if and only if those employees cannot be assigned to the same station.
Select from each drop-down menu the option that completes the statement most accurately, assuming all of the constraints are satisfied.
If is assigned to registration, Blake must be assigned to .
Official Solution:
Notice that Casey is connected to Avery, Drew, Emery, and Flynn. Therefore, Casey cannot be assigned to the same station as any of those four employees.
Thus, Blake is the only employee who can be assigned to the same station as Casey. Since exactly two employees must be assigned to each station, Casey and Blake must be assigned to the same station.
Therefore, if Casey is assigned to registration, Blake must also be assigned to registration.
This assignment is possible. For example:
Casey and Blake: registration Avery and Drew: exhibit hall Emery and Flynn: information desk
None of the pairs connected in the graph are assigned to the same station.
If Casey is assigned to registration, then Avery, Drew, Emery, and Flynn can't be assigned to registration. It is so because of the given statement "A line in the graph connects two employees if and only if those employees cannot be assigned to the same station." Hence, Blake must be assigned to registration.
The question here says that "Each employee will work at exactly one station, and exactly two employees must be assigned to each station." That means if C has to be in box 1 then the rest two and two others have to be in the rest and we have one extra which is B or Blake.
so the answer would be: 1. casey 2. registration. ( since the rest of them have two people and Blake would come back to the first box where casey is.)
( i'm not sure if its the right way to think though lol)