{"id":64465,"date":"2025-02-19T16:00:54","date_gmt":"2025-02-19T10:30:54","guid":{"rendered":"https:\/\/cracku.in\/blog\/?p=64465"},"modified":"2025-02-24T11:32:24","modified_gmt":"2025-02-24T06:02:24","slug":"cat-2020-lrdi-slot-3-questions-pdf","status":"publish","type":"post","link":"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/","title":{"rendered":"CAT 2020 LRDI Slot-3 Questions PDF"},"content":{"rendered":"<h1><span style=\"font-size: 24pt;\"> \u00a0CAT 2020 Slot 3 LRDI Questions PDF<\/span><\/h1>\n<p>Download CAT 2020 LRDI Slot-3 Questions PDF with detailed solutions. Practice Data Interpretation and Logical Reasoning Slot-3 Questions asked in the CAT exam to understand the type and level of questions asked in the exam.<\/p>\n<p class=\"text-center\"><a href=\"https:\/\/cracku.in\/downloads\/12012\" target=\"_blank\" class=\"btn btn-danger  download\">Download CAT 2020 LRDI Slot-3 Questions PDF<\/a><\/p>\n<p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat-mock-test\" target=\"_blank\" class=\"btn btn-info \">CAT Mock Tests<\/a><\/p>\n<p>Enroll to <a href=\"https:\/\/cracku.in\/cat-2021-online-coaching\" target=\"_blank\" rel=\"noopener noreferrer\">CAT 2021 online coaching<\/a><\/p>\n<p><b>Instructions<\/b><\/p>\n<p>Sixteen patients in a hospital must undergo a blood test for a disease. It is known that exactly\u00a0one of them has the disease. The hospital has only eight testing kits and has decided to pool\u00a0blood samples of patients into eight vials for the tests. The patients are numbered 1 through\u00a016, and the vials are labelled A, B, C, D, E, F, G, and H. The following table shows the vials\u00a0into which each patient\u2019s blood sample is distributed.<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/348394.png\" data-image=\"348394.png\" \/><\/figure>\n<p>If a patient has the disease, then each vial containing his\/her blood sample will test positive. If\u00a0a vial tests positive, one of the patients whose blood samples were mixed in the vial has the\u00a0disease. If a vial tests negative, then none of the patients whose blood samples were mixed in\u00a0the vial has the disease.<\/p>\n<p><b><strong>Download <a href=\"https:\/\/play.google.com\/store\/apps\/details?id=in.cracku.app&amp;hl=en_IN&amp;gl=US\" target=\"_blank\" rel=\"noopener noreferrer\">Free MBA Preparation App<\/a><\/strong><br \/>\nQuestion 1:\u00a0<\/b>Suppose vial C tests positive and vials A, E and H test negative. Which patient\u00a0has the disease?<\/p>\n<p>a)\u00a0Patient 14<\/p>\n<p>b)\u00a0Patient 8<\/p>\n<p>c)\u00a0Patient 6<\/p>\n<p>d)\u00a0Patient 2<\/p>\n<p><b>Question 2:\u00a0<\/b>Suppose vial A tests positive and vials D and G test negative. Which of the\u00a0following vials should we test next to identify the patient with the disease?<\/p>\n<p>a)\u00a0Vial B<\/p>\n<p>b)\u00a0Vial E<\/p>\n<p>c)\u00a0Vial C<\/p>\n<p>d)\u00a0Vial H<\/p>\n<p><b><p class=\"text-center\"><a href=\"https:\/\/cracku.in\" target=\"_blank\" class=\"btn btn-danger \">CAT Online Coaching<\/a><\/p><br \/>\nQuestion 3:\u00a0<\/b>Which of the following combinations of test results is NOT possible?<\/p>\n<p>a)\u00a0Vials A and E positive, vials C and D negative<\/p>\n<p>b)\u00a0Vial B positive, vials C, F and H negative<\/p>\n<p>c)\u00a0Vials A and G positive, vials D and E negative<\/p>\n<p>d)\u00a0Vials B and D positive, vials F and H negative<\/p>\n<p><b>Question 4:\u00a0<\/b>Suppose one of the lab assistants accidentally mixed two patients&#8217; blood\u00a0samples before they were distributed to the vials. Which of the following\u00a0correctly represents the set of all possible numbers of positive test\u00a0results out of the eight vials?<\/p>\n<p>a)\u00a0{5,6,7,8}<\/p>\n<p>b)\u00a0{4,5,6,7}<\/p>\n<p>c)\u00a0{4,5,6,7,8}<\/p>\n<p>d)\u00a0{4,5}<\/p>\n<p><b><p class=\"text-center\"><a href=\"https:\/\/t.me\/CatWithCracku\" target=\"_blank\" class=\"btn btn-info \">Join 30K MBA Aspirants Telegram Group<\/a><\/p><br \/>\nInstructions<\/b><\/p>\n<p>XYZ organization got into the business of delivering groceries to home at the beginning of the\u00a0last month. They have a two-day delivery promise. However, their deliveries are unreliable. An\u00a0order booked on a particular day may be delivered the next day or the day after. If the order is\u00a0not delivered at the end of two days, then the order is declared as lost at the end of the second\u00a0day. XYZ then does not deliver the order, but informs the customer, marks the order as lost,\u00a0returns the payment and pays a penalty for non-delivery.\u00a0The following table provides details about the operations of XYZ for a week of the last month.\u00a0The first column gives the date, the second gives the cumulative number of orders that were\u00a0booked up to and including that day. The third column represents the number of orders\u00a0delivered on that day. The last column gives the cumulative number of orders that were lost up\u00a0to and including that day.\u00a0It is known that the numbers of orders that were booked on the 11th, 12th, and 13th of the last\u00a0month that took two days to deliver were 4, 6, and 8 respectively<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/348401.png\" data-image=\"348401.png\" \/><\/figure>\n<p><b>Question 5:\u00a0<\/b>Among the following days, the largest fraction of orders booked on which day was\u00a0lost?<\/p>\n<p>a)\u00a015th<\/p>\n<p>b)\u00a016th<\/p>\n<p>c)\u00a013th<\/p>\n<p>d)\u00a014th<\/p>\n<p><a href=\"https:\/\/cracku.in\/blog\/how-to-prepare-for-reading-comprehension-for-cat\/\" target=\"_blank\" rel=\"noopener noreferrer\">How to prepare for RC<\/a><\/p>\n<p><a href=\"https:\/\/cracku.in\/blog\/para-jumbles-and-odd-one-out-for-cat\/\" target=\"_blank\" rel=\"noopener noreferrer\">How to prepare for PJ and Odd one out<\/a><\/p>\n<p><b>Question 6: <\/b>On which of the following days was the number of orders booked the highest?<\/p>\n<p>a)\u00a012th<\/p>\n<p>b)\u00a015th<\/p>\n<p>c)\u00a013th<\/p>\n<p>d)\u00a014th<\/p>\n<p><b>Question 7:\u00a0<\/b>The delivery ratio for a given day is defined as the ratio of the number of orders\u00a0booked on that day which are delivered on the next day to the number of orders\u00a0booked on that day which are delivered on the second day after booking. On which of\u00a0the following days, was the delivery ratio the highest?<\/p>\n<p>a)\u00a015th<\/p>\n<p>b)\u00a016th<\/p>\n<p>c)\u00a013th<\/p>\n<p>d)\u00a014th<\/p>\n<p><b>Question 8:\u00a0<\/b>The average time taken to deliver orders booked on a particular day is computed as\u00a0follows. Let the number of orders delivered the next day be x and the number of\u00a0orders delivered the day after be y. Then the average time to deliver order is\u00a0$\\frac{(x+2y)}{(x+y)}$. On which of the following days was the average time taken to deliver\u00a0orders booked the least?<\/p>\n<p>a)\u00a015th<\/p>\n<p>b)\u00a013th<\/p>\n<p>c)\u00a014th<\/p>\n<p>d)\u00a016th<\/p>\n<p><b>Instructions<\/b><\/p>\n<p>A farmer had a rectangular land containing 205 trees. He distributed that land among his four\u00a0daughters &#8211; Abha, Bina, Chitra and Dipti by dividing the land into twelve plots along three\u00a0rows (X,Y,Z) and four Columns (1,2,3,4) as shown in the figure below:<\/p>\n<figure style=\"max-width: 228px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/1_k6JHq9K.png\" width=\"228\" height=\"175\" data-image=\"1.png\" \/><\/figure>\n<p>The plots in rows X, Y, Z contained mango, teak and pine trees respectively. Each plot had\u00a0trees in non-zero multiples of 3 or 4 and none of the plots had the same number of\u00a0trees. Each daughter got an even number of plots. In the figure, the number mentioned in top\u00a0left corner of a plot is the number of trees in that plot, while the letter in the bottom right corner\u00a0is the first letter of the name of the daughter who got that plot (For example, Abha got the plot\u00a0in row Y and column 1 containing 21 trees). Some information in the figure got erased, but the\u00a0following is known:<\/p>\n<p>1. Abha got 20 trees more than Chitra but 6 trees less than Dipti.<br \/>\n2. The largest number of trees in a plot was 32, but it was not with Abha.<br \/>\n3. The number of teak trees in Column 3 was double of that in Column 2 but was half of that\u00a0in Column 4.<br \/>\n4. Both Abha and Bina got a higher number of plots than Dipti.<br \/>\n5. Only Bina, Chitra and Dipti got corner plots.<br \/>\n6. Dipti got two adjoining plots in the same row.<br \/>\n7. Bina was the only one who got a plot in each row and each column.<br \/>\n8. Chitra and Dipti did not get plots which were adjacent to each other (either in row \/ column \/\u00a0diagonal).<br \/>\n9. The number of mango trees was double the number of teak trees.<\/p>\n<p><b>Question 9:\u00a0<\/b>How many mango trees were there in total?<\/p>\n<p>a)\u00a049<\/p>\n<p>b)\u00a084<\/p>\n<p>c)\u00a098<\/p>\n<p>d)\u00a0126<\/p>\n<p><b>Question 10:\u00a0<\/b>Which of the following is the correct sequence of trees received by Abha, Bina, Chitra\u00a0and Dipti in that order?<\/p>\n<p>a)\u00a050, 69, 30, 56<\/p>\n<p>b)\u00a054, 57, 34, 60<\/p>\n<p>c)\u00a044, 87, 24, 50<\/p>\n<p>d)\u00a060, 39, 40, 66<\/p>\n<p><b>Question 11:\u00a0<\/b>How many pine trees did Chitra receive?<\/p>\n<p>a)\u00a018<\/p>\n<p>b)\u00a030<\/p>\n<p>c)\u00a021<\/p>\n<p>d)\u00a015<\/p>\n<p><b>Question 12:\u00a0<\/b>Who got the plot with the smallest number of trees and how many trees did that plot\u00a0have?<\/p>\n<p>a)\u00a0Dipti, 6 trees<\/p>\n<p>b)\u00a0Bina, 3 trees<\/p>\n<p>c)\u00a0Bina, 4 trees<\/p>\n<p>d)\u00a0Abha, 4 trees<\/p>\n<p><b>Question 13:\u00a0<\/b>Which of the following statements is NOT true?<\/p>\n<p>a)\u00a0Chitra got 12 mango trees<\/p>\n<p>b)\u00a0Bina got 32 pine trees.<\/p>\n<p>c)\u00a0Abha got 41 teak trees.<\/p>\n<p>d)\u00a0Dipti got 56 mango trees<\/p>\n<p><b>Question 14:\u00a0<\/b>Which column had the highest number of trees?<\/p>\n<p>a)\u00a04<\/p>\n<p>b)\u00a03<\/p>\n<p>c)\u00a0Cannot be determined<\/p>\n<p>d)\u00a02<\/p>\n<p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat-previous-papers\" target=\"_blank\" class=\"btn btn-danger \">Download CAT Previous Papers PDF<\/a><\/p>\n<p class=\"text-center\"><a href=\"https:\/\/cracku.in\/free-cat-video-lectures\" target=\"_blank\" class=\"btn btn-primary \">Take Free CAT Video Lectures<\/a><\/p>\n<p><b><br \/>\nInstructions<\/b><\/p>\n<p>The Hi-Lo game is a four-player game played in six rounds. In every round, each player\u00a0chooses to bid Hi or Lo. The bids are made simultaneously. If all four bid Hi, then all four lose\u00a01 point each. If three players bid Hi and one bids Lo, then the players bidding Hi gain 1 point\u00a0each and the player bidding Lo loses 3 points. If two players bid Hi and two bid Lo, then the\u00a0players bidding Hi gain 2 points each and the players bidding Lo lose 2 points each. If one\u00a0player bids Hi and three bid Lo, then the player bidding Hi gains 3 points and the players\u00a0bidding Lo lose 1 point each. If all four bid Lo, then all four gain 1 point each.\u00a0Four players Arun, Bankim, Charu, and Dipak played the Hi-Lo game. The following facts are\u00a0known about their game:<\/p>\n<p>1. At the end of three rounds, Arun had scored 6 points, Dipak had scored 2 points, Bankim\u00a0and Charu had scored -2 points each.<br \/>\n2. At the end of six rounds, Arun had scored 7 points, Bankim and Dipak had scored -1 point\u00a0each, and Charu had scored -5 points.<br \/>\n3. Dipak\u2019s score in the third round was less than his score in the first round but was more than\u00a0his score in the second round.<br \/>\n4. In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p><b>Question 15:\u00a0<\/b>What were the bids by Arun, Bankim, Charu and Dipak, respectively in the first round?<\/p>\n<p>a)\u00a0Hi, Lo, Lo, Hi<\/p>\n<p>b)\u00a0Hi, Lo, Lo, Lo<\/p>\n<p>c)\u00a0Hi, Hi, Lo, Lo<\/p>\n<p>d)\u00a0Lo, Lo, Lo, Hi<\/p>\n<p><b>Question 16:\u00a0<\/b>In how many rounds did Arun bid Hi?<\/p>\n<p><b>Question 17:\u00a0<\/b>In how many rounds did Bankim bid Lo?<\/p>\n<p><b>Question 18:\u00a0<\/b>In how many rounds did all four players make identical\u00a0bids?<\/p>\n<p><b>Question 19:\u00a0<\/b>In how many rounds did Dipak gain exactly 1 point?<\/p>\n<p><b>Question 20:\u00a0<\/b>In which of the following rounds, was Arun DEFINITELY the only player to bid Hi?<\/p>\n<p>a)\u00a0Second<\/p>\n<p>b)\u00a0Third<\/p>\n<p>c)\u00a0Fourth<\/p>\n<p>d)\u00a0First<\/p>\n<p><b><strong><p class=\"text-center\"><a href=\"https:\/\/cracku.in\/blog\/cat-formulas-pdf\/\" target=\"_blank\" class=\"btn btn-danger \">Download CAT Maths formulas PDF<\/a><\/p><\/strong><br \/>\nInstructions<\/b><\/p>\n<p>A survey of 600 schools in India was conducted to gather information about their\u00a0online teaching learning processes (OTLP). The following four facilities were studied.<\/p>\n<p>F1: Own software for OTLP<br \/>\nF2: Trained teachers for OTLP<br \/>\nF3: Training materials for OTLP<br \/>\nF4: All students having Laptops<\/p>\n<p>The following observations were summarized from the survey.<\/p>\n<p>1. 80 schools did not have any of the four facilities &#8211; F1, F2, F3, F4.<br \/>\n2. 40 schools had all four facilities.<br \/>\n3. The number of schools with only F1, only F2, only F3, and only F4 was 25, 30, 26 and 20\u00a0respectively.<br \/>\n4. The number of schools with exactly three of the facilities was the same irrespective of\u00a0which three were considered.<br \/>\n5. 313 schools had F2.<br \/>\n6. 26 schools had only F2 and F3 (but neither F1 nor F4).<br \/>\n7. Among the schools having F4, 24 had only F3, and 45 had only F2.<br \/>\n8. 162 schools had both F1 and F2.<br \/>\n9. The number of schools having F1 was the same as the number of schools having F4.<\/p>\n<p><b>Question 21:\u00a0<\/b>What was the total number of schools having exactly three of the four facilities?<\/p>\n<p>a)\u00a064<\/p>\n<p>b)\u00a050<\/p>\n<p>c)\u00a0200<\/p>\n<p>d)\u00a080<\/p>\n<p><b>Question 22:\u00a0<\/b>What was the number of schools having facilities F2 and F4?<\/p>\n<p>a)\u00a0185<\/p>\n<p>b)\u00a095<\/p>\n<p>c)\u00a045<\/p>\n<p>d)\u00a085<\/p>\n<p><b>Question 23:\u00a0<\/b>What was the number of schools having only facilities F1\u00a0and F3?<\/p>\n<p><b>Question 24:\u00a0<\/b>What was the number of schools having only facilities F1\u00a0and F4?<\/p>\n<p><span style=\"text-decoration: underline;\"><strong>Answers &amp; Solutions:<\/strong><\/span><\/p>\n<p><strong>1)\u00a0Answer\u00a0(C)<\/strong><\/p>\n<p>The patients in<\/p>\n<p>Vial A: 9, 10, 11, 12, 13, 14, 15, 16<\/p>\n<p>Vial B: 1, 2, 3, 4, 5, 6, 7, 8.<\/p>\n<p>Vial C: 5,6,7,8,13,14,15,16<\/p>\n<p>Vial D:1,2,3,4,9,10,11,12<\/p>\n<p>Vial E:3,4,7,8,11,12,15,16<\/p>\n<p>Vial F:1,2,5,6,9,10,13,14<\/p>\n<p>Vial G:2,4,6,8,10,12,14,16<\/p>\n<p>Vial H:1,3,5,7,9,11,13,15<\/p>\n<p>If\u00a0vial C tests positive and vials A, E and H test negative then\u00a0Patient 6 must have disease as all other patients in Vial C expect patient 6 are present in at least one of A, E, H.<\/p>\n<p><strong>2)\u00a0Answer\u00a0(B)<\/strong><\/p>\n<p>The patients in<\/p>\n<p>Vial A: 9, 10, 11, 12, 13, 14, 15, 16<\/p>\n<p>Vial B: 1, 2, 3, 4, 5, 6, 7, 8.<\/p>\n<p>Vial C: 5,6,7,8,13,14,15,16<\/p>\n<p>Vial D:1,2,3,4,9,10,11,12<\/p>\n<p>Vial E:3,4,7,8,11,12,15,16<\/p>\n<p>Vial F:1,2,5,6,9,10,13,14<\/p>\n<p>Vial G:2,4,6,8,10,12,14,16<\/p>\n<p>Vial H:1,3,5,7,9,11,13,15<\/p>\n<p>Suppose vial A tests positive and vials D and G test negative then the patient who tested positive must be one of patient 13 or 15.<\/p>\n<p>Patient 13 or 15 are not present in vial B. So, A is not the answer.<\/p>\n<p>Both patients present in vial C. Even if tested positive or negative we can&#8217;t know who has got the disease.\u00a0So, C is not the answer.<\/p>\n<p>Both patients present in vial H. Even if tested positive or negative we can&#8217;t know who has got the disease.\u00a0So, H is not the answer.<\/p>\n<p>only patient 15 is present in vial E, if tested positive then patient 15 has the disease else patient 13 as disease.<\/p>\n<p>Hence Option 2 is correct.<\/p>\n<p><strong>3)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>The patients in<\/p>\n<p>Vial A: 9, 10, 11, 12, 13, 14, 15, 16<\/p>\n<p>Vial B: 1, 2, 3, 4, 5, 6, 7, 8.<\/p>\n<p>Vial C: 5,6,7,8,13,14,15,16<\/p>\n<p>Vial D:1,2,3,4,9,10,11,12<\/p>\n<p>Vial E:3,4,7,8,11,12,15,16<\/p>\n<p>Vial F:1,2,5,6,9,10,13,14<\/p>\n<p>Vial G:2,4,6,8,10,12,14,16<\/p>\n<p>Vial H:1,3,5,7,9,11,13,15<\/p>\n<p>If vials C and D negative then no patient could test negative. Hence A is correct answer.<\/p>\n<p><strong>4)\u00a0Answer\u00a0(C)<\/strong><\/p>\n<p>Let one of the patients, patient 1 or patient 16 has the disease and his blood is mixed with other them all 8 vials will tests positive. \u21d2<\/p>\n<p>8 has to be one of the answers.<\/p>\n<p>If patient 2 and patients 16\u2019s blood is mixed of one of them has the disease then 7 of the 8 vials will test positive. So 7 has to be there<br \/>\nin the option.<\/p>\n<p>If 1 has the disease and 1, 7 are mixed then 6 out the 8 vials tests positive.<\/p>\n<p>IF 1 has the disease and 1,9 are mixed then 5 of the 8 vials tests positive,<\/p>\n<p>Now, let us assume that patient 1 has the disease if his blood is not mixed,<br \/>\nthen 4 vials will definitely show positive.<\/p>\n<p>Hence 3 is the correct answer.<\/p>\n<p><strong>5)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>The cumulative orders booked by 19th are 337 and that of 18th are 332=&gt; No. orders booked on 19th are 5<\/p>\n<p>Similarly we can find the orders booked on that day till 14th.<\/p>\n<p>Number of orders lost that were booked on 12th = Cumulative orders lost till 14th-Cumulative orders lost till 13th =92-91=1<\/p>\n<p>Similarly, the number of orders lost till 17th can be found out.<\/p>\n<p>Number of orders delivered on 13th are 11 out of which 4 are orders which were booked in 11th so, 7 must be the orders which were booked on 12th.<\/p>\n<p>Similarly, we can find the orders which took 1day and 2 days to get delivered till 17th.<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_YLoqeEp.png\" data-image=\"image.png\" \/><\/figure>\n<p>Now, total number of orders booked on 12th will be 7+6=1=14.<\/p>\n<p>Fraction of orders booked on 15th that were lost = 12\/28<\/p>\n<p>Fraction of orders booked on 16th that were lost = 2\/25<\/p>\n<p>Fraction of orders booked on 13th that were lost =2\/31<\/p>\n<p>Fraction of orders booked on 14th that were lost = 8\/30.<\/p>\n<p>.&#8217;. Option A is correct answer.<\/p>\n<p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat-daily-target\/\" target=\"_blank\" class=\"btn btn-info \">Take Free CAT Daily Tests (With Video Solutions)<\/a><\/p>\n<p><strong><br \/>\n6)\u00a0Answer\u00a0(C)<\/strong><\/p>\n<p>The cumulative orders booked by 19th are 337 and that of 18th are 332=&gt; No. orders booked on 19th are 5<\/p>\n<p>Similarly we can find the orders booked on that day till 14th.<\/p>\n<p>Number of orders lost that were booked on 12th = Cumulative orders lost till 14th-Cumulative orders lost till 13th =92-91=1<\/p>\n<p>Similarly, the number of orders lost till 17th can be found out.<\/p>\n<p>Number<br \/>\nof orders delivered on 13th are 11 out of which 4 are orders which were<br \/>\nbooked in 11th so, 7 must be the orders which were booked on 12th.<\/p>\n<p>Similarly, we can find the orders which took 1day and 2 days to get delivered till 17th.<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_nBjdL5i.png\" data-image=\"image.png\" \/><\/figure>\n<p>Now, total number of orders booked on 12th will be 7+6+1=14.<\/p>\n<p>The total number of orders placed on 13th = 21+8+2 = 31<\/p>\n<p>FRom the table we can determine that among options, number of orders booked on 13th are maximum.<\/p>\n<p><strong>7)\u00a0Answer\u00a0(D)<\/strong><\/p>\n<p>The cumulative orders booked by 19th are 337 and that of 18th are 332=&gt; No. orders booked on 19th are 5<\/p>\n<p>Similarly we can find the orders booked on that day till 14th.<\/p>\n<p>Number of orders lost that were booked on 12th = Cumulative orders lost till 14th-Cumulative orders lost till 13th =92-91=1<\/p>\n<p>Similarly, the number of orders lost till 17th can be found out.<\/p>\n<p>Number<br \/>\nof orders delivered on 13th are 11 out of which 4 are orders which were<br \/>\nbooked in 11th so, 7 must be the orders which were booked on 12th.<\/p>\n<p>Similarly, we can find the orders which took 1day and 2 days to get delivered till 17th.<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_NesCJs1.png\" data-image=\"image.png\" \/><\/figure>\n<p>Now, total number of orders booked on 12th will be 7+6+1=14.<\/p>\n<p>From the table we can determine that among options, number of orders booked on 13th are maximum.<\/p>\n<p>For 15 the delivery ratio = 8\/8 = 1<\/p>\n<p>For 16 the delivery ratio = 13\/10 = 1.3<\/p>\n<p>For 13 the delivery ratio = 21\/8 = 2.625<\/p>\n<p>For 14 the delivery ratio = 15\/3 = 5<\/p>\n<p>Hence Option D<\/p>\n<p><strong>8)\u00a0Answer\u00a0(C)<\/strong><\/p>\n<p>The cumulative orders booked by 19th are 337 and that of 18th are 332=&gt; No. orders booked on 19th are 5<\/p>\n<p>Similarly we can find the orders booked on that day till 14th.<\/p>\n<p>Number of orders lost that were booked on 12th = Cumulative orders lost till 14th-Cumulative orders lost till 13th =92-91=1<\/p>\n<p>Similarly, the number of orders lost till 17th can be found out.<\/p>\n<p>Number<br \/>\nof orders delivered on 13th are 11 out of which 4 are orders which were<br \/>\nbooked in 11th so, 7 must be the orders which were booked on 12th.<\/p>\n<p>Similarly, we can find the orders which took 1day and 2 days to get delivered till 17th.<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_qVJDwZ3.png\" data-image=\"image.png\" \/><\/figure>\n<p>Now, total number of orders booked on 12th will be 7+6+1=14.<\/p>\n<p>FRom the table we can determine that among options, number of orders booked on 13th are maximum.<\/p>\n<p>Average time can be calculated as follows<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_L2YvByO.png\" data-image=\"image.png\" \/><\/figure>\n<p>14 is the least<\/p>\n<p><strong>9)\u00a0Answer\u00a0(C)<\/strong><\/p>\n<p>There are 12 plots and each of them got even number of plots. So, possible cases are 4,4,2,2 or 6,2,2,2.<\/p>\n<p>From 4, A and B got more plots than D. So, the only possible case is A, B each got 4 and C,D each got 2.<\/p>\n<p>From 6, D has to get two adjacent plots and From 8, plots of C, D are nit adjacent to each other =&gt; D must have got plots in X3, X4.<\/p>\n<p>C already has two plots in X1, Z2. So, the corner plot Z4 should belong to B.<\/p>\n<p>From 7, B has a plot in each row and each column. So, X2 should belong to B.<\/p>\n<p>Now, out of the remaining Y2, Y3, Y4 and Z3 three plots belong to A and one belongs to B.<\/p>\n<p>Till now B hasn&#8217;t got any plot in Third column and 2nd row.<\/p>\n<p>So, Y3 belongs to B and Y2, Y4, Z3 belongs to A.<\/p>\n<p>Let the number of trees in Y4 be 4x from 3,\u00a0 number of trees in Y3, Y2 will be 2x, x respectively.<\/p>\n<p>The number of teak trees=7x+21<\/p>\n<p>.&#8217;. Number of mango trees=14x+42<\/p>\n<p>The table now looks like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_1wkh6HH.png\" data-image=\"image.png\" \/><\/figure>\n<p>Each plot had trees in non-zero multiples of 3 or 4 and none of the plots had the same number of trees and from 2, B\u00a0didn&#8217;t have the largest number of trees in a plot =&gt; x&lt;8.<\/p>\n<p>x can&#8217;t be 7,5,3,2,1 as for these cases at least one of x,2x,4x is neither multiple of 3 or 4.<\/p>\n<p>x can be 6 or 4.<\/p>\n<p>If x=6, number of Teak trees will be 63 and Mango trees will be 126 =&gt; Number of Pine trees= 205-126-63=16 but number of trees in Z3+Z4&gt;16 so, x$\\ne\\ $6.<\/p>\n<p>If x=4, Number of Teak trees=49 and Mango trees=98 =&gt; Number of Pine trees=58. Valid case.<\/p>\n<p>Number of trees with A= 30+5x=50.<\/p>\n<p>From 1, number of trees\u00a0 with C, D= 30, 56 respectively.<\/p>\n<p>So, number of trees in Z2= 18.<\/p>\n<p>.&#8217;. Number of trees with B= 205-50-30-56=69.<\/p>\n<p>From 2, largest number of trees in a plot is 32. They can be in the plot of either B or D. If they are from B, they have to be from X2 but in that case number of trees in Z1=1 which is neither a multiple of 3 or 4.<\/p>\n<p>So, highest number of trees in a plot are with D and it is 32 -=&gt; number of trees in X3, X4 are 32, 24 in any order.<\/p>\n<p>So, number of trees in X2= 98-56-12=30<\/p>\n<p>.&#8217;. Number of trees in Z1=69-30-28-8=3.<\/p>\n<p>The final table will look like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_82BZkg9.png\" data-image=\"image.png\" \/><\/figure>\n<p>.&#8217;. Number of Mango trees=98.<\/p>\n<p><strong>10)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>There are 12 plots and each of them got even number of plots. So, possible cases are 4,4,2,2 or 6,2,2,2.<\/p>\n<p>From 4, A and B got more plots than D. So, the only possible case is A, B each got 4 and C,D each got 2.<\/p>\n<p>From 6, D has to get two adjacent plots and From 8, plots of C, D are<br \/>\nnit adjacent to each other =&gt; D must have got plots in X3, X4.<\/p>\n<p>C already has two plots in X1, Z2. So, the corner plot Z4 should belong to B.<\/p>\n<p>From 7, B has a plot in each row and each column. So, X2 should belong to B.<\/p>\n<p>Now, out of the remaining Y2, Y3, Y4 and Z3 three plots belong to A and one belongs to B.<\/p>\n<p>Till now B hasn&#8217;t got any plot in Third column and 2nd row.<\/p>\n<p>So, Y3 belongs to B and Y2, Y4, Z3 belongs to A.<\/p>\n<p>Let the number of trees in Y4 be 4x from 3, number of trees in Y3, Y2 will be 2x, x respectively.<\/p>\n<p>The number of teak trees=7x+21<\/p>\n<p>.&#8217;. Number of mango trees=14x+42<\/p>\n<p>The table now looks like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_1wkh6HH.png\" data-image=\"image.png\" \/><\/figure>\n<p>Each plot had trees in non-zero multiples of 3 or 4 and none of the<br \/>\nplots had the same number of trees and from 2, B didn&#8217;t have the largest<br \/>\nnumber of trees in a plot =&gt; x&lt;8.<\/p>\n<p>x can&#8217;t be 7,5,3,2,1 as for these cases at least one of x,2x,4x is neither multiple of 3 or 4.<\/p>\n<p>x can be 6 or 4.<\/p>\n<p>If x=6, number of Teak trees will be 63 and Mango trees will be 126<br \/>\n=&gt; Number of Pine trees= 205-126-63=16 but number of trees in<br \/>\nZ3+Z4&gt;16 so, x$\\ne\\ $6.<\/p>\n<p>If x=4, Number of Teak trees=49 and Mango trees=98 =&gt; Number of Pine trees=58. Valid case.<\/p>\n<p>Number of trees with A= 30+5x=50.<\/p>\n<p>From 1, number of trees with C, D= 30, 56 respectively.<\/p>\n<p>So, number of trees in Z2= 18.<\/p>\n<p>.&#8217;. Number of trees with B= 205-50-30-56=69.<\/p>\n<p>From<br \/>\n2, largest number of trees in a plot is 32. They can be in the plot of<br \/>\neither B or D. If they are from B, they have to be from X2 but in that<br \/>\ncase number of trees in Z1=1 which is neither a multiple of 3 or 4.<\/p>\n<p>So, highest number of trees in a plot are with D and it is 32 -=&gt; number of trees in X3, X4 are 32, 24 in any order.<\/p>\n<p>So, number of trees in X2= 98-56-12=30<\/p>\n<p>.&#8217;. Number of trees in Z1=69-30-28-8=3.<\/p>\n<p>The final table will look like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_82BZkg9.png\" data-image=\"image.png\" \/><\/figure>\n<p>Sequence of trees received by Abha, Bina, Chitra and Dipti is 50,69,30,56.<\/p>\n<p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat\/previous-papers\" target=\"_blank\" class=\"btn btn-primary \">Download CAT Previous Solved Papers<\/a><\/p>\n<p class=\"text-center\"><a href=\"https:\/\/www.youtube.com\/channel\/UCjrG4n3cS6y45BfCJjp3boQ\" target=\"_blank\" class=\"btn btn-alone \">Free Live Classes &#8211; Cracku Youtube<\/a><\/p>\n<p>&nbsp;<\/p>\n<p><strong><br \/>\n11)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>There are 12 plots and each of them got even number of plots. So, possible cases are 4,4,2,2 or 6,2,2,2.<\/p>\n<p>From 4, A and B got more plots than D. So, the only possible case is A, B each got 4 and C,D each got 2.<\/p>\n<p>From 6, D has to get two adjacent plots and From 8, plots of C, D are<br \/>\nnit adjacent to each other =&gt; D must have got plots in X3, X4.<\/p>\n<p>C already has two plots in X1, Z2. So, the corner plot Z4 should belong to B.<\/p>\n<p>From 7, B has a plot in each row and each column. So, X2 should belong to B.<\/p>\n<p>Now, out of the remaining Y2, Y3, Y4 and Z3 three plots belong to A and one belongs to B.<\/p>\n<p>Till now B hasn&#8217;t got any plot in Third column and 2nd row.<\/p>\n<p>So, Y3 belongs to B and Y2, Y4, Z3 belongs to A.<\/p>\n<p>Let the number of trees in Y4 be 4x from 3, number of trees in Y3, Y2 will be 2x, x respectively.<\/p>\n<p>The number of teak trees=7x+21<\/p>\n<p>.&#8217;. Number of mango trees=14x+42<\/p>\n<p>The table now looks like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_1wkh6HH.png\" data-image=\"image.png\" \/><\/figure>\n<p>Each plot had trees in non-zero multiples of 3 or 4 and none of the<br \/>\nplots had the same number of trees and from 2, B didn&#8217;t have the largest<br \/>\nnumber of trees in a plot =&gt; x&lt;8.<\/p>\n<p>x can&#8217;t be 7,5,3,2,1 as for these cases at least one of x,2x,4x is neither multiple of 3 or 4.<\/p>\n<p>x can be 6 or 4.<\/p>\n<p>If x=6, number of Teak trees will be 63 and Mango trees will be 126<br \/>\n=&gt; Number of Pine trees= 205-126-63=16 but number of trees in<br \/>\nZ3+Z4&gt;16 so, x$\\ne\\ $6.<\/p>\n<p>If x=4, Number of Teak trees=49 and Mango trees=98 =&gt; Number of Pine trees=58. Valid case.<\/p>\n<p>Number of trees with A= 30+5x=50.<\/p>\n<p>From 1, number of trees with C, D= 30, 56 respectively.<\/p>\n<p>So, number of trees in Z2= 18.<\/p>\n<p>.&#8217;. Number of trees with B= 205-50-30-56=69.<\/p>\n<p>From 2, largest number of trees in a plot is 32. They can be in the<br \/>\nplot of either B or D. If they are from B, they have to be from X2 but<br \/>\nin that case number of trees in Z1=1 which is neither a multiple of 3 or<br \/>\n4.<\/p>\n<p>So, highest number of trees in a plot are with D and it is 32 -=&gt; number of trees in X3, X4 are 32, 24 in any order.<\/p>\n<p>So, number of trees in X2= 98-56-12=30<\/p>\n<p>.&#8217;. Number of trees in Z1=69-30-28-8=3.<\/p>\n<p>The final table will look like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_82BZkg9.png\" data-image=\"image.png\" \/><\/figure>\n<p>Number of PIne trees received by Chitra = 18.<\/p>\n<p><strong><p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat-previous-papers\" target=\"_blank\" class=\"btn btn-danger \">Download CAT Previous Papers PDF<\/a><\/p><br \/>\n12)\u00a0Answer\u00a0(B)<\/strong><\/p>\n<p>There are 12 plots and each of them got even number of plots. So, possible cases are 4,4,2,2 or 6,2,2,2.<\/p>\n<p>From 4, A and B got more plots than D. So, the only possible case is A, B each got 4 and C,D each got 2.<\/p>\n<p>From 6, D has to get two adjacent plots and From 8, plots of C, D are<br \/>\nnit adjacent to each other =&gt; D must have got plots in X3, X4.<\/p>\n<p>C already has two plots in X1, Z2. So, the corner plot Z4 should belong to B.<\/p>\n<p>From 7, B has a plot in each row and each column. So, X2 should belong to B.<\/p>\n<p>Now, out of the remaining Y2, Y3, Y4 and Z3 three plots belong to A and one belongs to B.<\/p>\n<p>Till now B hasn&#8217;t got any plot in Third column and 2nd row.<\/p>\n<p>So, Y3 belongs to B and Y2, Y4, Z3 belongs to A.<\/p>\n<p>Let the number of trees in Y4 be 4x from 3, number of trees in Y3, Y2 will be 2x, x respectively.<\/p>\n<p>The number of teak trees=7x+21<\/p>\n<p>.&#8217;. Number of mango trees=14x+42<\/p>\n<p>The table now looks like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_1wkh6HH.png\" data-image=\"image.png\" \/><\/figure>\n<p>Each plot had trees in non-zero multiples of 3 or 4 and none of the<br \/>\nplots had the same number of trees and from 2, B didn&#8217;t have the largest<br \/>\nnumber of trees in a plot =&gt; x&lt;8.<\/p>\n<p>x can&#8217;t be 7,5,3,2,1 as for these cases at least one of x,2x,4x is neither multiple of 3 or 4.<\/p>\n<p>x can be 6 or 4.<\/p>\n<p>If x=6, number of Teak trees will be 63 and Mango trees will be 126<br \/>\n=&gt; Number of Pine trees= 205-126-63=16 but number of trees in<br \/>\nZ3+Z4&gt;16 so, x$\\ne\\ $6.<\/p>\n<p>If x=4, Number of Teak trees=49 and Mango trees=98 =&gt; Number of Pine trees=58. Valid case.<\/p>\n<p>Number of trees with A= 30+5x=50.<\/p>\n<p>From 1, number of trees with C, D= 30, 56 respectively.<\/p>\n<p>So, number of trees in Z2= 18.<\/p>\n<p>.&#8217;. Number of trees with B= 205-50-30-56=69.<\/p>\n<p>From 2, largest number of trees in a plot is 32. They can be in the<br \/>\nplot of either B or D. If they are from B, they have to be from X2 but<br \/>\nin that case number of trees in Z1=1 which is neither a multiple of 3 or<br \/>\n4.<\/p>\n<p>So, highest number of trees in a plot are with D and it is 32 -=&gt; number of trees in X3, X4 are 32, 24 in any order.<\/p>\n<p>So, number of trees in X2= 98-56-12=30<\/p>\n<p>.&#8217;. Number of trees in Z1=69-30-28-8=3.<\/p>\n<p>The final table will look like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_82BZkg9.png\" data-image=\"image.png\" \/><\/figure>\n<p>.&#8217;. Number of trees per plot is least for Benna=3.<\/p>\n<p><strong><p class=\"text-center\"><a href=\"https:\/\/cracku.in\/free-cat-video-lectures\" target=\"_blank\" class=\"btn btn-primary \">Take Free CAT Video Lectures<\/a><\/p><br \/>\n13)\u00a0Answer\u00a0(B)<\/strong><\/p>\n<p>There are 12 plots and each of them got even number of plots. So, possible cases are 4,4,2,2 or 6,2,2,2.<\/p>\n<p>From 4, A and B got more plots than D. So, the only possible case is A, B each got 4 and C,D each got 2.<\/p>\n<p>From 6, D has to get two adjacent plots and From 8, plots of C, D are<br \/>\nnit adjacent to each other =&gt; D must have got plots in X3, X4.<\/p>\n<p>C already has two plots in X1, Z2. So, the corner plot Z4 should belong to B.<\/p>\n<p>From 7, B has a plot in each row and each column. So, X2 should belong to B.<\/p>\n<p>Now, out of the remaining Y2, Y3, Y4 and Z3 three plots belong to A and one belongs to B.<\/p>\n<p>Till now B hasn&#8217;t got any plot in Third column and 2nd row.<\/p>\n<p>So, Y3 belongs to B and Y2, Y4, Z3 belongs to A.<\/p>\n<p>Let the number of trees in Y4 be 4x from 3, number of trees in Y3, Y2 will be 2x, x respectively.<\/p>\n<p>The number of teak trees=7x+21<\/p>\n<p>.&#8217;. Number of mango trees=14x+42<\/p>\n<p>The table now looks like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_1wkh6HH.png\" data-image=\"image.png\" \/><\/figure>\n<p>Each plot had trees in non-zero multiples of 3 or 4 and none of the<br \/>\nplots had the same number of trees and from 2, B didn&#8217;t have the largest<br \/>\nnumber of trees in a plot =&gt; x&lt;8.<\/p>\n<p>x can&#8217;t be 7,5,3,2,1 as for these cases at least one of x,2x,4x is neither multiple of 3 or 4.<\/p>\n<p>x can be 6 or 4.<\/p>\n<p>If x=6, number of Teak trees will be 63 and Mango trees will be 126<br \/>\n=&gt; Number of Pine trees= 205-126-63=16 but number of trees in<br \/>\nZ3+Z4&gt;16 so, x$\\ne\\ $6.<\/p>\n<p>If x=4, Number of Teak trees=49 and Mango trees=98 =&gt; Number of Pine trees=58. Valid case.<\/p>\n<p>Number of trees with A= 30+5x=50.<\/p>\n<p>From 1, number of trees with C, D= 30, 56 respectively.<\/p>\n<p>So, number of trees in Z2= 18.<\/p>\n<p>.&#8217;. Number of trees with B= 205-50-30-56=69.<\/p>\n<p>From 2, largest number of trees in a plot is 32. They can be in the<br \/>\nplot of either B or D. If they are from B, they have to be from X2 but<br \/>\nin that case number of trees in Z1=1 which is neither a multiple of 3 or<br \/>\n4.<\/p>\n<p>So, highest number of trees in a plot are with D and it is 32 -=&gt; number of trees in X3, X4 are 32, 24 in any order.<\/p>\n<p>So, number of trees in X2= 98-56-12=30<\/p>\n<p>.&#8217;. Number of trees in Z1=69-30-28-8=3.<\/p>\n<p>The final table will look like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_82BZkg9.png\" data-image=\"image.png\" \/><\/figure>\n<p>Bina got 28 pine trees, Option B is correct answer.<\/p>\n<p><strong><b><p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat-daily-target\/\" target=\"_blank\" class=\"btn btn-info \">Take Free CAT Daily Tests (With Video Solutions)<\/a><\/p><\/b><br \/>\n14)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>There are 12 plots and each of them got even number of plots. So, possible cases are 4,4,2,2 or 6,2,2,2.<\/p>\n<p>From 4, A and B got more plots than D. So, the only possible case is A, B each got 4 and C,D each got 2.<\/p>\n<p>From 6, D has to get two adjacent plots and From 8, plots of C, D are<br \/>\nnit adjacent to each other =&gt; D must have got plots in X3, X4.<\/p>\n<p>C already has two plots in X1, Z2. So, the corner plot Z4 should belong to B.<\/p>\n<p>From 7, B has a plot in each row and each column. So, X2 should belong to B.<\/p>\n<p>Now, out of the remaining Y2, Y3, Y4 and Z3 three plots belong to A and one belongs to B.<\/p>\n<p>Till now B hasn&#8217;t got any plot in Third column and 2nd row.<\/p>\n<p>So, Y3 belongs to B and Y2, Y4, Z3 belongs to A.<\/p>\n<p>Let the number of trees in Y4 be 4x from 3, number of trees in Y3, Y2 will be 2x, x respectively.<\/p>\n<p>The number of teak trees=7x+21<\/p>\n<p>.&#8217;. Number of mango trees=14x+42<\/p>\n<p>The table now looks like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_1wkh6HH.png\" data-image=\"image.png\" \/><\/figure>\n<p>Each plot had trees in non-zero multiples of 3 or 4 and none of the<br \/>\nplots had the same number of trees and from 2, B didn&#8217;t have the largest<br \/>\nnumber of trees in a plot =&gt; x&lt;8.<\/p>\n<p>x can&#8217;t be 7,5,3,2,1 as for these cases at least one of x,2x,4x is neither multiple of 3 or 4.<\/p>\n<p>x can be 6 or 4.<\/p>\n<p>If x=6, number of Teak trees will be 63 and Mango trees will be 126<br \/>\n=&gt; Number of Pine trees= 205-126-63=16 but number of trees in<br \/>\nZ3+Z4&gt;16 so, x$\\ne\\ $6.<\/p>\n<p>If x=4, Number of Teak trees=49 and Mango trees=98 =&gt; Number of Pine trees=58. Valid case.<\/p>\n<p>Number of trees with A= 30+5x=50.<\/p>\n<p>From 1, number of trees with C, D= 30, 56 respectively.<\/p>\n<p>So, number of trees in Z2= 18.<\/p>\n<p>.&#8217;. Number of trees with B= 205-50-30-56=69.<\/p>\n<p>From 2, largest number of trees in a plot is 32. They can be in the<br \/>\nplot of either B or D. If they are from B, they have to be from X2 but<br \/>\nin that case number of trees in Z1=1 which is neither a multiple of 3 or<br \/>\n4.<\/p>\n<p>So, highest number of trees in a plot are with D and it is 32 -=&gt; number of trees in X3, X4 are 32, 24 in any order.<\/p>\n<p>So, number of trees in X2= 98-56-12=30<\/p>\n<p>.&#8217;. Number of trees in Z1=69-30-28-8=3.<\/p>\n<p>The final table will look like:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_82BZkg9.png\" data-image=\"image.png\" \/><\/figure>\n<p>Column 1,2,3,4 have 36, 52, 49, 68 trees respectively.<\/p>\n<p>Hence A is correct answer.<\/p>\n<p><strong>15) Answer (A)<\/strong><\/p>\n<p>Let &#8216;H&#8217; represents Hi and &#8216;L&#8217; represents Lo.<\/p>\n<p>Given if they bid<\/p>\n<p>Case 1: HHHH then all players gets -1 points.<\/p>\n<p>Case 2: HHHL =&gt; H gets +1 and L gets -3.<\/p>\n<p>Case 3: HHLL =&gt; H gets +2 and L gets -2.<\/p>\n<p>Case 4: HLLL =&gt; H gets +3 and L gets -1.<\/p>\n<p>Case 5: LLLL =&gt; every player gets +1.<\/p>\n<p>From the given information we can draw the following table:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_VfxH70E.png\" data-image=\"image.png\" \/><\/figure>\n<p>**T1 is the cumulative of points till Round 3 and T2 is sum of points till round 6.<\/p>\n<p>**Arun, Bankim, Charu, and Dipak are represented by A, B, C, D respectively.<\/p>\n<p>From point 3, D1&gt;D2&gt;D3<\/p>\n<p>D scored 2 points till round R3 and D1&gt;D3&gt;D2 the possible scenarios are :<\/p>\n<p>Case D1: 3,2,-3<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1,2\/-2, 1 in any<br \/>\npossible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>Case D2: 2,1,-1<\/p>\n<p>In this case the points of A in R1, R3, R2 will be 2\/-2, 1\/-3, -1\/3<br \/>\nso, if the points in R1, R3, R2 are 2,1,3 the case is valid and no other<br \/>\ncases are possible.<\/p>\n<p>Case D3: 3,1,-2<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1, 1\/-3\/1, 2\/-2<br \/>\nin any possible combination the sum will not be 6. So, this case is<br \/>\ninvalid.<\/p>\n<p>.&#8217;. Points of A,D in (R1,R2,R3) are (2,3,1) and (2,-1,1) respectively.<\/p>\n<p>Since A got +3 in R2, he is only the one to bid h in R2 and points of B and C in round 2 are -1,-1 i.e they bid L, L.<\/p>\n<p>Since A and D got 2 points each in R1, C and B must have got -2, -2 i.e they bid L, L.<\/p>\n<p>Since A and D got 1 point in R3, C and B must also have got 1 in R3 i.e they bid L, L.<\/p>\n<p>With this data, the table now looks like:<\/p>\n<figure style=\"max-width: 911px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_RRhNKzj.png\" width=\"911\" height=\"265\" data-image=\"image.png\" \/><\/figure>\n<p>No information is given about the individual scores in R4, R5, R6.<\/p>\n<p>Given In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p>Let R.x, R.y, R.z represent R4, R5, R6 in any order.<\/p>\n<p>Let A bid H in R.x=&gt; B,C,D bid L.<\/p>\n<p>The table now looks like:<\/p>\n<figure style=\"max-width: 816px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_FpfyV3F.png\" width=\"816\" height=\"233\" data-image=\"image.png\" \/><\/figure>\n<p>For A, R.x+R.y+R.z=1 =&gt; R.y+R.z=-2<\/p>\n<p>For B, R.x+R.y+R.z=1 =&gt; R.y+R.z=2<\/p>\n<p>For C, R.x+R.y+R.z=-3 =&gt; R.y+R.z=-2<\/p>\n<p>For D, R.x+R.y+R.z=-3.=&gt; R.y+R.z=-2<\/p>\n<p>(R.y, R.z) for A can be (-3,1) or (-1,-1)<\/p>\n<p>Case A1:<\/p>\n<p>If for A, (R.y, R.z)=(-3,1)<\/p>\n<p>Since for both C,D: R.y+R.z=-2<\/p>\n<p>We can&#8217;t get any combination such that the total points of B,C,D are obtained.<\/p>\n<p>Case A2:<\/p>\n<p>If for A, (R.y, R.z)=(-1,-1).the (R.y, R.z) of B,C,D can be (3,-1), (-1,-1), (-1,-1) and they must have bid (H,H), (L,H), (L,H) respectively while A must have bid (L, H)<\/p>\n<p>Hence this case is valid.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 940px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_9BVlhrS.png\" width=\"940\" height=\"274\" data-image=\"image.png\" \/><\/figure>\n<p>The bids by Arun, Bankim, Charu and Dipak, respectively in the first round are HLLH.<\/p>\n<p>Hence Option A is correct.<\/p>\n<p><b><strong><p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat\/previous-papers\" target=\"_blank\" class=\"btn btn-primary \">Download CAT Previous Solved Papers<\/a><\/p><\/strong><br \/>\n16)\u00a0Answer:\u00a04<\/b><\/p>\n<p>Let &#8216;H&#8217; represents Hi and &#8216;L&#8217; represents Lo.<\/p>\n<p>Given if they bid<\/p>\n<p>Case 1: HHHH then all players gets -1 points.<\/p>\n<p>Case 2: HHHL =&gt; H gets +1 and L gets -3.<\/p>\n<p>Case 3: HHLL =&gt; H gets +2 and L gets -2.<\/p>\n<p>Case 4: HLLL =&gt; H gets +3 and L gets -1.<\/p>\n<p>Case 5: LLLL =&gt; every player gets +1.<\/p>\n<p>From the given information we can draw the following table:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_VfxH70E.png\" data-image=\"image.png\" \/><\/figure>\n<p>**T1 is the cumulative of points till Round 3 and T2 is sum of points till round 6.<\/p>\n<p>**Arun, Bankim, Charu, and Dipak are represented by A, B, C, D respectively.<\/p>\n<p>From point 3, D1&gt;D2&gt;D3<\/p>\n<p>D scored 2 points till round R3 and D1&gt;D3&gt;D2 the possible scenarios are :<\/p>\n<p>Case D1: 3,2,-3<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1,2\/-2, 1 in any<br \/>\npossible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>Case D2: 2,1,-1<\/p>\n<p>In this case the points of A in R1, R3, R2 will be 2\/-2, 1\/-3, -1\/3<br \/>\nso, if the points in R1, R3, R2 are 2,1,3 the case is valid and no other<br \/>\ncases are possible.<\/p>\n<p>Case D3: 3,1,-2<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1, 1\/-3\/1, 2\/-2<br \/>\nin any possible combination the sum will not be 6. So, this case is<br \/>\ninvalid.<\/p>\n<p>.&#8217;. Points of A,D in (R1,R2,R3) are (2,3,1) and (2,-1,1) respectively.<\/p>\n<p>Since A got +3 in R2, he is only the one to bid h in R2 and points of B and C in round 2 are -1,-1 i.e they bid L, L.<\/p>\n<p>Since A and D got 2 points each in R1, C and B must have got -2, -2 i.e they bid L, L.<\/p>\n<p>Since A and D got 1 point in R3, C and B must also have got 1 in R3 i.e they bid L, L.<\/p>\n<p>With this data, the table now looks like:<\/p>\n<figure style=\"max-width: 911px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_RRhNKzj.png\" width=\"911\" height=\"265\" data-image=\"image.png\" \/><\/figure>\n<p>No information is given about the individual scores in R4, R5, R6.<\/p>\n<p>Given In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p>Let R.x, R.y, R.z represent R4, R5, R6 in any order.<\/p>\n<p>Let A bid H in R.x=&gt; B,C,D bid L.<\/p>\n<p>The table now looks like:<\/p>\n<figure style=\"max-width: 816px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_FpfyV3F.png\" width=\"816\" height=\"233\" data-image=\"image.png\" \/><\/figure>\n<p>For A, R.x+R.y+R.z=1 =&gt; R.y+R.z=-2<\/p>\n<p>For B, R.x+R.y+R.z=1 =&gt; R.y+R.z=2<\/p>\n<p>For C, R.x+R.y+R.z=-3 =&gt; R.y+R.z=-2<\/p>\n<p>For D, R.x+R.y+R.z=-3.=&gt; R.y+R.z=-2<\/p>\n<p>(R.y, R.z) for A can be (-3,1) or (-1,-1)<\/p>\n<p>Case A1:<\/p>\n<p>If for A, (R.y, R.z)=(-3,1)<\/p>\n<p>Since for both C,D: R.y+R.z=-2<\/p>\n<p>We can&#8217;t get any combination such that the total points of B,C,D are obtained.<\/p>\n<p>Case A2:<\/p>\n<p>If for A, (R.y, R.z)=(-1,-1).the (R.y, R.z) of B,C,D can be (3,-1),<br \/>\n(-1,-1), (-1,-1) and they must have bid (H,H), (L,H), (L,H) respectively<br \/>\nwhile A must have bid (L, H)<\/p>\n<p>Hence this case is valid.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 940px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_9BVlhrS.png\" width=\"940\" height=\"274\" data-image=\"image.png\" \/><\/figure>\n<p>Arun bid high in R1,R2, R.x, R.z hence, 4 is correct answer.<\/p>\n<p><b><strong><p class=\"text-center\"><a href=\"https:\/\/www.youtube.com\/channel\/UCjrG4n3cS6y45BfCJjp3boQ\" target=\"_blank\" class=\"btn btn-alone \">Free Live Classes &#8211; Cracku Youtube<\/a><\/p><\/strong><br \/>\n17)\u00a0Answer:\u00a04<\/b><\/p>\n<p>Let &#8216;H&#8217; represents Hi and &#8216;L&#8217; represents Lo.<\/p>\n<p>Given if they bid<\/p>\n<p>Case 1: HHHH then all players gets -1 points.<\/p>\n<p>Case 2: HHHL =&gt; H gets +1 and L gets -3.<\/p>\n<p>Case 3: HHLL =&gt; H gets +2 and L gets -2.<\/p>\n<p>Case 4: HLLL =&gt; H gets +3 and\u00a0 L gets -1.<\/p>\n<p>Case 5: LLLL =&gt; every player gets +1.<\/p>\n<p>From the given information we can draw the following table:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_VfxH70E.png\" data-image=\"image.png\" \/><\/figure>\n<p>**T1 is the cumulative of points till Round 3 and T2 is sum of points till round 6.<\/p>\n<p>**Arun, Bankim, Charu, and Dipak are represented by A, B, C, D respectively.<\/p>\n<p>From point 3, D1&gt;D2&gt;D3<\/p>\n<p>D scored 2 points till round R3 and D1&gt;D3&gt;D2 the possible scenarios are :<\/p>\n<p>Case D1: 3,2,-3<\/p>\n<p>In this case the points of A in\u00a0 R1, R3, R2 will be -1,2\/-2, 1 in any possible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>Case D2: 2,1,-1<\/p>\n<p>In this case the points of A in R1, R3, R2 will be 2\/-2, 1\/-3, -1\/3 so, if the points in R1, R3, R2 are 2,1,3 the case is valid and no other cases are possible.<\/p>\n<p>Case D3: 3,1,-2<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1, 1\/-3\/1, 2\/-2 in any possible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>.&#8217;. Points of A,D in (R1,R2,R3) are (2,3,1) and (2,-1,1) respectively.<\/p>\n<p>Since A got +3 in R2, he is only the one to bid h in R2 and points of B and C in round 2 are -1,-1 i.e they bid L, L.<\/p>\n<p>Since A and D got 2 points each in R1, C and B must have got -2, -2 i.e they bid L, L.<\/p>\n<p>Since A and D got 1 point in R3, C and B must also have got 1 in R3 i.e they bid L, L.<\/p>\n<p>With this data, the table now looks like:<\/p>\n<figure style=\"max-width: 911px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_RRhNKzj.png\" width=\"911\" height=\"265\" data-image=\"image.png\" \/><\/figure>\n<p>No information is given about the individual scores in R4, R5, R6.<\/p>\n<p>Given\u00a0In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p>Let R.x, R.y, R.z represent R4, R5, R6 in any order.<\/p>\n<p>Let A bid H in R.x=&gt; B,C,D bid L.<\/p>\n<p>The table now looks like:<\/p>\n<figure style=\"max-width: 816px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_FpfyV3F.png\" width=\"816\" height=\"233\" data-image=\"image.png\" \/><\/figure>\n<p>For A, R.x+R.y+R.z=1 =&gt; R.y+R.z=-2<\/p>\n<p>For B, R.x+R.y+R.z=1 =&gt;\u00a0R.y+R.z=2<\/p>\n<p>For C, R.x+R.y+R.z=-3 =&gt; R.y+R.z=-2<\/p>\n<p>For D, R.x+R.y+R.z=-3.=&gt; R.y+R.z=-2<\/p>\n<p>(R.y, R.z) for A can be (-3,1) or (-1,-1)<\/p>\n<p>Case A1:<\/p>\n<p>If for A, (R.y, R.z)=(-3,1)<\/p>\n<p>Since for both C,D: R.y+R.z=-2<\/p>\n<p>We can&#8217;t get any combination such that the total points of B,C,D are obtained.<\/p>\n<p>Case A2:<\/p>\n<p>If for A, (R.y, R.z)=(-1,-1).the (R.y, R.z) of B,C,D can be (3,-1), (-1,-1), (-1,-1) and they must have bid (H,H), (L,H), (L,H) respectively while A must have bid (L, H)<\/p>\n<p>Hence this case is valid.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 940px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_9BVlhrS.png\" width=\"940\" height=\"274\" data-image=\"image.png\" \/><\/figure>\n<p>Bikram bid Lo in R1,R2,R3,R.x. Hence 4 is correct answer.<\/p>\n<p><b>18) Answer: 2<\/b><\/p>\n<p>Let &#8216;H&#8217; represents Hi and &#8216;L&#8217; represents Lo.<\/p>\n<p>Given if they bid<\/p>\n<p>Case 1: HHHH then all players gets -1 points.<\/p>\n<p>Case 2: HHHL =&gt; H gets +1 and L gets -3.<\/p>\n<p>Case 3: HHLL =&gt; H gets +2 and L gets -2.<\/p>\n<p>Case 4: HLLL =&gt; H gets +3 and L gets -1.<\/p>\n<p>Case 5: LLLL =&gt; every player gets +1.<\/p>\n<p>From the given information we can draw the following table:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_VfxH70E.png\" data-image=\"image.png\" \/><\/figure>\n<p>**T1 is the cumulative of points till Round 3 and T2 is sum of points till round 6.<\/p>\n<p>**Arun, Bankim, Charu, and Dipak are represented by A, B, C, D respectively.<\/p>\n<p>From point 3, D1&gt;D2&gt;D3<\/p>\n<p>D scored 2 points till round R3 and D1&gt;D3&gt;D2 the possible scenarios are :<\/p>\n<p>Case D1: 3,2,-3<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1,2\/-2, 1 in any<br \/>\npossible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>Case D2: 2,1,-1<\/p>\n<p>In this case the points of A in R1, R3, R2 will be 2\/-2, 1\/-3, -1\/3<br \/>\nso, if the points in R1, R3, R2 are 2,1,3 the case is valid and no other<br \/>\ncases are possible.<\/p>\n<p>Case D3: 3,1,-2<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1, 1\/-3\/1, 2\/-2<br \/>\nin any possible combination the sum will not be 6. So, this case is<br \/>\ninvalid.<\/p>\n<p>.&#8217;. Points of A,D in (R1,R2,R3) are (2,3,1) and (2,-1,1) respectively.<\/p>\n<p>Since A got +3 in R2, he is only the one to bid h in R2 and points of B and C in round 2 are -1,-1 i.e they bid L, L.<\/p>\n<p>Since A and D got 2 points each in R1, C and B must have got -2, -2 i.e they bid L, L.<\/p>\n<p>Since A and D got 1 point in R3, C and B must also have got 1 in R3 i.e they bid L, L.<\/p>\n<p>With this data, the table now looks like:<\/p>\n<figure style=\"max-width: 911px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_RRhNKzj.png\" width=\"911\" height=\"265\" data-image=\"image.png\" \/><\/figure>\n<p>No information is given about the individual scores in R4, R5, R6.<\/p>\n<p>Given In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p>Let R.x, R.y, R.z represent R4, R5, R6 in any order.<\/p>\n<p>Let A bid H in R.x=&gt; B,C,D bid L.<\/p>\n<p>The table now looks like:<\/p>\n<figure style=\"max-width: 816px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_FpfyV3F.png\" width=\"816\" height=\"233\" data-image=\"image.png\" \/><\/figure>\n<p>For A, R.x+R.y+R.z=1 =&gt; R.y+R.z=-2<\/p>\n<p>For B, R.x+R.y+R.z=1 =&gt; R.y+R.z=2<\/p>\n<p>For C, R.x+R.y+R.z=-3 =&gt; R.y+R.z=-2<\/p>\n<p>For D, R.x+R.y+R.z=-3.=&gt; R.y+R.z=-2<\/p>\n<p>(R.y, R.z) for A can be (-3,1) or (-1,-1)<\/p>\n<p>Case A1:<\/p>\n<p>If for A, (R.y, R.z)=(-3,1)<\/p>\n<p>Since for both C,D: R.y+R.z=-2<\/p>\n<p>We can&#8217;t get any combination such that the total points of B,C,D are obtained.<\/p>\n<p>Case A2:<\/p>\n<p>If for A, (R.y, R.z)=(-1,-1).the (R.y, R.z) of B,C,D can be (3,-1),<br \/>\n(-1,-1), (-1,-1) and they must have bid (H,H), (L,H), (L,H) respectively<br \/>\nwhile A must have bid (L, H)<\/p>\n<p>Hence this case is valid.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 940px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_9BVlhrS.png\" width=\"940\" height=\"274\" data-image=\"image.png\" \/><\/figure>\n<p>All the players made identical bids in R3 and R.z<\/p>\n<p><b>19)\u00a0Answer:\u00a01<\/b><\/p>\n<p>Let &#8216;H&#8217; represents Hi and &#8216;L&#8217; represents Lo.<\/p>\n<p>Given if they bid<\/p>\n<p>Case 1: HHHH then all players gets -1 points.<\/p>\n<p>Case 2: HHHL =&gt; H gets +1 and L gets -3.<\/p>\n<p>Case 3: HHLL =&gt; H gets +2 and L gets -2.<\/p>\n<p>Case 4: HLLL =&gt; H gets +3 and L gets -1.<\/p>\n<p>Case 5: LLLL =&gt; every player gets +1.<\/p>\n<p>From the given information we can draw the following table:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_VfxH70E.png\" data-image=\"image.png\" \/><\/figure>\n<p>**T1 is the cumulative of points till Round 3 and T2 is sum of points till round 6.<\/p>\n<p>**Arun, Bankim, Charu, and Dipak are represented by A, B, C, D respectively.<\/p>\n<p>From point 3, D1&gt;D2&gt;D3<\/p>\n<p>D scored 2 points till round R3 and D1&gt;D3&gt;D2 the possible scenarios are :<\/p>\n<p>Case D1: 3,2,-3<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1,2\/-2, 1 in any<br \/>\npossible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>Case D2: 2,1,-1<\/p>\n<p>In this case the points of A in R1, R3, R2 will be 2\/-2, 1\/-3, -1\/3<br \/>\nso, if the points in R1, R3, R2 are 2,1,3 the case is valid and no other<br \/>\ncases are possible.<\/p>\n<p>Case D3: 3,1,-2<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1, 1\/-3\/1, 2\/-2<br \/>\nin any possible combination the sum will not be 6. So, this case is<br \/>\ninvalid.<\/p>\n<p>.&#8217;. Points of A,D in (R1,R2,R3) are (2,3,1) and (2,-1,1) respectively.<\/p>\n<p>Since A got +3 in R2, he is only the one to bid h in R2 and points of B and C in round 2 are -1,-1 i.e they bid L, L.<\/p>\n<p>Since A and D got 2 points each in R1, C and B must have got -2, -2 i.e they bid L, L.<\/p>\n<p>Since A and D got 1 point in R3, C and B must also have got 1 in R3 i.e they bid L, L.<\/p>\n<p>With this data, the table now looks like:<\/p>\n<figure style=\"max-width: 911px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_RRhNKzj.png\" width=\"911\" height=\"265\" data-image=\"image.png\" \/><\/figure>\n<p>No information is given about the individual scores in R4, R5, R6.<\/p>\n<p>Given In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p>Let R.x, R.y, R.z represent R4, R5, R6 in any order.<\/p>\n<p>Let A bid H in R.x=&gt; B,C,D bid L.<\/p>\n<p>The table now looks like:<\/p>\n<figure style=\"max-width: 816px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_FpfyV3F.png\" width=\"816\" height=\"233\" data-image=\"image.png\" \/><\/figure>\n<p>For A, R.x+R.y+R.z=1 =&gt; R.y+R.z=-2<\/p>\n<p>For B, R.x+R.y+R.z=1 =&gt; R.y+R.z=2<\/p>\n<p>For C, R.x+R.y+R.z=-3 =&gt; R.y+R.z=-2<\/p>\n<p>For D, R.x+R.y+R.z=-3.=&gt; R.y+R.z=-2<\/p>\n<p>(R.y, R.z) for A can be (-3,1) or (-1,-1)<\/p>\n<p>Case A1:<\/p>\n<p>If for A, (R.y, R.z)=(-3,1)<\/p>\n<p>Since for both C,D: R.y+R.z=-2<\/p>\n<p>We can&#8217;t get any combination such that the total points of B,C,D are obtained.<\/p>\n<p>Case A2:<\/p>\n<p>If for A, (R.y, R.z)=(-1,-1).the (R.y, R.z) of B,C,D can be (3,-1),<br \/>\n(-1,-1), (-1,-1) and they must have bid (H,H), (L,H), (L,H) respectively<br \/>\nwhile A must have bid (L, H)<\/p>\n<p>Hence this case is valid.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 940px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_9BVlhrS.png\" width=\"940\" height=\"274\" data-image=\"image.png\" \/><\/figure>\n<p>Deepak got exactly one point in only R3.<\/p>\n<p>Hence 1 is correct answer.<\/p>\n<p><strong><p class=\"text-center\"><a href=\"https:\/\/cracku.in\/cat\/previous-papers\" target=\"_blank\" class=\"btn btn-primary \">Download CAT Previous Solved Papers<\/a><\/p><br \/>\n20)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>Let &#8216;H&#8217; represents Hi and &#8216;L&#8217; represents Lo.<\/p>\n<p>Given if they bid<\/p>\n<p>Case 1: HHHH then all players gets -1 points.<\/p>\n<p>Case 2: HHHL =&gt; H gets +1 and L gets -3.<\/p>\n<p>Case 3: HHLL =&gt; H gets +2 and L gets -2.<\/p>\n<p>Case 4: HLLL =&gt; H gets +3 and L gets -1.<\/p>\n<p>Case 5: LLLL =&gt; every player gets +1.<\/p>\n<p>From the given information we can draw the following table:<\/p>\n<figure><img decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_VfxH70E.png\" data-image=\"image.png\" \/><\/figure>\n<p>**T1 is the cumulative of points till Round 3 and T2 is sum of points till round 6.<\/p>\n<p>**Arun, Bankim, Charu, and Dipak are represented by A, B, C, D respectively.<\/p>\n<p>From point 3, D1&gt;D2&gt;D3<\/p>\n<p>D scored 2 points till round R3 and D1&gt;D3&gt;D2 the possible scenarios are :<\/p>\n<p>Case D1: 3,2,-3<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1,2\/-2, 1 in any<br \/>\npossible combination the sum will not be 6. So, this case is invalid.<\/p>\n<p>Case D2: 2,1,-1<\/p>\n<p>In this case the points of A in R1, R3, R2 will be 2\/-2, 1\/-3, -1\/3<br \/>\nso, if the points in R1, R3, R2 are 2,1,3 the case is valid and no other<br \/>\ncases are possible.<\/p>\n<p>Case D3: 3,1,-2<\/p>\n<p>In this case the points of A in R1, R3, R2 will be -1, 1\/-3\/1, 2\/-2<br \/>\nin any possible combination the sum will not be 6. So, this case is<br \/>\ninvalid.<\/p>\n<p>.&#8217;. Points of A,D in (R1,R2,R3) are (2,3,1) and (2,-1,1) respectively.<\/p>\n<p>Since A got +3 in R2, he is only the one to bid h in R2 and points of B and C in round 2 are -1,-1 i.e they bid L, L.<\/p>\n<p>Since A and D got 2 points each in R1, C and B must have got -2, -2 i.e they bid L, L.<\/p>\n<p>Since A and D got 1 point in R3, C and B must also have got 1 in R3 i.e they bid L, L.<\/p>\n<p>With this data, the table now looks like:<\/p>\n<figure style=\"max-width: 911px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_RRhNKzj.png\" width=\"911\" height=\"265\" data-image=\"image.png\" \/><\/figure>\n<p>No information is given about the individual scores in R4, R5, R6.<\/p>\n<p>Given In exactly two out of the six rounds, Arun was the only player who bid Hi.<\/p>\n<p>Let R.x, R.y, R.z represent R4, R5, R6 in any order.<\/p>\n<p>Let A bid H in R.x=&gt; B,C,D bid L.<\/p>\n<p>The table now looks like:<\/p>\n<figure style=\"max-width: 816px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_FpfyV3F.png\" width=\"816\" height=\"233\" data-image=\"image.png\" \/><\/figure>\n<p>For A, R.x+R.y+R.z=1 =&gt; R.y+R.z=-2<\/p>\n<p>For B, R.x+R.y+R.z=1 =&gt; R.y+R.z=2<\/p>\n<p>For C, R.x+R.y+R.z=-3 =&gt; R.y+R.z=-2<\/p>\n<p>For D, R.x+R.y+R.z=-3.=&gt; R.y+R.z=-2<\/p>\n<p>(R.y, R.z) for A can be (-3,1) or (-1,-1)<\/p>\n<p>Case A1:<\/p>\n<p>If for A, (R.y, R.z)=(-3,1)<\/p>\n<p>Since for both C,D: R.y+R.z=-2<\/p>\n<p>We can&#8217;t get any combination such that the total points of B,C,D are obtained.<\/p>\n<p>Case A2:<\/p>\n<p>If for A, (R.y, R.z)=(-1,-1).the (R.y, R.z) of B,C,D can be (3,-1),<br \/>\n(-1,-1), (-1,-1) and they must have bid (H,H), (L,H), (L,H) respectively<br \/>\nwhile A must have bid (L, H)<\/p>\n<p>Hence this case is valid.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 940px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_9BVlhrS.png\" width=\"940\" height=\"274\" data-image=\"image.png\" \/><\/figure>\n<p>R2 is correct answer.<\/p>\n<p><strong>21)\u00a0Answer\u00a0(C)<\/strong><\/p>\n<p>Let the\u00a0number of schools with exactly three of the facilities was the same irrespective of which three were considered be x.<\/p>\n<p>Number of schools with none of the facilities be &#8216;n&#8217; from 1, n=80.<\/p>\n<p>Number of schools with only F1 and F2 be &#8216;b&#8217;<\/p>\n<p>Number of schools with only F1 and F3 be &#8216;c&#8217;<\/p>\n<p>Number of schools with only F1 and F4 be &#8216;d&#8217;<\/p>\n<p>From the information given in the question we will get the following Venn diagram.<\/p>\n<figure style=\"max-width: 511px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_dVRclfE.png\" width=\"511\" height=\"404\" data-image=\"image.png\" \/><\/figure>\n<p>From 5, b+141+3x=313 =&gt; b+3x=172&#8230;.(i)<\/p>\n<p>From 8, b+x+40+x=162 =&gt; b+2x=122&#8230;.(ii)<\/p>\n<p>(ii)-(i) gives x=50 =&gt; b=22<\/p>\n<p>From 9, 237+3x+c+d=279+3x=d =&gt; c=42<\/p>\n<p>Total number of schools =600 =&gt; 313+25+c+x+d+26+24+20+80=600 =&gt; d=20.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 425px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_gagYEXB.png\" width=\"425\" height=\"360\" data-image=\"image.png\" \/><\/figure>\n<p>The total number of schools with exactly three of the four facilities= 4x=200.<\/p>\n<p><strong>22)\u00a0Answer\u00a0(A)<\/strong><\/p>\n<p>Let the number of schools with exactly three of the facilities was the same irrespective of which three were considered be x.<\/p>\n<p>Number of schools with none of the facilities be &#8216;n&#8217; from 1, n=80.<\/p>\n<p>Number of schools with only F1 and F2 be &#8216;b&#8217;<\/p>\n<p>Number of schools with only F1 and F3 be &#8216;c&#8217;<\/p>\n<p>Number of schools with only F1 and F4 be &#8216;d&#8217;<\/p>\n<p>From the information given in the question we will get the following Venn diagram.<\/p>\n<figure style=\"max-width: 511px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_dVRclfE.png\" width=\"511\" height=\"404\" data-image=\"image.png\" \/><\/figure>\n<p>From 5, b+141+3x=313 =&gt; b+3x=172&#8230;.(i)<\/p>\n<p>From 8, b+x+40+x=162 =&gt; b+2x=122&#8230;.(ii)<\/p>\n<p>(ii)-(i) gives x=50 =&gt; b=22<\/p>\n<p>From 9, 237+3x+c+d=279+3x=d =&gt; c=42<\/p>\n<p>Total number of schools =600 =&gt; 313+25+c+x+d+26+24+20+80=600 =&gt; d=20.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 425px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_gagYEXB.png\" width=\"425\" height=\"360\" data-image=\"image.png\" \/><\/figure>\n<p>The total number of schools having facilities F4 and F2= 45+50+50+40=185.<\/p>\n<p><b>23)\u00a0Answer:\u00a042<\/b><\/p>\n<p>Let the number of schools with exactly three of the facilities was the same irrespective of which three were considered be x.<\/p>\n<p>Number of schools with none of the facilities be &#8216;n&#8217; from 1, n=80.<\/p>\n<p>Number of schools with only F1 and F2 be &#8216;b&#8217;<\/p>\n<p>Number of schools with only F1 and F3 be &#8216;c&#8217;<\/p>\n<p>Number of schools with only F1 and F4 be &#8216;d&#8217;<\/p>\n<p>From the information given in the question we will get the following Venn diagram.<\/p>\n<figure style=\"max-width: 511px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_dVRclfE.png\" width=\"511\" height=\"404\" data-image=\"image.png\" \/><\/figure>\n<p>From 5, b+141+3x=313 =&gt; b+3x=172&#8230;.(i)<\/p>\n<p>From 8, b+x+40+x=162 =&gt; b+2x=122&#8230;.(ii)<\/p>\n<p>(ii)-(i) gives x=50 =&gt; b=22<\/p>\n<p>From 9, 237+3x+c+d=279+3x=d =&gt; c=42<\/p>\n<p>Total number of schools =600 =&gt; 313+25+c+x+d+26+24+20+80=600 =&gt; d=20.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 425px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_gagYEXB.png\" width=\"425\" height=\"360\" data-image=\"image.png\" \/><\/figure>\n<p>The total number of schools having only F1 and F3= c=42<\/p>\n<p><b>24)\u00a0Answer:\u00a020<\/b><\/p>\n<p>Let the number of schools with exactly three of the facilities was the same irrespective of which three were considered be x.<\/p>\n<p>Number of schools with none of the facilities be &#8216;n&#8217; from 1, n=80.<\/p>\n<p>Number of schools with only F1 and F2 be &#8216;b&#8217;<\/p>\n<p>Number of schools with only F1 and F3 be &#8216;c&#8217;<\/p>\n<p>Number of schools with only F1 and F4 be &#8216;d&#8217;<\/p>\n<p>From the information given in the question we will get the following Venn diagram.<\/p>\n<figure style=\"max-width: 511px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_dVRclfE.png\" width=\"511\" height=\"404\" data-image=\"image.png\" \/><\/figure>\n<p>From 5, b+141+3x=313 =&gt; b+3x=172&#8230;.(i)<\/p>\n<p>From 8, b+x+40+x=162 =&gt; b+2x=122&#8230;.(ii)<\/p>\n<p>(ii)-(i) gives x=50 =&gt; b=22<\/p>\n<p>From 9, 237+3x+c+d=279+3x=d =&gt; c=42<\/p>\n<p>Total number of schools =600 =&gt; 313+25+c+x+d+26+24+20+80=600 =&gt; d=20.<\/p>\n<p>The final table looks like:<\/p>\n<figure style=\"max-width: 425px;\"><img loading=\"lazy\" decoding=\"async\" class=\"img-responsive\" src=\"https:\/\/cracku.in\/media\/uploads\/image_gagYEXB.png\" width=\"425\" height=\"360\" data-image=\"image.png\" \/><\/figure>\n<p>The total number of schools having only F1 and F4=20.<\/p>\n<p class=\"text-center\"><a href=\"https:\/\/play.google.com\/store\/apps\/details?id=in.cracku.app&amp;hl=en_IN&amp;gl=US\" target=\"_blank\" class=\"btn btn-danger \">Free CAT preparation App<\/a><\/p>\n<p>We hope this\u00a0 for CAT 2020 LRDI Question Paper With Answers PDF with Solutions will be helpful to you.<\/p>\n","protected":false},"excerpt":{"rendered":"<p>\u00a0CAT 2020 Slot 3 LRDI Questions PDF Download CAT 2020 LRDI Slot-3 Questions PDF with detailed solutions. Practice Data Interpretation and Logical Reasoning Slot-3 Questions asked in the CAT exam to understand the type and level of questions asked in the exam. Enroll to CAT 2021 online coaching Instructions Sixteen patients in a hospital must [&hellip;]<\/p>\n","protected":false},"author":58,"featured_media":64509,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"om_disable_all_campaigns":false,"_mi_skip_tracking":false,"footnotes":""},"categories":[3],"tags":[4289,4561],"class_list":{"0":"post-64465","1":"post","2":"type-post","3":"status-publish","4":"format-standard","5":"has-post-thumbnail","7":"category-cat","8":"tag-cat-2021","9":"tag-cat-lrdi"},"better_featured_image":{"id":64509,"alt_text":"CAT LRDI 2020 QUESTIONS","caption":"CAT LRDI 2020 QUESTIONS","description":"CAT LRDI 2020 QUESTIONS","media_type":"image","media_details":{"width":1200,"height":630,"file":"2021\/03\/fig-09-03-2021_10-22-31.jpg","sizes":{"medium":{"file":"fig-09-03-2021_10-22-31-300x158.jpg","width":300,"height":158,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-300x158.jpg"},"large":{"file":"fig-09-03-2021_10-22-31-1024x538.jpg","width":1024,"height":538,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-1024x538.jpg"},"thumbnail":{"file":"fig-09-03-2021_10-22-31-150x150.jpg","width":150,"height":150,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-150x150.jpg"},"medium_large":{"file":"fig-09-03-2021_10-22-31-768x403.jpg","width":768,"height":403,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-768x403.jpg"},"tiny-lazy":{"file":"fig-09-03-2021_10-22-31-30x16.jpg","width":30,"height":16,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-30x16.jpg"},"td_218x150":{"file":"fig-09-03-2021_10-22-31-218x150.jpg","width":218,"height":150,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-218x150.jpg"},"td_324x400":{"file":"fig-09-03-2021_10-22-31-324x400.jpg","width":324,"height":400,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-324x400.jpg"},"td_696x0":{"file":"fig-09-03-2021_10-22-31-696x365.jpg","width":696,"height":365,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-696x365.jpg"},"td_1068x0":{"file":"fig-09-03-2021_10-22-31-1068x561.jpg","width":1068,"height":561,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-1068x561.jpg"},"td_0x420":{"file":"fig-09-03-2021_10-22-31-800x420.jpg","width":800,"height":420,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-800x420.jpg"},"td_80x60":{"file":"fig-09-03-2021_10-22-31-80x60.jpg","width":80,"height":60,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-80x60.jpg"},"td_100x70":{"file":"fig-09-03-2021_10-22-31-100x70.jpg","width":100,"height":70,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-100x70.jpg"},"td_265x198":{"file":"fig-09-03-2021_10-22-31-265x198.jpg","width":265,"height":198,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-265x198.jpg"},"td_324x160":{"file":"fig-09-03-2021_10-22-31-324x160.jpg","width":324,"height":160,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-324x160.jpg"},"td_324x235":{"file":"fig-09-03-2021_10-22-31-324x235.jpg","width":324,"height":235,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-324x235.jpg"},"td_356x220":{"file":"fig-09-03-2021_10-22-31-356x220.jpg","width":356,"height":220,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-356x220.jpg"},"td_356x364":{"file":"fig-09-03-2021_10-22-31-356x364.jpg","width":356,"height":364,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-356x364.jpg"},"td_533x261":{"file":"fig-09-03-2021_10-22-31-533x261.jpg","width":533,"height":261,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-533x261.jpg"},"td_534x462":{"file":"fig-09-03-2021_10-22-31-534x462.jpg","width":534,"height":462,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-534x462.jpg"},"td_696x385":{"file":"fig-09-03-2021_10-22-31-696x385.jpg","width":696,"height":385,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-696x385.jpg"},"td_741x486":{"file":"fig-09-03-2021_10-22-31-741x486.jpg","width":741,"height":486,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-741x486.jpg"},"td_1068x580":{"file":"fig-09-03-2021_10-22-31-1068x580.jpg","width":1068,"height":580,"mime-type":"image\/jpeg","source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31-1068x580.jpg"}},"image_meta":{"aperture":"0","credit":"","camera":"","caption":"","created_timestamp":"0","copyright":"","focal_length":"0","iso":"0","shutter_speed":"0","title":"","orientation":"0"}},"post":64465,"source_url":"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31.jpg"},"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v14.4.1 - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<meta name=\"description\" content=\"Download CAT 2020 LRDI Slot-3 Questions PDF with detailed solutions. Practice Data Interpretation and Logical Reasoning Slot-3 Questions asked in the CAT exam to understand the type and level of questions asked in the exam.\" \/>\n<meta name=\"robots\" content=\"index, follow\" \/>\n<meta name=\"googlebot\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<meta name=\"bingbot\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"CAT 2020 LRDI Slot-3 Questions PDF - Cracku\" \/>\n<meta property=\"og:description\" content=\"Download CAT 2020 LRDI Slot-3 Questions PDF with detailed solutions. Practice Data Interpretation and Logical Reasoning Slot-3 Questions asked in the CAT exam to understand the type and level of questions asked in the exam.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/\" \/>\n<meta property=\"og:site_name\" content=\"Cracku\" \/>\n<meta property=\"article:publisher\" content=\"https:\/\/www.facebook.com\/crackuexam\/\" \/>\n<meta property=\"article:published_time\" content=\"2025-02-19T10:30:54+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2025-02-24T06:02:24+00:00\" \/>\n<meta property=\"og:image\" content=\"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31.jpg\" \/>\n\t<meta property=\"og:image:width\" content=\"1200\" \/>\n\t<meta property=\"og:image:height\" content=\"630\" \/>\n<meta name=\"twitter:card\" content=\"summary\" \/>\n<meta name=\"twitter:creator\" content=\"@crackuexam\" \/>\n<meta name=\"twitter:site\" content=\"@crackuexam\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"Organization\",\"@id\":\"https:\/\/cracku.in\/blog\/#organization\",\"name\":\"Cracku\",\"url\":\"https:\/\/cracku.in\/blog\/\",\"sameAs\":[\"https:\/\/www.facebook.com\/crackuexam\/\",\"https:\/\/www.youtube.com\/channel\/UCjrG4n3cS6y45BfCJjp3boQ\",\"https:\/\/twitter.com\/crackuexam\"],\"logo\":{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/cracku.in\/blog\/#logo\",\"inLanguage\":\"en-US\",\"url\":\"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2016\/09\/logo-blog-2.png\",\"width\":544,\"height\":180,\"caption\":\"Cracku\"},\"image\":{\"@id\":\"https:\/\/cracku.in\/blog\/#logo\"}},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/cracku.in\/blog\/#website\",\"url\":\"https:\/\/cracku.in\/blog\/\",\"name\":\"Cracku\",\"description\":\"A smarter way to prepare for CAT, XAT, TISSNET, CMAT and other MBA Exams.\",\"publisher\":{\"@id\":\"https:\/\/cracku.in\/blog\/#organization\"},\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":\"https:\/\/cracku.in\/blog\/?s={search_term_string}\",\"query-input\":\"required name=search_term_string\"}],\"inLanguage\":\"en-US\"},{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#primaryimage\",\"inLanguage\":\"en-US\",\"url\":\"https:\/\/cracku.in\/blog\/wp-content\/uploads\/2021\/03\/fig-09-03-2021_10-22-31.jpg\",\"width\":1200,\"height\":630,\"caption\":\"CAT LRDI 2020 QUESTIONS\"},{\"@type\":\"WebPage\",\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#webpage\",\"url\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/\",\"name\":\"CAT 2020 LRDI Slot-3 Questions PDF - Cracku\",\"isPartOf\":{\"@id\":\"https:\/\/cracku.in\/blog\/#website\"},\"primaryImageOfPage\":{\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#primaryimage\"},\"datePublished\":\"2025-02-19T10:30:54+00:00\",\"dateModified\":\"2025-02-24T06:02:24+00:00\",\"description\":\"Download CAT 2020 LRDI Slot-3 Questions PDF with detailed solutions. Practice Data Interpretation and Logical Reasoning Slot-3 Questions asked in the CAT exam to understand the type and level of questions asked in the exam.\",\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/\"]}]},{\"@type\":\"Article\",\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#article\",\"isPartOf\":{\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#webpage\"},\"author\":{\"@id\":\"https:\/\/cracku.in\/blog\/#\/schema\/person\/e52d7585688d8bbb74ce38cd4843a538\"},\"headline\":\"CAT 2020 LRDI Slot-3 Questions PDF\",\"datePublished\":\"2025-02-19T10:30:54+00:00\",\"dateModified\":\"2025-02-24T06:02:24+00:00\",\"commentCount\":0,\"mainEntityOfPage\":{\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#webpage\"},\"publisher\":{\"@id\":\"https:\/\/cracku.in\/blog\/#organization\"},\"image\":{\"@id\":\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#primaryimage\"},\"keywords\":\"CAT 2021,CAT LRDI\",\"articleSection\":\"CAT\",\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"CommentAction\",\"name\":\"Comment\",\"target\":[\"https:\/\/cracku.in\/blog\/cat-2020-lrdi-slot-3-questions-pdf\/#respond\"]}]},{\"@type\":[\"Person\"],\"@id\":\"https:\/\/cracku.in\/blog\/#\/schema\/person\/e52d7585688d8bbb74ce38cd4843a538\",\"name\":\"Hridesh kumar\",\"image\":{\"@type\":\"ImageObject\",\"@id\":\"https:\/\/cracku.in\/blog\/#personlogo\",\"inLanguage\":\"en-US\",\"url\":\"https:\/\/secure.gravatar.com\/avatar\/401a4ec31a7ab3f92ac238682fbc9a4cb3d87012452a3e237a3dd39ceca00d5b?s=96&d=mm&r=g\",\"caption\":\"Hridesh kumar\"}}]}<\/script>\n<!-- \/ Yoast SEO plugin. -->","_links":{"self":[{"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/posts\/64465","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/users\/58"}],"replies":[{"embeddable":true,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/comments?post=64465"}],"version-history":[{"count":7,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/posts\/64465\/revisions"}],"predecessor-version":[{"id":227868,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/posts\/64465\/revisions\/227868"}],"wp:featuredmedia":[{"embeddable":true,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/media\/64509"}],"wp:attachment":[{"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/media?parent=64465"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/categories?post=64465"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/cracku.in\/blog\/wp-json\/wp\/v2\/tags?post=64465"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}