List of top Data Interpretation & Logical Reasoning (DILR) Questions asked in CAT

The schematic diagram below shows 12 rectangular houses in a housing complex. House numbers are mentioned in the rectangles representing the houses. The houses are located in six columns - Column-A through Column-F, and two rows - Row-1 and Row- 2 . The houses are divided into two blocks - Block XX and Block YY. The diagram also shows two roads, one passing in front of the houses in Row-2 and another between the two blocks. 
12 rectangular houses in a housing complex. House numbers are mentioned in the rectangles representing the houses
Some of the houses are occupied. The remaining ones are vacant and are the only ones available for sale.
The road adjacency value of a house is the number of its sides adjacent to a road. For example, the road adjacency values of C2, F2, and B1 are 2, 1, and 0, respectively. The neighbour count of a house is the number of sides of that house adjacent to occupied houses in the same block. For example, E1 and C1 can have the maximum possible neighbour counts of 3 and 2, respectively. 
The base price of a vacant house is Rs. 10 lakhs if the house does not have a parking space, and Rs. 12 lakhs if it does. The quoted price (in lakhs of Rs.) of a vacant house is calculated as (base price) + 5 × (road adjacency value) + 3 × (neighbour count). 
The following information is also known. 
1. The maximum quoted price of a house in Block XX is Rs. 24 lakhs. The minimum quoted price of a house in block YY is Rs. 15 lakhs, and one such house is in Column-E. 
2. Row-1 has two occupied houses, one in each block. 
3. Both houses in Column-E are vacant. Each of Column-D and Column-F has at least one occupied house. 
4. There is only one house with parking space in Block YY.
What is the maximum possible quoted price (in lakhs of Rs.) for a vacant house in Column-E? [This question was asked as TITA]
Three participants – Akhil, Bimal and Chatur participate in a random draw competition for five days. Every day, each participant randomly picks up a ball numbered between 1 and 9. The number on the ball determines his score on that day. The total score of a participant is the sum of his scores attained in the five days. The total score of a day is the sum of participants’ scores on that day. The 2-day average on a day, except on Day 1, is the average of the total scores of that day and of the previous day. For example, if the total scores of Day 1 and Day 2 are 25 and 20, then the 2-day average on Day 2 is calculated as 22.5. Table 1 gives the 2-day averages for Days 2 through 5.
Table 1: 2-day averages for Days through 5
Day 2Day 3Day 4Day 5
1515.51617
Participants are ranked each day, with the person having the maximum score being awarded the minimum rank (1) on that day. If there is a tie, all participants with the tied score are awarded the best available rank. For example, if on a day Akhil, Bimal, and Chatur score 8, 7 and 7 respectively, then their ranks will be 1, 2 and 2 respectively on that day. These ranks are given in Table 2. 
Table 2 : Ranks of participants on each day
 Day 1Day 2Day 3Day 4Day 5
Akhil12233
Bimal23211
Chatur31122
The following information is also known. 
1. Chatur always scores in multiples of 3. His score on Day 2 is the unique highest score in the competition. His minimum score is observed only on Day 1, and it matches Akhil’s score on Day 4. 
2. The total score on Day 3 is the same as the total score on Day 4. 
3. Bimal’s scores are the same on Day 1 and Day 3.
The schematic diagram below shows 12 rectangular houses in a housing complex. House numbers are mentioned in the rectangles representing the houses. The houses are located in six columns - Column-A through Column-F, and two rows - Row-1 and Row- 2 . The houses are divided into two blocks - Block XX and Block YY. The diagram also shows two roads, one passing in front of the houses in Row-2 and another between the two blocks. 
12 rectangular houses in a housing complex. House numbers are mentioned in the rectangles representing the houses
Some of the houses are occupied. The remaining ones are vacant and are the only ones available for sale.
The road adjacency value of a house is the number of its sides adjacent to a road. For example, the road adjacency values of C2, F2, and B1 are 2, 1, and 0, respectively. The neighbour count of a house is the number of sides of that house adjacent to occupied houses in the same block. For example, E1 and C1 can have the maximum possible neighbour counts of 3 and 2, respectively. 
The base price of a vacant house is Rs. 10 lakhs if the house does not have a parking space, and Rs. 12 lakhs if it does. The quoted price (in lakhs of Rs.) of a vacant house is calculated as (base price) + 5 × (road adjacency value) + 3 × (neighbour count). 
The following information is also known. 
1. The maximum quoted price of a house in Block XX is Rs. 24 lakhs. The minimum quoted price of a house in block YY is Rs. 15 lakhs, and one such house is in Column-E. 
2. Row-1 has two occupied houses, one in each block. 
3. Both houses in Column-E are vacant. Each of Column-D and Column-F has at least one occupied house. 
4. There is only one house with parking space in Block YY.
Anjali, Bipasha, and Chitra visited an entertainment park that has four rides. Each ride lasts one hour and can accommodate one visitor at one point. All rides begin at 9 am and must be completed by 5 pm except for Ride-3, for which the last ride has to be completed by 1 pm. Ride gates open every 30 minutes, e.g. 10 am, 10:30 am, and so on. Whenever a ride gate opens, and there is no visitor inside, the first visitor waiting in the queue buys the ticket just before taking the ride. The ticket prices are Rs. 20, Rs. 50, Rs. 30 and Rs. 40 for Rides 1 to 4, respectively. Each of the three visitors took at least one ride and did not necessarily take all rides. None of them took the same ride more than once. The movement time from one ride to another is negligible, and a visitor leaves the ride immediately after the completion of the ride. No one takes a break inside the park unless mentioned explicitly.
The following information is also known.
1. Chitra never waited in the queue and completed her visit by 11 am after spending Rs. 50 to pay for the ticket(s).
2. Anjali took Ride-1 at 11 am after waiting for 30 mins for Chitra to complete it. It was the only ride where Anjali waited.
3. Bipasha began her first of three rides at 11:30 am. All three visitors incurred the same amount of ticket expense by 12:15 pm.
4. The last ride taken by Anjali and Bipasha was the same, where Bipasha waited 30 mins for Anjali to complete her ride. Before standing in the queue for that ride, Bipasha took a 1- hour coffee break after completing her previous ride
A visa processing office (VPO) accepts visa applications in four categories - US, UK, Schengen, and Others. The applications are scheduled for processing in twenty 15-minute slots starting at 9:00 am and ending at 2:00 pm. Ten applications are scheduled in each slot.
There are ten counters in the office, four dedicated to US applications, and two each for UK applications, Schengen applications and Others applications. Applicants are called in for processing sequentially on a first-come-first-served basis whenever a counter gets freed for their category. The processing time for an application is the same within each category. But it may vary across the categories. Each US and UK application requires 10 minutes of processing time. Depending on the number of applications in a category and time required to process an application for that category, it is possible that an applicant for a slot may be processed later.
On a particular day, Ira, Vijay and Nandini were scheduled for Schengen visa processing in that order. They had a 9:15 am slot but entered the VPO at 9:20 am. When they entered the office, exactly six out of the ten counters were either processing applications, or had finished processing one and ready to start processing the next.
Mahira and Osman were scheduled in the 9:30 am slot on that day for visa processing in the Others category.
The following additional information is known about that day.
1. All slots were full.
2. The number of US applications was the same in all the slots. The same was true for the other three categories.
3. 50% of the applications were US applications.
4. All applicants except Ira, Vijay and Nandini arrived on time.
5. Vijay was called to a counter at 9:25 am.
Pulak, Qasim,Ritesh and Suresh participated in a tournament comprising of eight rounds. In each round,they formed two pairs, with each of them being in exactly one pair. The only restriction in the pairing was that the pairs would change in successive rounds. For example,if Pulak formed a pair with Qasim in the first round,then he would have to form a pair with Ritesh or Suresh in the second round. He would be free to pair with Qasim again in the third round. In each round,each pair decided whether to play the game in that round or not. If they decided not to play,then no money was exchanged between them. If they decided to play, they had to bet either ₹1 or ₹2 in that round. For example,if they chose to bet ₹2,then the player winning the game got ₹2 from the one losing the game.
At the beginning of the tournament,the players had ₹10 each. The following table shows partial information about the amounts that the players had at the end of each of the eight rounds. It shows every time a player had ₹10 at the end of a round, as well as every time, at the end of a round, a player had either the minimum or the maximum amount that he would have had across the eight rounds. For example,Suresh had ₹10 at the end of Rounds 1,3 and 8 and not after any of the other rounds. The maximum amount that he had at the end of any round was ₹13 (at the end of Round 5) and the minimum amount he had at the end of any round was ₹8 (at the end of Round 2). At the end of all other rounds,he must have had either ₹9,₹11 or ₹12. 
It was also known that Pulak and Qasim had the same amount of money with them at the end of Round 4.
Pulak, Qasim,Ritesh and Suresh participated
Every day a widget supplier supplies widgets from the warehouse (W) to four locations – Ahmednagar (A), Bikrampore (B), Chitrachak (C), and Deccan Park (D). The daily demand for widgets in each location is uncertain and independent of each other. Demands and corresponding probability values (in parenthesis) are given against each location (A, B, C, and D) in the figure below. For example, there is a 40% chance that the demand in Ahmednagar will be 50 units and a 60% chance that the demand will be 70 units. The lines in the figure connecting the locations and warehouse represent two-way roads connecting those places with the distances (in km) shown beside the line. The distances in both the directions along a road are equal. For example, the road from Ahmednagar to Bikrampore and the road from Bikrampore to Ahmednagar are both 6 km long. 
Every day the supplier gets the information about the demand values of the four locations and creates the travel route that starts from the warehouse and ends at a location after visiting all the locations exactly once. While making the route plan, the supplier goes to the locations in decreasing order of demand. If there is a tie for the choice of the next location, the supplier will go to the location closest to the current location. Also, while creating the route, the supplier can either follow the direct path (if available) from one location to another or can take the path via the warehouse. If both paths are available (direct and via warehouse), the supplier will choose the path with minimum distance.
widget supplier