CAT 2023

FOUNDATION

Lecture–02

LOGICAL REASONING
Introduction & Essentials

BY
AMIT SURANA
 TOPICS
TO BE COVERED

• LOGICAL REASONING

• ESSENTIALS

• CLUES & CONDITIONS

• TYPES OF SETS
LOGICAL REASONING
Logical Reasoning

o Puzzle Based
o POV
o Traditional vs Unorthodox Solving
Topics Under LR

o Arrangements
o Distribution
o Games & Tournaments
o Maps & Networks
o Puzzles
o Venn Diagrams
 ESSENTIALS:
CLUES & CONDITIONS
Clues & Conditions

o Reading & Understanding

o Language
o Perception
o Focus
o Elimination
o Confirmation
Types Of Clues

o Direct & relevant

o Direct & less relevant
o Indirect
Direct & Relevant

o Gives exact position/value

o Always start with Direct & Relevant Clues
o Base your arrangement/grid
Direct & Less Relevant

o Gives complete but irrelevant information

o Select ones that are related to Direct &
Relevant clues
Indirect

o Gives incomplete information

o Use for elimination/confirmation
o Used for trial & error
Identify the types of clues and solve the puzzle

Five students, P, Q, R, S & T, are seated on a bench.

1. There are odd number of seats between R and Q.
2. S does not sit in the extremes.
3. T is a neighbor of R, but only one student sits to the left of T.
4. P sits equidistant to both extremes.
Five students, P, Q, R, S & T, are seated on a bench.
1. There are odd number of seats between R and Q.
2. S does not sit in the extremes.
3. T is a neighbor of R, but only one student sits to the left of T.
4. P sits equidistant to both extremes.
Five students, P, Q, R, S & T, are seated on a bench.
1. There are odd number of seats between R and Q.
2. S does not sit in the extremes.
3. T is a neighbor of R, but only one student sits to the left of T.
4. P sits equidistant to both extremes.
Solve the puzzle

Seven variables, a through g, take up distinct integer values.

1. The value of each variable is divisible only by two integers.
2. No variable is greater than b.
3. Variable e takes the same value as its position in the English
alphabet.
4. The product of a, d and e is 110.
5. The largest variable is not more than 19.
6. The product of a, c and f is of the form xyyx.
7. f 2 < 169.
8. There are exactly 5 variables greater than g.
Seven variables, a through g, take up distinct integer values.
1. The value of each variable is divisible only by two natural numbers.
2. No variable is greater than b.
3. Variable e takes the same value as its position in the English alphabet.
4. The product of a, d and e is 110.
5. The largest variable is not more than 19.
6. The product of a, c and f is of the form xyyx.
7. f 2 < 169.
8. There are exactly 5 variables greater than g.
Seven variables, a through g, take up distinct integer values.
1. The value of each variable is divisible only by two integers.
2. No variable is greater than b.
3. Variable e takes the same value as its position in the English alphabet.
4. The product of a, d and e is 110.
5. The largest variable is not more than 19.
6. The product of a, c and f is of the form xyyx.
7. f 2 < 169.
8. There are exactly 5 variables greater than g.
 ESSENTIALS:
TYPES OF SETS
Types Of Sets

o Arrangements
o Distribution
o Games & Tournaments
o Maps & Networks
o Puzzles
o Venn Diagrams
o Miscellaneous
Arrangements

o Linear
o Circular
A shopping mall has a large basement parking lot with parking slots painted in it along a
single row. These slots are quite narrow; a compact car can fit in a single slot but an SUV
requires two slots. When a car arrives, the parking attendant guides the car to the first
available slot from the beginning of the row into which the car can fit.

For our purpose, cars are numbered according to the order in which they arrive at the lot. For
example, the first car to arrive is given a number 1, the second a number 2, and so on. This
numbering does not indicate whether a car is a compact or an SUV. The configuration of a
parking lot is a sequence of the car numbers in each slot. Each single vacant slot is
represented by letter V.

For instance, suppose cars numbered 1 through 5 arrive and park, where cars 1, 3 and 5 are
compact cars and 2 and 4 are SUVs. At this point, the parking lot would be described by the
sequence 1, 2, 3, 4, 5. If cars 2 and 5 now vacate their slots, the parking lot would now be
described as 1, V, V, 3, 4. If a compact car (numbered 6) arrives subsequently followed by an
SUV (numbered 7), the parking lot would be described by the sequence 1, 6, V, 3, 4, 7.
Distribution
A journal plans to publish 18 research papers, written by eight authors (A, B, C, D, E, F, G, and
H) in four issues of the journal scheduled in January, April, July and October. Each of the
research papers was written by exactly one of the eight authors. Five papers were scheduled
in each of the first two issues, while four were scheduled in each of the last two issues. Every
author wrote at least one paper and at most three papers. The total number of papers written
by A, D, G and H was double the total number of papers written by the other four authors.
Four of the authors were from India and two each were from Japan and China. Each author
belonged to exactly one of the three areas — Manufacturing, Automation and Logistics. Four
of the authors were from the Logistics area and two were from the Automation area. As per
the journal policy, none of the authors could have more than one paper in any issue of the
journal.
Games & Tournaments

o Knockout
o Round Robin
o Double Round Robin
The game of Chango is a game where two people play against each other; one of them wins
and the other loses, i.e., there are no drawn Chango games. 12 players participated in a
Chango championship. They were divided into four groups: Group A consisted of Aruna, Azul,
and Arif; Group B consisted of Brinda, Brij, and Biju; Group C consisted of Chitra, Chetan, and
Chhavi; and Group D consisted of Dipen, Donna, and Deb.

Players within each group had a distinct rank going into the championship. The players have
NOT been listed necessarily according to their ranks. In the group stage of the game, the
second and third ranked players play against each other, and the winner of that game plays
against the first ranked player of the group. The winner of this second game is considered as
the winner of the group and enters a semi-final.

The winners from Groups A and B play against each other in one semi-final, while the winners
from Groups C and D play against each other in the other semi-final. The winners of the two
semi-finals play against each other in the final to decide the winner of the championship.

It is known that:
1. Chitra did not win the championship.
2. Aruna did not play against Arif. Brij did not play against Brinda.
3. Aruna, Biju, Chitra, and Dipen played three games each, Azul and Chetan played two games
each, and the remaining players played one game each.
Maps & Networks

o Possible Routes
o Quickest Routes
o Cheapest Routes
o Frequency/Occurrences
Given above is the schematic map of the metro lines in a city with rectangles denoting
terminal stations (e.g. A), diamonds denoting junction stations (e.g. R) and small filled-up
circles denoting other stations. Each train runs either in east-west or north-south direction,
but not both. All trains stop for 2 minutes at each of the junction stations on the way and for 1
minute at each of the other stations. It takes 2 minutes to reach the next station for trains
going in east-west direction and 3 minutes to reach the next station for trains going in north-
south direction. From each terminal station, the first train starts at 6 am; the last trains leave
the terminal stations at midnight. Otherwise, during the service hours, there are metro
service every 15 minutes in the north-south lines and every 10 minutes in the east-west lines.
A train must rest for at least 15 minutes after completing a trip at the terminal station, before
it can undertake the next trip in the reverse direction. (All questions are related to this metro
service only. Assume that if someone reaches a station exactly at the time a train is supposed
to leave, (s)he can catch that train.)
Puzzles

o Logical Based
o Math Based
Adhara, Bithi, Chhaya, Dhanavi, Esther, and Fathima are the interviewers in a process that
awards funding for new initiatives. Every interviewer individually interviews each of the
candidates individually and awards a token only if she recommends funding. A token has a
face value of 2, 3, 5, 7, 11, or 13. Each interviewer awards tokens of a single face value only.
Once all six interviews are over for a candidate, the candidate receives a funding that is
Rs.1000 times the product of the face values of all the tokens. For example, if a candidate has
tokens with face values 2, 5, and 7, then they get a funding of Rs.1000 × (2 × 5 × 7) =
Rs.70,000.
Pragnyaa, Qahira, Rasheeda, Smera, and Tantra were five candidates who received funding.
The funds they received, in descending order, were Rs.390,000, Rs.210,000, Rs.165,000,
Rs.77,000, and Rs.66,000.
The following additional facts are known:
1. Fathima awarded tokens to everyone except Qahira, while Adhara awarded tokens to no
one except Pragnyaa.
2. Rashida received the highest number of tokens that anyone received, but she did not
receive one from Esther.
3. Bithi awarded a token to Smera but not to Qahira, while Dhanavi awarded a token to
Qahira but not to Smera.
Venn Diagram

o 2 Set
o 3 Set
o 4 Set
A speciality supermarket sells 320 products. Each of these products was either a cosmetic
product or a nutrition product. Each of these products was also either a foreign product or a
domestic product. Each of these products had at least one of the two approvals – FDA or EU.

The following facts are also known:

1. There were equal numbers of domestic and foreign products.

2. Half of the domestic products were FDA approved cosmetic products.
3. None of the foreign products had both the approvals, while 60 domestic products had both
the approvals.
4. There were 140 nutrition products, half of them were foreign products.
5. There were 200 FDA approved products. 70 of them were foreign products and 120 of them
were cosmetic products.
Miscellaneous

o Quant Based
o Coding/Decoding Based
Each of the bottles mentioned in this question contains 50 ml of liquid. The liquid in any
bottle can be 100% pure content (P) or can have certain amount of impurity (I). Visually it is
not possible to distinguish between P and I. There is a testing device which detects impurity,
as long as the percentage of impurity in the content tested is 10% or more.

For example, suppose bottle 1 contains only P, and bottle 2 contains 80% P and 20% I. If
content from bottle 1 is tested, it will be found out that it contains only P. If content of bottle 2
is tested, the test will reveal that it contains some amount of I. If 10 ml of content from bottle
1 is mixed with 20 ml content from bottle 2, the test will show that the mixture has impurity,
and hence we can conclude that at least one of the two bottles has I. However, if 10 ml of
content from bottle 1 is mixed with 5 ml of content from bottle 2. the test will not detect any
impurity in the resultant mixture.
Things To Remember

o Read the question statement, clues & conditions

thoroughly to avoid silly mistakes
o Make a habit of writing down important & relevant
information
o Read the questions after reading the information (Easter
Eggs)
o Never judge a set by its size/looks
o Solve the DPPs