Syllogism Questions FOR Placement

Meta Description: Master Syllogism questions for placement with step-by-step solutions, Venn diagram approach, complementary pairs, and exam tricks for 2026 placement drives.

Introduction

Syllogism remains one of the highest-scoring yet most frequently misunderstood modules in campus recruitment assessments. For engineering and management graduates targeting 2026 hiring cycles, mastering Syllogism questions for placement is a strategic necessity. Unlike traditional mathematics, syllogism tests pure deductive logic, evaluating your ability to separate everyday assumptions from strict formal reasoning. Major product and service companies, particularly Infosys, Wipro, and Cognizant, feature these problems consistently in their verbal reasoning and logical reasoning sections. The difficulty level typically ranges from straightforward "All/Some/No" pattern matching to complex multi-statement chains involving possibility cases and complementary pairs. While many aspirants rely on guesswork, top performers use a structured Venn diagram approach combined with strict logical rules. This comprehensive guide breaks down every statement type, explains how to correctly interpret "follows" versus "does not follow," and provides graded practice material. You'll find 23 original and company-pattern questions with complete worked solutions, time-saving shortcuts, and exam-specific strategies designed to help you secure accurate marks under strict time constraints.

Key Formulas & Concepts

Syllogism doesn't rely on algebraic formulas but on logical rules and visual mappings. The most efficient way to solve them is through standardized Venn diagram constructions and premise conversion rules.

The Four Fundamental Statement Types

Every placement syllogism problem is built using combinations of these four standard categorical statements:

Statement Type	Standard Form	Venn Representation	Logical Implication
Universal Affirmative	All A are B	Circle A completely inside Circle B	Some A are B, Some B are A
Particular Affirmative	Some A are B	Circles A & B partially overlap	Some B are A. No All/No definite
Universal Negative	No A is B	Circles A & B completely disjoint	No B is A. All A are not B
Particular Negative	Some A are not B	Part of A lies strictly outside B	Does NOT imply Some A are B

Core Evaluation Rules

1. "Follows" vs "Does Not Follow"
   A conclusion follows only if it holds true in every valid Venn arrangement possible from the given statements. If even one valid diagram violates the conclusion, it does not follow. Real-world truth is irrelevant; only logical validity matters.
2. Possibility Cases
   If a question states "is possible," the conclusion follows if at least one valid arrangement can be drawn without violating the original premises.
3. Complementary Pairs (Either-Or Condition)
   Two conclusions form a complementary pair when all three are met:
   • They share the exact same subject and predicate.
   • One is positive (All/Some), the other is negative (No/Some Not).
   • Both individually do not follow. When met, the answer becomes: Either I or II follows.
4. Reverse Conversion Rule
   • "All A are B" → Valid reverse: "Some B are A" (Particular affirmative is always valid in reverse)
   • "Some A are B" → Valid reverse: "Some B are A"
   • "No A is B" → Valid reverse: "No B is A"
   • Never reverse "Some A are not B" directly.

Solved Examples (Basic Level)

Q1. Statements: All pens are papers. All papers are books.
Conclusions: I. All pens are books. II. Some books are pens.
Solution: Draw three concentric circles: Pen (innermost) ⊂ Paper (middle) ⊂ Book (outer). Since all Pens lie inside Papers, and all Papers lie inside Books, all Pens are inside Books. Conclusion I follows. Because all Pens are Books, at least some Books must be Pens. Conclusion II follows. Answer: Both follow.

Q2. Statements: Some cats are dogs. No dog is a cow.
Conclusions: I. Some cats are cows. II. No cat is a cow.
Solution: Draw overlapping circles for Cat & Dog (Some Cat-Dog). Dog & Cow are completely separate. The relationship between Cat and Cow is undefined; Cats could overlap Cows, or they could be completely separate. Neither conclusion is guaranteed. Answer: Neither follows.

Q3. Statements: All mobile phones are devices. Some devices are laptops.
Conclusions: I. Some laptops are mobile phones. II. All devices are mobile phones.
Solution: Mobile (inner) ⊂ Devices. Devices & Laptops partially overlap. The Mobile circle may or may not touch the Laptop overlap area. No definite link exists between Mobile and Laptops. II directly contradicts "Some devices are laptops." Answer: Neither follows.

Q4. Statements: No flower is a leaf. All trees are leaves.
Conclusions: I. No flower is a tree. II. Some leaves are trees.
Solution: Flower & Leaf are disjoint. Tree is fully inside Leaf. Since Trees are entirely within Leaves, and Flowers share zero space with Leaves, Trees cannot touch Flowers. I follows. "All trees are leaves" inherently means "Some leaves are trees." II follows. Answer: Both follow.

Q5. Statements: Some engineers are developers. All developers are coders.
Conclusions: I. Some engineers are coders. II. All engineers are coders.
Solution: Engineer & Developer overlap. Developer ⊂ Coder. The Engineer-Developer overlap area automatically falls inside Coder. Thus, some Engineers are definitely Coders. I follows. Some engineers may lie outside developers, so II is uncertain. Answer: Only I follows.

Practice Questions (Medium Level)

Q6. Statements: All cars are buses. No bus is a train. Some trains are bikes.
Conclusions: I. No car is a train. II. Some bikes are not cars.
Solution: Car ⊂ Bus. Bus || Train (disjoint). So Car || Train. I follows. Train & Bike overlap. Cars have no relation to Bikes, but Bikes cannot be Cars because Bikes overlap Trains, and Trains are disjoint from Buses/Cars. Thus, at least some Bikes (the ones that are Trains) cannot be Cars. II follows. Answer: Both follow.

Q7. Statements: Some apples are bananas. All bananas are cherries. No cherry is a date.
Conclusions: I. Some apples are dates. II. No apple is a date.
Solution: Apple ∩ Banana. Banana ⊂ Cherry. Cherry || Date. Apple-Cherry relationship is partial/undefined, so Apple-Date relation is completely open. Neither definite link can be established. Subjects/predicates match for I & II, both individually do not follow, one is positive/one negative. Answer: Either I or II follows.

Q8. Statements: All doctors are scientists. Some scientists are engineers. All engineers are managers.
Conclusions: I. Some doctors are managers. II. Some scientists are managers.
Solution: Doctor ⊂ Scientist. Scientist ∩ Engineer. Engineer ⊂ Manager. The Scientist-Engineer overlap ensures at least some Scientists are Engineers, hence Managers. II follows. Doctors are inside Scientists but may not touch Engineers/Managers. I is uncertain. Answer: Only II follows.

Q9. Statements: No laptop is a tablet. All tablets are smartphones. Some smartphones are smartwatches.
Conclusions: I. Some laptops are smartwatches. II. Some smartphones are not laptops.
Solution: Laptop || Tablet. Tablet ⊂ Smartphone. Smartphone ∩ Smartwatch. Laptops could overlap Smartwatches or remain disjoint. I does not follow. Tablets are fully inside Smartphones and disjoint from Laptops, meaning the Tablet portion of Smartphones definitely excludes Laptops. II follows. Answer: Only II follows.

Q10. Statements: Some rivers are lakes. No lake is a waterfall. All waterfalls are oceans.
Conclusions: I. Some rivers are not waterfalls. II. Some lakes are oceans.
Solution: River ∩ Lake. Lake || Waterfall. Waterfall ⊂ Ocean. Rivers might or might not touch Waterfalls. I not definite. Lakes and Waterfalls are disjoint. Lakes could overlap Oceans through other paths, but not guaranteed. II not definite. Check complementary: I & II don't share subject/predicate. Answer: Neither follows.

Q11. Statements: All pens are books. Some books are pages. No page is a cover.
Conclusions: I. Some pens are pages. II. No book is a cover.
Solution: Pen ⊂ Book. Book ∩ Page. Page || Cover. Pen-Page relation undefined. I fails. Book-Page overlap exists, but Pages are disjoint from Covers. Books might or might not touch Covers outside the Page area. II fails. Same subject/predicate? Yes. Positive/Negative? Not matching standard pair. Actually, check logic: Book could have covers. Answer: Neither follows.

Q12. Statements: Some stars are moons. All moons are planets. No planet is a comet.
Conclusions: I. Some stars are not comets. II. Some planets are comets.
Solution: Star ∩ Moon. Moon ⊂ Planet. Planet || Comet. Stars might fully lie in Planets, so they avoid Comets. But could some Stars be outside Moons/Planets and touch Comets? Possible, but not certain. I fails. II contradicts "No planet is a comet". Answer: Only II definitely does NOT follow, but question asks what follows. Neither follows.

Q13. Statements: All teachers are professors. Some professors are researchers. All researchers are writers.
Conclusions: I. Some teachers are writers. II. Some professors are writers.
Solution: Teacher ⊂ Professor. Professor ∩ Researcher. Researcher ⊂ Writer. The Professor-Researcher overlap guarantees some Professors are Writers. II follows. Teachers are subset of Professors but may avoid Researcher/Writer circle. I uncertain. Answer: Only II follows.

Tricky Questions (Advanced Level)

Q14. Statements: Some A are B. No B is C. All C are D. Some D are not A.
Conclusions: I. Some A are not C. II. Some B are D is a possibility.
Solution: A ∩ B. B || C. C ⊂ D. Since B and C never meet, the A-B overlap area definitely excludes C. So Some A are definitely not C. I follows. For II: B || C, and C ⊂ D. B and D can partially overlap without violating "No B is C" as long as B's overlap with D stays outside C. Thus, it's a valid possibility. II follows. Answer: Both I and II follow.

Q15. Statements: All P are Q. Some Q are R. No R is S. All S are T.
Conclusions: I. Some P are T. II. Some Q are not S. III. No Q is T is a possibility.
Solution: P ⊂ Q. Q ∩ R. R || S. S ⊂ T. P-S relation is completely separated by unknown Q paths. I fails. R || S, but Q partially contains R. The Q-R part excludes S. Thus, some Q are definitely not S. II follows. III: Can Q and T be fully disjoint? T contains S, which is disjoint from R (and Q's R-part). Q could avoid S/T entirely if drawn as Q-R disjoint from S-T. Valid possibility. III follows. Answer: II and III follow.

Q16. Statements: Some laptops are mobiles. All mobiles are gadgets. Some gadgets are cameras.
Conclusions: I. All cameras being mobiles is a possibility. II. Some gadgets are mobiles. III. Some laptops are cameras.
Solution: Laptop ∩ Mobile. Mobile ⊂ Gadget. Gadget ∩ Camera. I: Can all Cameras be inside Mobile? Yes, if Camera ⊂ Mobile ⊂ Gadget, it doesn't break "Some gadgets are cameras" or "Some laptops are mobiles". Possible. II: Since Mobile ⊂ Gadget, all Mobiles are Gadgets, so logically Some Gadgets are Mobiles. Follows. III: Laptop-Gadget-Mobile path exists, Camera-Gadget overlap exists, but Laptop-Camera link is not guaranteed. Fails. Answer: I and II follow.

Q17. Statements: No apple is orange. Some oranges are mangoes. All mangoes are grapes.
Conclusions: I. Some apples are not grapes. II. No apple is mango. III. Some oranges are not apples.
Solution: Apple || Orange. Orange ∩ Mango. Mango ⊂ Grape. I: Apple could be entirely inside Grapes without touching Oranges. Fails. II: Apple || Orange, Mango overlaps Orange. Apple could touch Mango outside Orange. Not definite. Fails. Wait, check III: Orange has parts. All Oranges avoid Apples (No apple is orange ↔ No orange is apple). So Some oranges are definitely not apples. Actually, ALL oranges are not apples. III follows. Re-evaluate: "No A is O" means ALL O are not A. III follows. Only III. Answer: Only III follows.

Q18. Statements: Some artists are dancers. No dancer is singer. Some singers are painters.
Conclusions: I. Some artists are not painters. II. All dancers are artists is a possibility. III. Some singers are not artists is a possibility.
Solution: Artist ∩ Dancer. Dancer || Singer. Singer ∩ Painter. I: Artist-Singer-Painter relation undefined. Fails. II: We have Some Artists are Dancers. Can we expand Dancer to be fully inside Artist? Yes, drawing Artist larger and fully containing Dancer satisfies "Some artists are dancers" and doesn't violate Dancer-Singer disjointness. Possibility valid. III: Singers avoid Dancers. Artists only partially touch Dancers. Singers can easily avoid Artists. Possible. Answer: II and III follow.

Common Mistakes to Avoid

• Using Real-World Knowledge: Examiners deliberately use false premises (e.g., "All tables are cats"). Never apply outside facts; rely solely on given statements.
• Misinterpreting "Does Not Follow": It doesn't mean the conclusion is false. It means it's not logically guaranteed in all valid diagrams.
• Forgetting Reverse Conversion: Many lose points by not recognizing that "All A are B" automatically proves "Some B are A" and should be checked against conclusions.
• Ignoring Either-Or Conditions: Two individually failing conclusions often form a complementary pair. Marking "Neither" in these cases is the most frequent scoring error.
• Overcomplicating Possibility Cases: If a possibility doesn't contradict the original statements, it follows. You don't need to prove it's mandatory, only that it's drawable.
• Treating "Some Not" as "None": "Some A are not B" leaves room for overlap. It never proves "No A is B."

Shortcut Tricks

1. The AEIO Quick-Check Rule
Label statements by type: All, E (No), I (Some), O (Some not).

• A + A = A (All + All → All)
• I + A = I (Some + All → Some)
• I + E = O (Some + No → Some Not)
• Trick: When you see A + A chain, immediately mark "All" conclusions as Following without full diagrams.

2. The Three-Circle Priority Mapping
In 3-statement problems, draw circles in reverse order of appearance in conclusions to save time. Start with the subject of Conclusion I, overlay Premise 1, then Premise 2, checking Conclusion I. Erase/redraw only the conflicting area for Conclusion II. This prevents full redraws.

3. Complementary Pair Shortcut
If Conclusions I & II share Subject & Predicate, have opposite polarity, and both seem "uncertain," instantly verify the three conditions (Same S/P, One Pos/One Neg, Both Fail). If met, mark "Either-Or" in 10 seconds without deep diagram analysis.

4. Possibility "Yes" Check
For "is a possibility" questions, try to force the diagram to be true. Slide circles, expand, or overlap them until the possibility works. If you can't force it without breaking a No/All rule, it fails. If it fits without violation, it follows.

Previous Year Questions from Top Companies

Pattern-Replica questions based on recent 2023-2025 campus drives.

Q19. (Infosys Logical Pattern)
Statements: All keys are codes. Some codes are files. No file is a folder.
Conclusions: I. No key is a folder. II. Some codes are not folders.
Solution: Key ⊂ Code. Code ∩ File. File || Folder. Key-File relation unknown, so Key-Folder is undefined. I fails. The Code-File overlap area definitely avoids Folders (since File || Folder). Thus, some Codes are definitely not Folders. II follows. Answer: Only II follows.

Q20. (Wipro Verbal Reasoning)
Statements: Some trains are tracks. All tracks are roads. Some roads are bridges.
Conclusions: I. Some trains are bridges. II. All bridges being tracks is a possibility. III. Some roads are tracks.
Solution: Train ∩ Track. Track ⊂ Road. Road ∩ Bridge. Train-Bridge link unconfirmed. I fails. Bridges could theoretically sit entirely inside Tracks (