I have given six mocks in past three weeks. Another two are lined up for this week.

DI section is stable; VA is fluctuating but quant section??? No matter what I do, I am still falling few marks short from clearing the cut-off in QA. Is this your problem? Are you not confident enough to handle QA section in CAT-11? If your answer is Yes, Bingo! You are going to have a great time reading this article, and if your answer is No, even then I feel that I do not write that bad. Ok, so let us start with the name first. The strategy, which we are going to discuss in this article, is called Solving QUE-AAY, the Sanskrit graduate way. Yes, you heard it right. Like Engineers, Sanskrit graduates also have the right to dream of becoming a corporate biggie but unlike engineers, they do not have the knowledge of binomial distribution of probability or calculus approach of finding maxima-minima or formula for permuting a things of one type and b things of another type. So what does CAT think? How will Sanskrit-grads be able to handle the section, which is supposed to be an engineers forte? Roll on and in next 5 minutes of your reading, you will definitely know some interesting things about QUE-AAY section. 1. Even out your Odds: If ab*cd=1073 and ba*cd=2117, find the value of (ab+cd). Given that ab, ba, and cd all are two digit positive integers. (Some Old CL mock) a) 65 b) 66 c) 63 d) 95 You can either do some hit and trial and get that ab=37 and cd=29 and add these two to get the answer or you can apply some brain. See the question carefully. The numbers ab, ba, cd all are giving Odd numbers on multiplying. So all these numbers are definitely odd two digit integers and they will definitely give an even result when any two of them are added. Now check all the options and do not feel bad about your stupidity. Even I had done the same while solving this question. 2. Progress (-ion) is on the cards:

Sum of first n-terms of a geometric progression is given as Sn= (1/3)n + . If the sum of infinite terms of this series is unity, then (a) + =1 (b) 3- =-1 (c) + 2=-1 Old AIMCAT]. (d) 2+3=1 [Some

Well this is definitely not a geometry (some might get confused by the language) question so no cribbing on paper. Just think on very simple terms. Put n= and we have Sn=1 (given), so we get =1. Again put n=0, now you do not have any term to sum, so sum will be zero, 0= + , =-1. Check the options. See, there is no maths involved apart from the fact that (1/3) ^ is zero. The trick is to keep your mind open. 3. Count your chickens: There are five cities in a state and each of them is to be connected to two other cities using telephone lines. In how many ways this can be done. (a) 12 (b) 24 (c) 36 (d) 9. [CL mock]

You are not allowed to carry telephone wires in the examination hall to replicate the question in real, so why not do that on paper. Assume cities 1, 2,3,4,5, take combinations, say- 1 has connections with 2 and 3. 1 2

3 5

Now write all such combinations, [13,1212,1412,1513,1413,1514,15]= Six in total.

For any such combination say 12, 13, you have two ways, 24, 35, 45 12, 13 25, 34, 45 You cannot form a closed loop with 12-13-23 as you need two connections for each 4 and 5. This will be repeated for all six combinations. Therefore, in total there will be 6*2=12 ways. No PnC methods, just manual counting and we are getting three marks. What else do you want? 4. Probably-improbable: Two dice are thrown together n times in succession. Find the probability of obtaining 1 on the top face of both the dice in at least one of the throws. (a)1/36 (b) 1-(35/36)^n (c) (1/36)^n (d) (35/36)^n question] [Old CAT

Here, either you can play a game of Ludo with those two dices or you can go back to the basics. In case of an event, not taking place the probability will be zero. Now, put n=0 for no dice is being thrown and check the options. The answer was always there, right in front of your eyes. 5. Minimizing the maximum: Consider a right circular cone of base radius 4 cm and height 10 cm. A cylinder is to be placed inside the cone with one of the flat surfaces resting on the base of the cone. Find the largest possible total surface area of the cylinder. (a)100pi/3 (b)80pi/3 (c)120pi/7 (d)130pi/9 (e)110pi/7 [CAT08] Here you should first draw a cone and draw a cylinder inside it. Now assume that the height of the cylinder shrinks to zero. In that case cylinder will a like a circle (with radius equals to the base radius of the cone) with minimum surface area=2*pi*4*4=32pi. Check all the values in the options. The value that is greater than 32pi will be the answer.

We have seen how we can collect some quick marks by carefully identifying the questions and applying simple logic. However, like all other things, learning to use this approach also requires practice. So, from now on while attempting a mock keep your mind open and remember, Human mind is like a parachute, it works best when it is opened.