Logical Reasoning


Logical Reasoning is always the toughest part of CAT. In CAT LR questions usually comes with 2/3 bits . A paragraph is given with full of information followed by 2/3 questions. You have to read it and use your logic to answer the questions. In 3 sections CAT paper there is no special section on LR but one can expect LR questions to be present in any section.

The main idea behind LR is to is use the information and preconditions to make a conclusion

Most problems give a variety of conditions and you must use an "if"-"then" approach. It's important that you read the whole problem, and choose the best hint or clue before starting to solve the problem. When practicing logic with reasoning making a chart or drawing a picture are good strategies. Before starting any LR problem it s advised to keep few points in mind.

Important Tips for Logical Reasoning

Before you try to answer a few sample questions, here are some general test-taking tips that should help you with the Logical Reasoning section.

  1. Study the question carefully. A brief explanation of why each choice is correct or incorrect follows each practice question. If you understand this reasoning for the practice items, you will do well on the actual assessment.

  2. NEVER assume or use any information that the question fails to give you. This is NOT an assessment of how much you know about economics in general! Consider ONLY the information given in each reading passage when choosing among the alternative responses.

  3. Read both the factual passage and the sentence completion instruction carefully. Both must be considered in making your choice.

  4. Be sure to read all the response choices carefully before choosing one.

  5. In questions that ask you to select a valid conclusion, always choose the one conclusion that must definitely follow from the information you are given. In questions that ask you to find the invalid alternative, choose the one conclusion that does not definitely follow from the information.

  6. Pay special attention to words like "all," "some," or "none" when you read the factual information each question gives you. Other qualifying words such as "other than," "only" or "unless" are important, too. These words can play a critical part in precisely specifying the facts to be used in your reasoning.

  7. Pay attention to negative prefixes also, such as non-, un-, or dis-. These can be crucial to specifying the basic facts in the paragraph.

  8. "Test-taking" courses or your college instructors may have advised you to avoid any response choices that contain the quantifiers "all" or "none." In both the practice questions here and in the actual economist assessment, these words are NOT signs of incorrect response choices. They will appear in both correct and incorrect response choices.

  9. Pay close attention to the word "ONLY" and to the phrase "IF AND ONLY IF." Saying "The door will open IF AND ONLY IF both keys are used" sets up a highly specific condition that must be met. There is exactly one way to open the door-you must use both keys. By contrast, if the sentence says, "The door will open if the key is used," there may be several ways to open the door besides by using the key.

  10. The questions in the assessment will vary in difficulty level, and difficult questions will be mixed in with easier ones throughout the assessment. When you encounter a question that is difficult for you, try drawing diagrams or other schematic notes on the "scratch" paper provided to support and confirm your thought processes. Also, bear in mind that you can stop working on a difficult question temporarily and return to it later.


Q. 1 to 4 are based on the following information:
- Ghosh Babu’s new interest is psychology. He has identified various personality
patterns and given them names. These personality patterns are inter-related as
- All Alessandras, Belissimas, Cassandras, Desdemonas, Elissimas and Firdauses
are Queens.
- All Alessandras are Belissimas.
- No Belissima that is not an Alessandra is a Firdaus.
- Some Cassandras are Alessandras.
- All Desdemonas are Cassandras.
- Some Cassandras are not Belissimas.
- No Desdemona is an Alessandra.
- All Queens and only Queens that are neither Belissimas nor Cassandras are

1. Which of the following is true?
(1) All Firdauses are Alessandras.
(2) Some Firdauses are Alessandras.
(3) All Firdauses are either Alessandras, Cassandras or Elissimas.
(4) Some Firdauses are Cassandras.

2. Which of the following is not true?
(1) No Desdemonas are Belissimas.
(2) Some Belissimas are Desdemonas.
(3) Some Firdauses are both Belissimas and Cassandras.
(4) Some Queens are neither Belissimas nor Elissimas.

3. Which of the following cannot be said to be true or false?
I. No Belissima or Cassandra is an Elissima.
II. Some Cassandras are Belissimas but not Alessandras.
III. No Belissima is both an Alessandra and a Desdemona.
(1) I only (2) II only (3) III only (4) I & II

4. Peter is not a Belissima, therefore,
(1) Peter is an Elissima
(2) If Peter is a Queen, he is an Elissima or Cassandra.
(3) If Peter is not an Elissima, he is a Cassandra.
(4) None of the above

ANSWERS: 1. (3) 2. (1) 3. (2) 4. (2)


DIRECTIONS for questions 5 to 7: Answer the following questions based on the passage below.

A group of three or four has to be selected from seven persons. Among the seven are two women, Fiza and Kavita, and five men: Ram, Shyam, David, Peter and Rahim. Ram would not like to be in the group if Shyam is also selected. Shyam and Rahim want to be selected together in the group. Kavita would like to be in the group only if David is also there. David, if selected, would not like Peter in the group. Ram would like to be in the group only if Peter is also there. David insists that Fiza be selected in case he is there in the group.

5. Which of the following statements is true?
a. Kavita and Ram can be part of a group of four.
b. A group of four can have two women.
c. A group of four can have all four men.
d. None of the above

6. Which of the following is a feasible group of four?
a. Ram, Peter, Fiza, Rahim
b. Shyam, Rahim, Kavita, David
c. Shyam, Rahim, Fiza, David
d. Fiza, David, Ram, Peter

7. Which of the following is a feasible group of three?
a. David, Ram, Rahim
b. Peter, Shyam, Rahim
c. Kavita, David, Shyam
d. Fiza, David, Ram

5. d The group of 4 cannot be made, except S + R + F + D.
6. c From the above
7. b In all the other choices we have D, who insist that F be with him.


Directions for 8 – 10: Mr. Doubt fire has an unique way of attempting the question paper having 50 Qs. He starts from question 1 and attempts all questions which are terms of the A. P with a common difference of 3 in the forward direction and 3 in the reverse direction. If he reaches a stage when he cannot attempt any more question he starts in the reverse direction with the first unanswered question. He repeats the same process and when he reaches a stage when he can’t process any further, he reverses his direction again
starting with the first unanswered question

8. Which is the 20th question he answers?
(A) 50
(b) 48
(c) 47
(d) 44

9. Which is the last question that he answers if he attempts all the 50 questions?
(a) 50
(b) 49
(c) 48
(d) 3

10. How many times does he reverse his direction?
(a) 3
(b) 4
(c) 5
(d) 6

8. (d)
9. (b)
10. (a)

searchin-life's picture
Last seen: 10 years 7 weeks ago
Joined: 2007-03-03
My Solutions is

My Solutions is

1 4 7 10 13 16 19 22 25 28 31 34 37 40 43 46 49
50 47 44 41 38 35 32 29 26 23 20 17 14 11 8 5 2
3 6 9 12 15 18 21 24 27 30 33 36 39 42 45 48

From the above sequence you can get all the answers. Though its not the right way of attempting the Qs. Just to make things easier I wrote it.

20th term is 44
Last Qs he answers is 48 (ok the answer is wrong)
3 times he reverses his direction

you should attempt the Qs like
a=1 and d=3 and max value possible is 50 so 17th term ll be 49 and after that it ll reverse the direction from number 50
then 20th term is 44

similarly you can answer ii and iii bit

nayna (not verified)
nayna's picture

hi my name is nayna & im intrested in solving the problem on mba entrance test

Incognito (not verified)
nayna's picture

I have lot of question papers to solve . If u want I can send u that

bhavesh143's picture
Last seen: 8 years 21 weeks ago
Joined: 2008-10-10
ok dear send it to me
ok dear send it to me




leela (not verified)
nayna's picture
ans my question

You have a 7 kg gold bar. And you are allowed to give 1 kg gold to a person working under you,
     at the end of each day work. and work will be completed in 7 days. now, you are allowed to cut
     the gold bar twice only. how will you give 1kg gold at the each end of day?

Incognito (not verified)
nayna's picture
Here goes the solution for

Here goes the solution for this

First cut the gold for only one piece.One the first day give that one piece.On the second day cut the gold for two pieces put together so that u will get 2 pieces.Get back tat one piece and give this combined piece of 2 on the second day.On the third day give tat one piece so tat it will make 3 pieces.Out of 7kg you have made 2 cuts  and the remaining is 4 pieces.So on 4th day give tat 4kg bar and get back all the pieces.Likewise u can make this happening for all 7 days.

7 = 4+2+1(u can get all the nos frm 1-7 with this combination).


deepakraam's picture
Last seen: 6 years 50 weeks ago
Joined: 2007-06-22
The funda for this question

The funda for this question is 7 = 4+2+1.With this combination u can make all the nos from 1-7.So cut the 7kg bar in  this fashion.Here + sign denotes the cuts made so u can make 2 cuts and get all the nos possible frm 1-7 in this manner.

First day : 1
Second day : 2
Third day : 2+1
Fourth day : 4
Fifth day : 4+1
Sixth day : 4+2
Seventh day : 4+2+1.


basu (not verified)
nayna's picture
plz send papers

please send logicl reasoning papers . its urgent 

Incognito (not verified)
nayna's picture
question papers

I am pawan,can u send me all the question papers u hav to my mail please

Incognito (not verified)
nayna's picture
Send me also

Please send the papers to me also

Sponsered Links

All Rights Reserved. Copyright 2006-10 CAT4MBA.com.