1. Data Sufficiency: Structure & Format by Ayman Sadiq [Skill development]
Puzzle Hard 3
- Questions 1-6 Aurni Tasnim, a museum curator must group nine paintings – F, G, H, J, K, L, M, N, and O - in twelve spaces numbered consecutively from 1-12. The paintings must be in three groups, each group representing a different century. The groups must be separated from each other by at least one unused wall space. Three of the paintings are from the eighteenth century, two from the nineteenth century, and four from the twentieth century. Unused walls spaces cannot occur within groups. G and J are paintings from different centuries. J, K and L are all paintings from the same century. Space number 5 is always empty. F and M are eighteenth-century paintings. N is a nineteenth-century painting If space 4 is to remain empty, which of the following is true?
- If the paintings are hung in reverse chronological order by century, the unused wall spaces could be
- Which of the following is a space that CANNOT be occupied by a nineteenth-century painting?
- If J hands in space 11, which of the following is a possible arrangement for space 8 and 9?
- If the twentieth-century paintings are hung in spaces 1-4, which of the following CANNOT be true?
- If the first five paintings, in numerical order of spaces, are F, O, M, N, G, which of the following must be true?
- Questions 7-10 A large office complex has exactly seven buildings – R, S, T, U, V, W, and X. A delivery service with four vans – van 1, van 2, van 3, and van 4 – carries packages by van from building to building at the complex. Each van has unique route, which it repeats throughout the day. Van 1 travels only from R to S, from S to T, from T to U, from U to V, and from V to R. Van 2 travels only from S to W and back to S. Van 3 travels only from T to V and back to T. Van 4 travels only from U to X and back to U. Vans stop at each building to which they travel, and packages can be picked up or delivered at any stop. Any van can also leave a package for any other van to pick up at any building where both vans stop. A package sent by van can be delivered with no intermediate stops if it is sent from
- On its way to any building in the complex, a package sent by van from W must travel to
- What is the minimum number of intermediate stops for a package sent by van from R to V?
- Which of the following lists all of the vans, in the order of use, that would be needed to send a package by van from X to T with the minimum number of intermediate stops?