#1
6th January 2016, 11:43 AM
| |||
| |||
Online Practice LSAT Free
Would you please give here sample paper for practice for Law School Admission Test (LSAT) I am looking here for the same?
|
#2
6th January 2016, 11:44 AM
| |||
| |||
Re: Online Practice LSAT Free
As you want I am here giving you sample paper for practice for Law School Admission Test (LSAT) I am looking here for the same. Sample paper : Directions: Each group of questions in this section is based on a set of conditions. In answering some of the questions, it may be useful to draw a rough diagram. Choose the response that most accurately and completely answers each question and blacken the corresponding space on your answer sheet. Questions 1–5 A company employee generates a series of five-digit product codes in accordance with the following rules: The codes use the digits 0, 1, 2, 3, and 4, and no others. Each digit occurs exactly once in any code. The second digit has a value exactly twice that of the first digit. The value of the third digit is less than the value of the fifth digit. 1. If the last digit of an acceptable product code is 1, it must be true that the (A) first digit is 2 (B) second digit is 0 (C) third digit is 3 (D) fourth digit is 4 (E) fourth digit is 0 2. Which one of the following must be true about any acceptable product code? (A) The digit 1 appears in some position before the digit 2. (B) The digit 1 appears in some position before the digit 3. (C) The digit 2 appears in some position before the digit 3. (D) The digit 3 appears in some position before the digit 0. (E) The digit 4 appears in some position before the digit 3. 3. If the third digit of an acceptable product code is not 0, which one of the following must be true? (A) The second digit of the product code is 2. (B) The third digit of the product code is 3. (C) The fourth digit of the product code is 0. (D) The fifth digit of the product code is 3. (E) The fifth digit of the product code is 1. 4. Any of the following pairs could be the third and fourth digits, respectively, of an acceptable product code, EXCEPT: (A) 0, 1 (B) 0, 3 (C) 1, 0 (D) 3, 0 (E) 3, 4 5. Which one of the following must be true about any acceptable product code? (A) There is exactly one digit between the digit 0 and the digit 1. (B) There is exactly one digit between the digit 1 and the digit 2. (C) There are at most two digits between the digit 1 and the digit 3. (D) There are at most two digits between the digit 2 and the digit 3. (E) There are at most two digits between the digit 2 and the digit 4. Questions 6–10 Exactly three films—Greed, Harvest, and Limelight—are shown during a film club’s festival held on Thursday, Friday, and Saturday. Each film is shown at least once during the festival but never more than once on a given day. On each day at least one film is shown. Films are shown one at a time. The following conditions apply: On Thursday Harvest is shown, and no film is shown after it on that day. On Friday either Greed or Limelight, but not both, is shown, and no film is shown after it on that day. On Saturday either Greed or Harvest, but not both, is shown, and no film is shown after it on that day. 6. Which one of the following could be a complete and accurate description of the order in which the films are shown at the festival? (A) Thursday: Limelight, then Harvest; Friday: Limelight; Saturday: Harvest (B) Thursday: Harvest; Friday: Greed, then Limelight; Saturday: Limelight, then Greed (C) Thursday: Harvest; Friday: Limelight; Saturday: Limelight, then Greed (D) Thursday: Greed, then Harvest, then Limelight; Friday: Limelight; Saturday: Greed (E) Thursday: Greed, then Harvest; Friday: Limelight, then Harvest; Saturday: Harvest 7. Which one of the following CANNOT be true? (A) Harvest is the last film shown on each day of the festival. (B) Limelight is shown on each day of the festival. (C) Greed is shown second on each day of the festival. (D) A different film is shown first on each day of the festival. (E) A different film is shown last on each day of the festival. Here is the attachment. |