Thursday, July 03, 2003
I just finished my first class for the LSAT prep course. Whoa. They decided in their infinite wisdom to give us a three-hour LSAT mock-up for our first assignment. Fancy a sample?
There are five treasure chests marked 1-5. Kings are filling the chests with treasure: rubies, opals, topaz, platinum, gold. There is at least one but no more than two of each type of treasure in the chests. Each chest is locked with a bolt, a chain, or a lock. The following conditions apply.
There are two rubies.
There are two opals.
The chest with an opal must be to the left of a chest with gold.
The chest with rubies is locked with a chain.
The chest with opals is locked with a bolt.
What is the minimum number of treasures required in the chests?
Which of the following sequences is a possible distribution of treasure?
If an opal is in the third chest, which of the following CANNOT be true?
If the first chest is locked, which of the following can be true?
Let's just say that at some point my brains was oozing out my ears. Blah. I found my mind wandering all over the events of the day, my last meal, the contents of my wallet. I can say with absolute certainty that this test will be the hardest thing I have ever done.
posted by Thomas |
11:37 PM
Comment
|