Reasoning Ability - MCQ Practice Questions

X's mother = Y's sister. Y = Z's mother. So X is the sibling of Z's mother, making X the uncle/aunt of Z.

From the premises: Some students → athletes → disciplined. Therefore, at least some disciplined people are students.

A clock measures time. A thermometer measures temperature. The relationship is instrument to quantity it measures.

Vikram is 4th from left. Shreya is 3 positions to his right: 4 + 3 = 7th position

Mother's brother = Uncle. His daughter = Cousin. So the woman is Amit's cousin.

M→P(+3), A→D(+3), K→N(+3), E→H(+3). Similarly, T→W(+3), A→D(+3), K→N(+3), E→H(+3). Result: WDNH

Order: B < A < C and D < C. Therefore, C is the tallest.

Pattern: 1×2=2, 2×3=6, 3×4=12, 4×5=20, 5×6=30, 6×7=42

Doctors are professionals, but only some professionals are engineers. We cannot conclude anything definite about doctors being engineers

Order: P < Q < R, and T < U. With S between them: P-Q-R-S-T-U. S is at position 4 in a 6-box arrangement, making it central

Pattern: ×2+1: 5×2+1=11, 11×2+1=23, 23×2+1=47, 47×2+1=95, 95×2+1=191

In a circle of 4: Aman opposite Charu. Bina right of Aman. Then Deepak must be left of Aman (or equivalently, between Aman and Charu on left side)

If all animals are living things and some cats are animals, then logically some cats must be living things. This is a valid syllogistic conclusion

From 'All doctors are professionals' and 'Some professionals are ethical', we cannot definitively conclude anything about the relationship between doctors and ethical people, as the 'some professionals' may or may not include doctors.

Pattern: (1×2)+1=3, (3×2)+1=7, (7×2)+1=15, (15×2)+1=31, (31×2)+1=63. The next term is 63.

D is between A and E means either A-D-E or E-D-A. B is between E and C means E-B-C. Combining: A-D-E-B-C satisfies both conditions.

If X is father of Y, and Y is brother of Z, then Z must be a child of X. Since Y is Z's brother, Z shares the same parents as Y. Therefore, X is the father of Z.

Understanding:

We need to determine how many steps are required to fully arrange the given input using the identified rule.

Step 1: Identify the Rule

From the original example:

Step 2: Apply to New Input

New Input: 81 run 35 win 19 joy 54 dog

Step 3: Count the Steps

There are 4 word-number pairs. Each step fixes one pair from the left:

So 3 steps are needed.

Answer:

The arrangement will be complete in 3 steps.

Quick Tip:

For n word-number pairs arranged one pair per step, the number of steps needed is always n − 1, since the last pair falls into place automatically.

Understanding:

We need to identify the rule governing the machine and determine which step produces the output: go 11 do 33 be 55 if 77, given the same input.

Step 1: Identify the Rule

From the original example:

Step 2: Identify the Input for the Target Output

Target output: go(11) do(33) be(55) if(77)

Step 3: Confirm

In the original example, Step 4 is the last step and produces the fully arranged output: sun 13 earth 47 moon 68 star 92. Similarly, for any 4-pair input, the fully sorted arrangement is achieved at Step 4.

The output go 11 do 33 be 55 if 77 is fully sorted (ascending numbers, paired words), so it corresponds to Step 4.

Answer:

The output go 11 do 33 be 55 if 77 is produced at Step 4.

Quick Tip:

For a machine that sorts n word-number pairs one pair per step, the fully sorted output always appears at Step n (the last step). The number of steps equals the number of pairs.

Understanding:

We need to find the number of steps to fully arrange the input: cold table bright warm ice strong.

Step 1: Identify the Rule

From the original example:

Step 2: Apply to New Input

New Input: cold table bright warm ice strong

Step 3: Count Steps

Exactly 4 steps are needed — the same as the original, since both inputs have 6 words and follow the same rule.

Answer:

The machine will take 4 steps to fully arrange the input cold table bright warm ice strong.

Quick Tip:

For n words sorted one per step where the last two auto-arrange, the number of steps = n − 2. Here n = 6, so steps = 4.