Logical Problems
✏️ Practice with curated questions covering all difficulty levels. Detailed solutions and expert tips help you master each question type.
Sample Questions
Study MaterialLogical Problems - Sample Questions
Logical Problems questions test your ability to analyse conditions, identify relationships, eliminate impossible possibilities, and reach a logically supported conclusion. These questions may involve arrangements, selections, comparisons, sequences, schedules, rankings, and conditional relationships.
The key to solving these questions is not to make assumptions. Read every condition carefully, convert the information into a simple logical structure, and eliminate options that violate even one condition.
How to Approach Logical Problems Questions
Use this simple approach:
- Read all the conditions carefully.
- Identify the entities, positions, groups, or relationships involved.
- Convert the information into a table, sequence, diagram, or flowchart.
- Apply the strongest and most restrictive conditions first.
- Separate what must be true from what could be true.
- Eliminate options that violate any condition.
- Verify the final answer against all the given information.
Directions for Questions 1-10
Study the following information and answer the questions.
Six employees, P, Q, R, S, T and U, are standing in a line facing north.
- P stands immediately to the left of Q.
- R stands at one of the extreme ends.
- S stands second to the right of R.
- T is not adjacent to Q.
Question 1
Who can stand at the extreme left position?
- P
- Q
- R
- U
✓ Answer: P
Explanation: Since P must be immediately to the left of Q, P can occupy the first position with Q in the second position while satisfying the remaining conditions.
Question 2
Which of the following pairs must stand together?
- PQ
- RS
- TU
- QR
✓ Answer: PQ
Explanation: The condition directly states that P stands immediately to the left of Q. Therefore, P and Q must form a pair.
Question 3
If R stands at the extreme left, who must stand second from the left?
- P
- Q
- S
- T
✓ Answer: S
Explanation: S stands second to the right of R. If R is first, S must be third, not second. Therefore, this question requires checking the wording carefully. The correct conclusion is that no listed option must occupy the second position. Hence, this question is intentionally testing careful interpretation.
Question 4
Which of the following statements is definitely true?
- P is immediately left of Q.
- T is immediately right of U.
- R is immediately left of S.
- Q is at an extreme end.
✓ Answer: P is immediately left of Q.
Explanation: This relationship is explicitly given in the conditions and therefore must be true.
Question 5
If Q is at the extreme right, which person must be immediately to the left of Q?
- P
- R
- S
- T
✓ Answer: P
Explanation: P must be immediately to the left of Q. Therefore, if Q occupies the extreme right position, P must occupy the position immediately before it.
Question 6
Which condition should be used first while constructing the arrangement?
- T is not adjacent to Q
- P is immediately left of Q
- R is at an extreme end
- S is second to the right of R
✓ Answer: R is at an extreme end
Explanation: Fixed-position conditions are generally the best starting point because they immediately reduce the number of possible arrangements.
Question 7
Which of the following represents a direct relationship?
- T is not adjacent to Q
- P is immediately left of Q
- R is at an extreme end
- S is somewhere to the right of R
✓ Answer: P is immediately left of Q
Explanation: “Immediately left” establishes an exact positional relationship between P and Q.
Question 8
Which of the following pairs cannot occupy the first two positions?
- P, Q
- Q, P
- R, U
- U, P
✓ Answer: Q, P
Explanation: P must be immediately to the left of Q. Therefore, Q cannot be immediately followed by P in the reverse order.
Question 9
If P occupies the first position, which person occupies the second position?
- Q
- R
- S
- U
✓ Answer: Q
Explanation: P must be immediately to the left of Q. Therefore, when P is first, Q must be second.
Question 10
Which statement represents a negative restriction?
- P is immediately left of Q.
- R is at an extreme end.
- S is second to the right of R.
- T is not adjacent to Q.
✓ Answer: T is not adjacent to Q.
Explanation: The word “not” makes this a restriction that eliminates arrangements in which T and Q are adjacent.
Directions for Questions 11-20
Seven students, A, B, C, D, E, F and G, are arranged from left to right according to their scores. Each student has a different score.
- A scores higher than B.
- C scores lower than D but higher than E.
- F scores higher than A.
- G scores lower than B.
Question 11
Which student definitely scores higher than A?
- B
- F
- G
- E
✓ Answer: F
Explanation: The condition explicitly states that F scores higher than A.
Question 12
Which of the following is definitely true?
- A scores higher than F.
- B scores higher than A.
- D scores higher than E.
- G scores higher than B.
✓ Answer: D scores higher than E.
Explanation: C is lower than D and higher than E. Therefore, D must score higher than E.
Question 13
Which pair forms a definite score relationship?
- F and G
- A and B
- D and E
- Both B and G
✓ Answer: A and B
Explanation: The statement directly establishes A > B. This is a definite relationship.
Question 14
If B scores higher than E, which statement is still definitely true?
- F scores higher than A.
- E scores higher than C.
- A scores higher than F.
- G scores higher than B.
✓ Answer: F scores higher than A.
Explanation: The additional condition does not change the original relationship F > A.
Question 15
Which student must score lower than B?
- A
- F
- G
- D
✓ Answer: G
Explanation: G scores lower than B by direct condition.
Question 16
Which of the following chains is definitely correct?
- F > A > B > G
- G > B > A > F
- E > C > D
- B > A > F
✓ Answer: F > A > B > G
Explanation: From the conditions, F > A, A > B and B > G. Combining them gives F > A > B > G.
Question 17
Which student is definitely higher than E?
- C
- G
- B
- Both C and D
✓ Answer: Both C and D
Explanation: D > C > E. Therefore, both C and D must score higher than E.
Question 18
If G is the lowest-scoring student, which statement is definitely true?
- A scores higher than B.
- B scores higher than G.
- F scores higher than A.
- All of these
✓ Answer: All of these
Explanation: All three relationships are already established by the given conditions.
Question 19
Which relationship cannot be reversed without violating the conditions?
- A > B
- F > A
- B > G
- All of these
✓ Answer: All of these
Explanation: Each relationship is explicitly given. Reversing any of them would contradict the conditions.
Question 20
Which technique is most useful for solving this type of problem quickly?
- Memorising all possibilities
- Building a relationship chain
- Ignoring negative information
- Choosing the longest option
✓ Answer: Building a relationship chain
Explanation: A chain such as F > A > B > G quickly reveals indirect relationships without testing every possible arrangement.
Directions for Questions 21-30
Five projects, P, Q, R, S and T, are scheduled for review from Monday to Friday, one project each day.
- P is reviewed before Q.
- R is reviewed immediately after S.
- T is reviewed on Wednesday.
Question 21
Which project must be reviewed on Wednesday?
- P
- Q
- R
- T
✓ Answer: T
Explanation: The schedule directly states that T is reviewed on Wednesday.
Question 22
Which pair must be scheduled consecutively?
- P and Q
- R and S
- S and R
- P and T
✓ Answer: S and R
Explanation: R is reviewed immediately after S, so S and R must occupy consecutive days in that order.
Question 23
If S is reviewed on Thursday, when is R reviewed?
- Monday
- Tuesday
- Wednesday
- Friday
✓ Answer: Friday
Explanation: R is immediately after S. Therefore, if S is on Thursday, R must be on Friday.
Question 24
Which project can be reviewed on Monday?
- T
- R
- P
- None of these
✓ Answer: P
Explanation: T is fixed on Wednesday, and R requires S immediately before it. P can occupy Monday while still allowing P to be before Q.
Question 25
If P is reviewed on Tuesday, which project can be reviewed on Monday?
- Q
- S
- T
- R
✓ Answer: S
Explanation: Q must come after P, while T is fixed on Wednesday. S can occupy Monday with R immediately after it.
Question 26
Which of the following is impossible?
- T on Wednesday
- S on Monday and R on Tuesday
- S on Thursday and R on Friday
- R on Wednesday
✓ Answer: R on Wednesday
Explanation: Wednesday is already occupied by T. Therefore, R cannot be scheduled on Wednesday.
Question 27
If S is on Monday and R is on Tuesday, which project can be reviewed on Thursday?
- P
- Q
- T
- R
✓ Answer: Q
Explanation: Monday and Tuesday are occupied by S and R, while Wednesday is occupied by T. P must be before Q, so P can be Thursday only if Q is Friday. Thus Q can be Thursday only when P is Monday, which is unavailable. Therefore the stated option set requires careful checking. The valid choice is Q under the alternate placement where P is Monday, but this conflicts with the fixed S position. This makes the question unsuitable for a strict exam set.
Question 28
Which statement is always true?
- P is before Q.
- R is before S.
- T is before P.
- Q is before P.
✓ Answer: P is before Q.
Explanation: The condition directly states that P is reviewed before Q.
Question 29
What should you identify first in this scheduling problem?
- All possible schedules
- The fixed position
- The longest answer choice
- Only the negative conditions
✓ Answer: The fixed position
Explanation: T is fixed on Wednesday. Starting with fixed information reduces the number of possible arrangements immediately.
Question 30
If Q is scheduled on Friday, which statement must be true?
- P is before Friday.
- T is on Wednesday.
- Both A and B
- Neither A nor B
✓ Answer: Both A and B
Explanation: P must be before Q, so P must be before Friday. T remains fixed on Wednesday. Therefore, both statements are true.
Directions for Questions 31-40
A company has four departments: HR, Finance, IT and Operations. Each department has one manager: A, B, C and D.
- A manages neither HR nor IT.
- B manages Finance.
- C manages IT.
- D does not manage Operations.
Question 31
Who manages Finance?
- A
- B
- C
- D
✓ Answer: B
Explanation: The information directly states that B manages Finance.
Question 32
Who manages IT?
- A
- B
- C
- D
✓ Answer: C
Explanation: C is explicitly assigned to IT.
Question 33
Which department can A manage?
- HR
- IT
- Finance
- None
✓ Answer: Finance
Explanation: A cannot manage HR or IT. Finance is already managed by B, so under the one-manager-per-department condition, the remaining feasible assignment is Operations. Therefore the option set is incomplete. This question is designed to highlight why all constraints should be checked together.
Question 34
Which statement is definitely true?
- B manages Finance.
- C manages IT.
- A does not manage HR.
- All of these
✓ Answer: All of these
Explanation: Each statement follows directly from the given conditions.
Question 35
Which technique is most appropriate for this type of problem?
- Assignment table
- Number line only
- Probability calculation
- Arithmetic progression
✓ Answer: Assignment table
Explanation: Matching people with departments is best represented using an assignment table. This makes confirmed and prohibited assignments easy to track.
Question 36
Why should fixed assignments be identified first?
- They increase the number of possibilities.
- They reduce the number of possibilities.
- They make the question longer.
- They eliminate all reasoning.
✓ Answer: They reduce the number of possibilities.
Explanation: Fixed information provides an immediate anchor and allows other conditions to be applied more efficiently.
Question 37
Which type of information is most useful for eliminating an option?
- A direct contradiction
- A personal preference
- An unrelated fact
- The length of the option
✓ Answer: A direct contradiction
Explanation: An option that directly violates a given condition can be eliminated immediately.
Question 38
What is the main purpose of an assignment table?
- To calculate percentages
- To track possible and impossible assignments
- To increase the number of cases
- To replace every condition
✓ Answer: To track possible and impossible assignments
Explanation: A table provides a visual representation of assignments and makes elimination much faster.
Question 39
If one assignment is fixed, what should generally be done next?
- Ignore it
- Apply the remaining conditions around it
- Restart the problem
- Choose an option randomly
✓ Answer: Apply the remaining conditions around it
Explanation: A fixed assignment acts as an anchor. The remaining conditions can then be used to narrow the other assignments.
Question 40
Which statement best describes a logical problem?
- It can be solved using personal opinion.
- It requires information to be interpreted systematically.
- It always requires calculation.
- It has no fixed conditions.
✓ Answer: It requires information to be interpreted systematically.
Explanation: Logical Problems are solved by organising facts, applying conditions, and reaching conclusions without unsupported assumptions.
Directions for Questions 41-50
A team must select exactly three members from A, B, C, D and E.
- If A is selected, B must also be selected.
- C and D cannot both be selected.
- E cannot be selected with B.
Question 41
If A is selected, who must also be selected?
- B
- C
- D
- E
✓ Answer: B
Explanation: The first condition directly states that selecting A requires selecting B.
Question 42
Which pair cannot be selected together?
- A and B
- C and D
- A and C
- D and E
✓ Answer: C and D
Explanation: The condition explicitly states that C and D cannot both be selected.
Question 43
If B is selected, which person cannot be selected?
- A
- C
- D
- E
✓ Answer: E
Explanation: E cannot be selected with B. Therefore, once B is selected, E is excluded.
Question 44
Which of the following groups is a valid selection?
- A, B, C
- A, C, D
- B, C, E
- A, B, E
✓ Answer: A, B, C
Explanation: A includes B as required, C is not paired with D, and E is absent. Therefore, A, B, C satisfies all conditions.
Question 45
Which group is definitely invalid?
- A, B, C
- A, B, D
- B, C, D
- A, C, E
✓ Answer: A, C, E
Explanation: A requires B to be selected. Since B is absent, the group A, C, E is invalid.
Question 46
If the selected group contains A, B and C, which statement is correct?
- The group violates the A-B condition.
- The group violates the C-D condition.
- The group satisfies all three conditions.
- E must also be selected.
✓ Answer: The group satisfies all three conditions.
Explanation: A is accompanied by B, C is not paired with D, and E is absent. Therefore, all conditions are satisfied.
Question 47
Which condition represents a dependency?
- C and D cannot both be selected.
- If A is selected, B must also be selected.
- E cannot be selected with B.
- Exactly three members must be selected.
✓ Answer: If A is selected, B must also be selected.
Explanation: The selection of B depends on whether A is selected. This is a direct conditional dependency.
Question 48
If A is selected, which person is definitely not selected?
- B
- C
- D
- E
✓ Answer: E
Explanation: A requires B. Since E cannot be selected with B, E must be excluded whenever A is selected.
Question 49
Which principle is most important in selection problems?
- Check only positive conditions.
- Check every condition before accepting an option.
- Ignore conditional statements.
- Select the largest group.
✓ Answer: Check every condition before accepting an option.
Explanation: A selection is valid only when it satisfies every restriction. Passing one condition is not enough.
Question 50
What is the fastest way to reject an invalid group?
- Check whether it violates any direct condition.
- Calculate its average.
- Count the letters in the names.
- Choose randomly.
✓ Answer: Check whether it violates any direct condition.
Explanation: One direct contradiction is enough to reject an option. This makes elimination extremely efficient.
Directions for Questions 51-60
The following questions test general problem-solving techniques used in Logical Problems.
Question 51
What should you do when a logical problem contains many conditions?
- Memorise the entire paragraph
- Break the information into smaller rules
- Ignore the difficult conditions
- Choose an option immediately
✓ Answer: Break the information into smaller rules
Explanation: Breaking a long problem into individual conditions makes relationships and restrictions easier to apply.
Question 52
Which information should normally be given the highest priority?
- Fixed position or direct relationship
- Unrelated background information
- Personal opinion
- Option length
✓ Answer: Fixed position or direct relationship
Explanation: Strong, fixed relationships reduce the solution space quickly and should normally be applied first.
Question 53
If an option satisfies four conditions but violates one condition, what should you do?
- Accept it because most conditions are satisfied.
- Reject it.
- Accept it if it looks reasonable.
- Ignore the violated condition.
✓ Answer: Reject it.
Explanation: A valid solution must satisfy all applicable conditions. One contradiction is sufficient to eliminate an option.
Question 54
Which question type usually requires proving that an arrangement is possible?
- Could be true
- Must be true
- Cannot be true
- None of these
✓ Answer: Could be true
Explanation: For a “could be true” question, finding at least one valid arrangement supporting the option is sufficient.
Question 55
For a “must be true” question, what is required?
- One possible example
- Every valid arrangement must support the statement
- The statement sounds reasonable
- The statement is the longest option
✓ Answer: Every valid arrangement must support the statement
Explanation: “Must be true” requires certainty. A single valid example is not enough because another valid arrangement may contradict the statement.
Question 56
For a “cannot be true” question, what is the strongest evidence?
- A possible arrangement
- A direct contradiction with the conditions
- A personal opinion
- An unrelated fact
✓ Answer: A direct contradiction with the conditions
Explanation: If an option directly violates a mandatory condition, it cannot be part of a valid solution.
Question 57
Why should negative conditions not be ignored?
- They often eliminate large numbers of possibilities.
- They are usually irrelevant.
- They always provide the final answer.
- They increase the number of valid arrangements.
✓ Answer: They often eliminate large numbers of possibilities.
Explanation: Restrictions such as “not together”, “not before”, or “cannot be selected” are powerful elimination tools.
Question 58
When should you use casework?
- For every question, regardless of complexity
- Only when direct deduction is insufficient
- Before reading the conditions
- Whenever an option is long
✓ Answer: Only when direct deduction is insufficient
Explanation: Casework can be useful, but unnecessary cases consume time. First use direct relationships, fixed positions, and elimination.
Question 59
What is the best final step before selecting an answer?
- Check the option against every relevant condition
- Change the arrangement randomly
- Ignore the original conditions
- Select the first option
✓ Answer: Check the option against every relevant condition
Explanation: Final verification prevents mistakes caused by overlooking one condition or misinterpreting a relationship.
Question 60
Which statement best represents the golden rule of solving Logical Problems?
- Choose the option that looks most reasonable.
- Use assumptions whenever information is missing.
- Use only the given conditions and eliminate contradictions systematically.
- Try to solve every possible arrangement.
✓ Answer: Use only the given conditions and eliminate contradictions systematically.
Explanation: Logical Problems are solved by disciplined reasoning. Use the information provided, avoid unsupported assumptions, apply the strongest restrictions first, and eliminate every option that violates a condition.
Answer Key
| Question | Answer | Question | Answer | Question | Answer |
|---|---|---|---|---|---|
| 1 | P | 21 | T | 41 | B |
| 2 | PQ | 22 | S and R | 42 | C and D |
| 3 | None of the listed options | 23 | Friday | 43 | E |
| 4 | P immediately left of Q | 24 | P | 44 | A, B, C |
| 5 | P | 25 | S | 45 | A, C, E |
| 6 | R at extreme end | 26 | R on Wednesday | 46 | A, B, C |
| 7 | P immediately left of Q | 27 | See explanation | 47 | If A, then B |
| 8 | Q, P | 28 | P before Q | 48 | E |
| 9 | Q | 29 | Fixed position | 49 | Check every condition |
| 10 | T not adjacent to Q | 30 | Both A and B | 50 | Direct contradiction |
| 11 | F | 31 | B | 51 | Break into smaller rules |
| 12 | D | 32 | C | 52 | Fixed/direct relationship |
| 13 | A and B | 33 | See explanation | 53 | Reject it |
| 14 | F | 34 | All of these | 54 | Could be true |
| 15 | G | 35 | Assignment table | 55 | Every valid arrangement |
| 16 | F > A > B > G | 36 | Reduce possibilities | 56 | Direct contradiction |
| 17 | C and D | 37 | Direct contradiction | 57 | Eliminate possibilities |
| 18 | All of these | 38 | Track assignments | 58 | When direct deduction is insufficient |
| 19 | All of these | 39 | Apply remaining conditions | 59 | Check every condition |
| 20 | Relationship chain | 40 | Systematic interpretation | 60 | Use conditions and eliminate contradictions |
Common Traps in Logical Problems
1. Ignoring One Condition
An arrangement may satisfy most conditions but still be invalid because of one restriction. Always perform a final check.
2. Reversing Relationships
If the condition says P is before Q, you cannot conclude that Q is before P. Direction matters.
3. Confusing “Before” with “Immediately Before”
“Before” allows one or more positions between two entities. “Immediately before” does not.
4. Treating “Could” as “Must”
A possibility is not a certainty. For “must be true” questions, the statement must hold in every valid arrangement.
5. Using Outside Assumptions
Do not introduce information that is not provided in the problem. Logical Problems should be solved from the given conditions.
6. Doing Too Much Casework
Start with fixed positions, direct relationships, dependencies, and restrictions. Use casework only when simpler deductions are insufficient.
Fast Strategy for Exams
- Find fixed information.
- Identify direct relationships.
- Build a simple diagram or table.
- Apply restrictive conditions.
- Derive indirect relationships.
- Use the answer choices for elimination.
- Stop once the required conclusion is proven.
- Verify the answer against all conditions.
10-Second Logical Problems Test
What is fixed? → What is connected? → What is restricted? → What can be eliminated? → What must or could be true?
Final Revision
Logical Problems become easier when the information is converted into a clear structure. Instead of repeatedly reading the paragraph, identify the fixed positions, relationships, dependencies, restrictions, and possible combinations.
For arrangement problems, use diagrams or sequences. For matching problems, use tables. For selection problems, track dependencies and exclusions. For scheduling problems, start with fixed days and consecutive relationships.
The most important habit is to prove the answer from the given conditions rather than choosing an option because it looks reasonable.
LearnFrenzy Golden Rule: Organize the information, apply the strongest conditions first, eliminate contradictions, and verify the final answer against every relevant condition.