Skip to main content

Inequalities

Inequalities

Questions based on inequalities are repeated almost every year in CAT exam. Inequalities for CAT is one of the easiest to solve and scoring topics in the paper and question related to inequalities should not be left unattempted.
The questions related to inequalities are mainly of two types i.e.

  1. Direct Inequalities
  2. Indirect Inequalities
The detailed explanations for both these types are given below along with several solved examples to help the CAT aspirants understand the topic in a better way.
Some Specific Rules to Solve Inequalities:

  1. A relation can be defined only if the statements of inequalities have a common term. For example, if A > B and B < C, it can be concluded that A > C.
  2. A relation is considered undefined if the inequalities do not have a common term. For example, if A > B and C > D, the relation between A and D is undefined.
  3. In case of complementary pairs, only the complementary relation is defined. For example, if A ≥ B and B ≥ C, the relation between A and C can only be A ≥ C and not A > C.

Direct Inequalities:

The questions related to direct inequalities only includes basic symbols of inequalities like <, >, =, ≥, etc. In these questions, the candidates are given a set of sentences followed by a set of conclusions. The candidates are required to analyze the conclusion and answer the question accordingly.
Examples of Direct Inequality Reasoning Questions :
Few sentences are given along with two conclusions. Read the statements and check which conclusion is true.
Direct Inequality Question- 1:
Statements:
A > B = C
G < C > D
Conclusions:
A < D
A = G
Answer Options:
  1. Only conclusion I holds true.
  2. Only conclusion II holds true.
  3. Either conclusion I or II holds true.
  4. Neither conclusion I nor II holds true.
  5. Both conclusions I and II hold true.
Solution:
Option (4)
Reason:
From the given statements, it can be concluded that A must be greater than D as D < C < A.
Also, as C > G, A can never be equal to G.

Direct Inequality Question- 2:
Statement:
  • I ≥ U > T ≤ R
  • U ≥ V = W > C
Conclusions:
  • W > T
  • C > I
Answer Options:
  1. Only conclusion I holds true.
  2. Only conclusion II holds true.
  3. Either conclusion I or II holds true.
  4. Neither conclusion I nor II holds true.
  5. Both conclusions I and II hold true.
Solution:
Option (4)
Conclusion 1 does not holds true as T < U while U ≥ W. Similarly, conclusion 2 also does not hold since I ≥ U and U ≥ C.

Coded Inequalities:

The questions related to coded inequalities involve codes like @, #, &, etc. to define a specific relation between different entities. So, in these type of questions, the candidates need to analyze (or write down) the coded relations in standard form and then check the conclusions to answer the question. They are also called symbol operations and are repeated often in CAT exams.

Examples of Coded Inequality Reasoning Questions :
Few sentences are given along with two conclusions. Read the statements and check which conclusion is true.
Coded Inequality Question- 1:
In the given statements, the relations are represented as follows:
  • ‘P # Q‘ means ‘P is not smaller than Q’.
  • ‘P $ Q‘ means ‘P is neither smaller than nor equal to Q’.
  • ‘P % Q‘ means ‘P is neither greater than nor smaller than Q’.
  • ‘P ^ Q’ means ‘P is not greater than Q’.
  • ‘P & Q’ means ‘P is neither greater than nor equal to Q’.
Statements:
  • X # Y
  • Y $ Z
  • A & Z
Conclusions:
  • Z & X
  • A $ Y
Answer Options:
  1. Only conclusion I holds true.
  2. Only conclusion II holds true.
  3. Either conclusion I or II holds true.
  4. Neither conclusion I nor II holds true.
  5. Both conclusions I and II hold true.
Solution:
Option (1)
At first, the code must be interpreted in the general form. Here the symbols can be interpreted as :
  • # means ≥
  • $ means > and
  • & means <
Representing the statements in general form gives:
  • X ≥ Y
  • Y > Z
  • A < Z
Similarly, the conclusions can be interpreted as, Z < X and A > Y.
Thus, from the given conclusions, Z < X holds true. But as A < Z and Z < Y, the conclusion A > Y is false. So, only the first conclusion follows.






Comments

Popular posts from this blog

OFFSET in Computer Science

OFFSET in Computer Science In the post, We will understand what is the meaning of OFFSET in computer science with an example. In computer science offset comes picture at may place like packing a data structure, encoding the data etc in some standard protocol so that other parties can deserialise it and understand the data. We will understand its important how does it work with example. suppose we have a data structure for a student like { name:string[20] roll: int[4] course: string[25] batch: int[4] } We want to serialise below student data  { name:"Amit Gupta" roll: 1234 course:Computer Science" batch: 2018 } Our protocol follow the rule that we will insert a value and if space will remain empty we will fill it with $ for example length of "Amit Gupta" is 10 but standard size is 20 so will fill 10 $ after "Amit Gupta". So serialisation of above data will be Amit Gupta$$$$$$$$$$1234Computer Sc...

Variable In C

Variable Like any other programming language in C programming language, we use a variable to store value, a value is any data like a number a or a character. In this post, we will learn about datatype of C programming language. Type Of Variable In C In this section, we will discuss how to store the following type of variable in C How to store an integer in C? How to store a float in C? How to store a double in C? How to store a long in C? How to store a character in C? As we already discussed that variable used to store data so that we can use it of other computation, for example, suppose we want to calculate the sum of two number then we have to store these two numbers first only after that we can use these two stored value to compute the sum. The entity that used to store a value called variable. What does it mean is suppose we tell a variable to store a number whose value is 5, the variable will place this number 5 in memory and we can variable in...

Clique in Graph

Clique in Graph In this tutorial, we will learn about the clique in the graph theory. Clique In graph theory, a clique is a subset of vertices of an undirected graph such that every two distinct vertices in the clique are adjacent. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.

Supplementary angles

Supplementary angles Supplementary angles  are two angles with a sum of  180 ^\circ 1 8 0 ∘ 180, degree . A common case is when they lie on the same side of a straight line.