Master10
Verbal Reasoning
500 Practice Questions Available

Coded & Direct Inequalities — Deductive Relational Comparisons

A premier deductive logic category in banking examinations. Students deduce whether single or chained inequality statements unequivocally substantiate candidate conclusions, navigating either/or and neither/nor rules.

Core Skills & Cognitive Modules

Key cognitive competencies and question patterns assessed under Coded & Direct Inequalities.

1
Direct Linear Inequalities

Evaluate multi-statement chains containing standard mathematical symbols (<, <=, =, >=, >) to verify conclusion truth values without algebraic substitution.

Focus: Transitive chain construction, unbroken path navigation & endpoint evaluation
High frequency in Banking Prelims (IBPS PO, SBI Clerk), RRB NTPC & State PSCs
2
Operator Precedence Deduction

Apply strict priority dominance laws (> dominates >= dominates =) along unidirectional paths to distinguish definite truths from possible assumptions.

Focus: Priority lattice hierarchy, strict vs slack deduction & operator filtering
Core differentiator across Banking PO Prelims and Insurance AO Exams
3
Either-Or Complementary Pairs

Identify and validate complementary conclusion pairs arising from slack boundary splits (>= into > and =) or opposing-arrow complete trichotomy.

Focus: Trichotomy verification, slack interval partitioning & variable alignment
Universal high-weightage trap in Banking PO Prelims/Mains and SSC CGL Tier 2
4
Coded Symbolic Inequalities

Translate abstract operator symbols (@, #, $, %, *) via magic-box lattices to verify multi-variable relational conclusions under severe time limits.

Focus: Coded grammar mapping, magic-box lattice resolution & rapid statement unification
Mandatory section in Bank PO Mains (IBPS, SBI, RRB) and RBI Grade B

Comprehensive Guide: Mastering Coded & Direct Inequalities

Theoretical foundations, question formats, and high-scoring exam techniques.

Conceptual Foundations of Coded & Direct Inequalities

Coded and Direct Inequalities assess formal relational logic over partially ordered sets (posets). Candidates evaluate whether candidate comparative conclusions necessarily follow from a set of mathematical propositions. Mastery requires rapid chain unification across shared bridge variables, recognizing opposing directional barriers, enforcing operator priority dominance, and validating exhaustive complementary pairs under trichotomy.

The 5-Stage Relational Poset Reduction Method

  1. Unify Disjoint Premises into a Single Graph: Locate shared bridge variables across statements. Chain disjoint segments into a continuous left-to-right or right-to-left linear sequence.
  2. Normalize Conclusion Operand Orientation: Align conclusion operands so the source entity matches the start of your unified path, flipping operators as necessary (e.g., P < Q becomes Q > P).
  3. Inspect Intermediate Path for Opposing Arrows: Scan the path connecting the two entities. If any two operators face opposite directions (e.g., > and <), the path is severed; mark direct relations as indeterminate.
  4. Apply Priority Dominance Hierarchy: If the path is concordant, determine the highest priority operator present: Priority 1 (> or <) > Priority 2 (>= or <=) > Priority 3 (=). The conclusion must match this exact priority.
  5. Evaluate Complementary Either-Or Conditions: If individual conclusions fail, check for Either-Or: test Slack Splitting (>= into > and =) or Three-Sign Trichotomy coverage (>, <, =) under symbol conflict.

Foundational Principles of Coded & Direct Inequalities

1. Partially Ordered Set (Poset) & TrichotomyBinary relations on real numbers satisfy transitivity and antisymmetry. Trichotomy guarantees that exactly one of {A > B, A = B, A < B} must hold.
Rule: Indeterminacy means all three trichotomy states are possible; certainty means exactly one state is proven.
2. Priority Dominance LatticeThe three tiers of inequality strength dictate transitive inheritance: Priority 1 (>, <) strictly overrides Priority 2 (>=, <=), which overrides Priority 3 (=).
Rule: To substantiate a Priority 2 conclusion (A >= B), EVERY operator along the path must be >= or =. A single Priority 1 operator forces the conclusion to >.
3. Opposing Gateway DisconnectionWhen operators face opposite directions (e.g., A > B < C), B acts as a local minimum, breaking transitive comparison between A and C.
Rule: Symbol conflict immediately invalidates all definite conclusions between endpoints, opening the possibility for an Either-Or trichotomy pair.
4. Complementary Pair ExhaustivenessAn Either-Or condition is mathematically valid only when the disjunction of the candidate conclusions forms a tautology over the premise-admissible state space.
Rule: Both conclusions must be false individually, share identical variables, and collectively exhaust all admissible possibilities.

High-Frequency Exam Traps & Pitfalls

⚠️ Opposing Arrow Blindness Trap
Assuming a conclusion holds because the first and last operators face the correct direction, while missing an opposing operator in the middle of the chain.
✓ Prevention: Visually trace the entire uninterrupted path from source to target. If you encounter any opposing arrow, halt immediately: the direct relationship is indeterminate.
⚠️ Incomplete Trichotomy Either-Or Trap
Selecting "Either-Or" for conclusion pair (I: A > B, II: A < B) under an opposing symbol conflict, forgetting that A = B is also possible.
✓ Prevention: Verify that all 3 signs (>, <, =) are covered between the two conclusions when a path is broken by opposing symbols.
⚠️ Slack vs Strict Operator Confusion
Accepting a conclusion like A >= B when the path contains A >= C > D = B. The presence of ">" strictly disallows equality.
✓ Prevention: Memorize: If a single ">" exists along an unbroken path, "=" is impossible; the conclusion MUST be ">".
⚠️ Operand Inversion Transcription Error
Evaluating conclusion "B <= A" against path "A >= B" and failing to realize they are mathematically identical.
✓ Prevention: Always rewrite conclusions to read in the same left-to-right order as your unified premise chain before checking validity.
Speed Benchmark: Target fast, structured deduction to bank buffer time for complex arrangement and analytical puzzles.
SSC: Low RelevanceRailways: Medium RelevanceBanking: High RelevanceState PSCs: Medium Relevance

Inequalities Operational Cheat Sheet

Core algebraic priority rules and trichotomy invariants for instant inequality verification.

Golden Priority Hierarchy Rule
Priority 1 (> or <) > Priority 2 (>= or <=) > Priority 3 (=). The resultant relation along an unbroken path inherits the highest priority symbol present.
Condition: Applicable to any concordant (unbroken) directional chain.
Watch out: Concurring with a >= conclusion when a strict > sign was present anywhere in the path.
Opposing Gateway Barrier Rule
Two opposing inequality signs facing each other (> < or < >) form an impassable barrier. The relationship between endpoints is completely indeterminate.
Condition: Any path containing at least one left-facing and one right-facing operator.
Watch out: Assuming a relationship exists because the intermediate variables share common letters.
Slack Splitting Either-Or Rule
If statement yields A >= B, then conclusion pair {A > B, A = B} constitutes a valid Either-Or pair.
Condition: Unbroken path where all symbols are >= or =, with at least one >= and zero >.
Watch out: Marking "Neither I nor II" because neither conclusion is individually guaranteed.
Three-Sign Trichotomy Either-Or Rule
Under an opposing symbol conflict between A and B, conclusions form Either-Or iff they contain identical variables and collectively cover >, <, and =.
Condition: Path between A and B is broken by opposing symbols.
Watch out: Accepting an Either-Or pair that only covers > and < without the = possibility.
Operand Inversion Equivalence Rule
A > B <=> B < A and A >= B <=> B <= A. Always normalize operand order before inspecting path priority.
Condition: Evaluating conclusions where variables appear in reversed order from statements.
Watch out: Forgetting to flip the operator when transposing variables, leading to opposite conclusions.
Non-Transitivity of Inequality (!=) Rule
A != B != C NEVER implies A != C or A = C. Statements with != yield complete indeterminacy between non-adjacent terms.
Condition: Premises containing the not-equal-to (!=) operator.
Watch out: Treating != like equality and chaining terms transitively.

Coded Inequality & Operator Dominance Models

Operator precedence hierarchy ladder, transitive chain resolution, and directional conflict barrier mechanics.

Model 1: Operator Dominance Hierarchy Ladder

OPERATOR DOMINANCE LADDERPRECEDENCE DROPRANK 1>  or  <Strict Inequality (100% Definite)Dominates >=, <=, and =RANK 2>=  or  <=Conditional / Dual-StateHolds ONLY if NO Rank 1 sign existsRANK 3=Pure Equality (Transparent)Holds ONLY if ALL signs are =TRANSITIVE RESOLUTION MATRIXChain: A > B >= C = DOperators: [>] + [>=] + [=]A > D is TRUE(A >= D is FALSE)Chain: P >= Q = R >= SOperators: [>=] + [=] + [>=] (No >)P >= S is TRUE(P > S is FALSE)Chain: W = X = Y = ZOperators: [=] + [=] + [=] (Pure equality)W = Z is TRUE(100% Identical)
The King-Minister-Citizen Axiom: The King (>, <) overrides all. The Minister (>=, <=) governs only when the King is absent. The Citizen (=) yields to all higher ranks.
Unidirectional Prerequisite: Hierarchy resolution is valid only if all symbols face uniformly in one direction (all leftward or all rightward).

Model 2: Directional Conflict Barrier (Blockade Rule)

STATEMENT UNDER TEST:   A > B < C   (OPPOSING SIGNS FACING OPPOSITE WAYS)Entity ASource>Entity BPivot<Entity CTargetBLOCKED!No relationTransitive Breakdown:1. A > C ❌ FALSE  |  2. A < C ❌ FALSE  |  3. A = C ❌ FALSETHE 3 EXHAUSTIVE CONDITIONS FOR "EITHER / OR" CONCLUSION:1. Identical Elements: Both conclusions compare the exact same pair (e.g., A and C).2. Individually False: Both conclusions are invalid/doubtful due to sign conflict blockade.3. Exhaustive Triad: Together, conclusions cover all 3 possibilities: (>, <, and =).Example: Conc I (A >= C) + Conc II (A < C) ➔ "Either Conclusion I or II Follows"
The Blockade Rule: When operators point toward each other (> <) or away from each other (< >), the relationship between outer entities is wholly indeterminate.
Triad Completeness: In conflict situations, "Either/Or" requires all three signs (>, <, =). If only two signs are covered (e.g. A > C and A < C, omitting =), Either/Or is INVALID.

Modeled Problem Walkthroughs: Coded & Direct Inequalities

Step-by-step cognitive deduction showing how to isolate governing rules before timed practice.

4 Modeled Walkthroughs
Exemplar Problem Statement
Statements: P >= Q = R > S >= T Conclusions: I. P > S II. R >= T Which of the conclusions logically follows?
  • Premise statement: P >= Q = R > S >= T.
  • Conclusion I: P > S.
  • Conclusion II: R >= T.
AOption A: Only conclusion I followsCorrect Answer
BOption B: Only conclusion II follows
COption C: Either conclusion I or II follows
DOption D: Both conclusions I and II follow
Step-by-Step Cognitive Deduction
Step 1Step 1 (Analyze Conclusion I: P > S): Trace path from P to S: P >= Q = R > S. Direction check: Operators are >=, =, >. All operators face right (concordant path, zero opposing arrows). Priority check: Operators present are Priority 2 (>=), Priority 3 (=), and Priority 1 (>). Priority 1 (>) dominates. Resultant relation is strictly P > S. Conclusion I asserts P > S. Therefore, Conclusion I is DEFINITIVELY TRUE.
Step 2Step 2 (Analyze Conclusion II: R >= T): Trace path from R to T: R > S >= T. Direction check: Concordant path facing right. Priority check: Operators present are Priority 1 (>) and Priority 2 (>=). Priority 1 (>) dominates, meaning the true relation is strictly R > T. Conclusion II asserts R >= T, which allows R = T. However, equality is impossible due to the strict ">" sign between R and S. Therefore, Conclusion II is FALSE.
Step 3Step 3 (Synthesize Decision): Conclusion I is true and Conclusion II is false.
Decisive Deduction Factor:The path from P to S contains the strict Priority 1 operator ">", making P > S definitely true. The path from R to T also contains ">", which invalidates R >= T.
Option A is correct. Only conclusion I follows.
Exam Insight: A single Priority 1 operator (> or <) along an unbroken path strictly overrides all Priority 2 (>= or <=) operators.

Featured Practice Set (10 Balanced MCQs)

Work through these representative solved questions covering diverse difficulty tiers and cognitive patterns. Select an option to test your deduction with instant feedback and pedagogical explanations.

10 Curated Questions
Question 1easy
Direct Linear Inequalities

Statements: A > B >= C = D > E Conclusions: I. A > C II. D > A Which of the following conclusions is/are true?

Question 2easy
Operator Precedence Deduction

Statements: P ≥ Q = R; R > S ≥ T Conclusions: I. P = S II. Q > T Which of the following conclusions is/are definitely true?

Question 3easy
Either-Or Complementary Pairs

In the question below, examine the statements and choose the conclusion(s) that logically follow. Statements: M > N < O = P Conclusions: I. M > O II. M <= O Which of the given conclusions logically follows?

Question 4medium
Direct Linear Inequalities

Statements: W > X >= Y; Z < A <= Y; B > C = X Conclusions: I. Z > W II. Y > B Which of the following conclusions is/are true?

Question 5medium
Operator Precedence Deduction

Statements: S < T ≤ U; U > V ≥ W; W < X ≤ Y Conclusions: I. S < W II. T > Y Which of the following conclusions is/are definitely true?

Question 6medium
Either-Or Complementary Pairs

Assuming the statements given below to be true, determine which conclusion logically follows from them. Statements: R <= S = T; T <= U = V Conclusions: I. R < V II. R = V Which of the given conclusions logically follows?

Question 7medium
Coded Symbolic Inequalities

Directions: In the following question, the symbols ©, ®, %, @, and # are used with the following meanings: • 'P © Q' means 'P is not greater than Q'. • 'P ® Q' means 'P is neither greater than nor equal to Q'. • 'P % Q' means 'P is neither smaller than nor greater than Q'. • 'P @ Q' means 'P is not smaller than Q'. • 'P # Q' means 'P is neither smaller than nor equal to Q'. Statements: J © K, K ® L, L % M, M © N Conclusions: I. J ® M II. K ® N III. J % N Which of the following holds true?

Question 8hard
Coded Symbolic Inequalities

Directions: In the following question, the symbols $, #, @, &, and * are used with the following meanings: • 'P $ Q' means 'P is strictly less than Q'. • 'P # Q' means 'P is less than or equal to Q'. • 'P @ Q' means 'P is equal to Q'. • 'P & Q' means 'P is greater than or equal to Q'. • 'P * Q' means 'P is strictly greater than Q'. Statements: U & V, V @ W, W & X, X * Y, Y @ Z Which of the following conclusions does NOT follow (is not definitely true)?

Question 9hard
Reverse, Definite True & Missing Operator Deductions

Which symbols should replace the question mark (?) and hash (#) respectively in the statement 'W ? X ≥ Y # Z = K' to guarantee that 'W > Y' is definitely true and 'X < K' is definitely false?

Question 10hard
Reverse, Definite True & Missing Operator Deductions

In the expression 'A ? B ? C ? D ? E', which sequence of signs from left to right makes 'A > C' definitely true, 'B ≤ D' definitely true, and 'C < E' definitely false?

Ready to practice all 500 questions?Configure customizable practice drills by difficulty or test your pacing with a timed mock test.

Frequently Asked Questions & Preparation Strategy

An Either-Or case requires: (1) Both conclusions are independently inconclusive, (2) Both conclusions share identical subject and predicate variables, and (3) The conclusions collectively cover all admissible states. This occurs in two scenarios: Slack Splitting (the derived relation is A >= B, split into I: A > B and II: A = B) or Three-Sign Trichotomy (the path has opposing arrows, and the conclusions collectively cover >, <, and =).