TITA Based Questions : Arrangements and Puzzles | Logical Reasoning (LR) and Data Interpretation (DI) - CAT PDF Download

Ans: 3
This is the figure that has been given to us,

We are given the information that, out of the 9 intersections in the figure, 6 of them have ATMs. That means, 3 of these intersections are empty.
We are also told that, the ATMs with the highest and lowest capacity are on the same road, highest capacity being 15L and lowest being 7L.
This information not only gives us clues about the location of these two ATMs but also, now we know the upper and lower bounds for cash in the six ATMs with distinct cash.
Next piece of information that is given is that, road distance between the ATM with the second highest cashrequirement and the ATM located at the intersection of R-C and V3 is12 km. Since we can only traverse on the roads, from (RC, V3) we have to either traverse the 5km road or the 7km road. The only way it can add up to 12 is 5+7. That means, ATM with the second highest capacity is at (RB, V2).
Now, let us start arranging the ATM's.
We are told that 15 and 7 are on the same road. Since we are given the total capacities on the roads, we need to identify the roads with capacity higher or equal to 22.
There are only two possible choice, either RA or V3.
Looking at V3, we see that 15L ATM cannot come at (RB, V3) or (RC, V3) since the RB and RC capacity is 20, and the minimum ATM limit is 7L, if a 15L ATM is on a road with total capacity 20L, this is a situation that is not possible since there cannot be an ATM with 5L capacity.
The same is the case with the intersection (RA, V2). So, we can narrow down the fact that the 15L ATM has to either be at (RA, V1) or (RA, V3)
Case 1: 15L ATM is on the intersection (RA, V3)

We see that, for V3 to add upto 26, there has to be an ATM with cash of 11L, there cannot be two ATM's since the minimum capacity is 7L.
We can place the 11L ATM at (RB, V3) or (RC, V3), if we place them at either of these intersections, the remaining ATM has to have a capacity of 9L for the same reason. 9L cannot be at (RC, V1) or (RB, V1) since the total capacity of V1 is 15L and there cannot be an ATM with 6L. And it also cannot be at (RB, V2) since there is already an ATM with 11L that means the ATM with the second highest capacity cannot be 9. So that means 9L has to be at (RC, V2). And then filling in the rest of the numbers we get the final arrangement for Case-1.

Case 2: When 15L is at (RA, V1)
There can be no other ATM on V1 in this scenario, 7L ATM which is on RA cannot be on (RA, V2) considering the sum of the numbers on V2 is 21, and there cannot be 7+7 or a 14L ATM since the capacity of both RB and RC is 20. So, 7L has to be on V3, and since there cannot be a single ATM of 19L on V3, there has to be two other ATMs on V3 adding up to 19. Rearranging the numbers, we get the scenario for the second case.

Using the two cases, we can answer the given questions.
Three ATM's with 10L or more: 15L, 12L and 11L. 
Answer is 3.

Ans: 3
This is the figure that has been given to us,

We are given the information that, out of the 9 intersections in the figure, 6 of them have ATMs. That means, 3 of these intersections are empty.
We are also told that, the ATMs with the highest and lowest capacity are on the same road, highest capacity being 15L and lowest being 7L.
This information not only gives us clues about the location of these two ATMs but also, now we know the upper and lower bounds for cash in the six ATMs with distinct cash.
Next piece of information that is given is that, road distance between the ATM with the second highest cashrequirement and the ATM located at the intersection of R-C and V3 is12 km. Since we can only traverse on the roads, from (RC, V3) we have to either traverse the 5km road or the 7km road. The only way it can add up to 12 is 5+7. That means, ATM with the second highest capacity is at (RB, V2).
Now, let us start arranging the ATM's.
We are told that 15 and 7 are on the same road. Since we are given the total capacities on the roads, we need to identify the roads with capacity higher or equal to 22.
There are only two possible choice, either RA or V3.
Looking at V3, we see that 15L ATM cannot come at (RB, V3) or (RC, V3) since the RB and RC capacity is 20, and the minimum ATM limit is 7L, if a 15L ATM is on a road with total capacity 20L, this is a situation that is not possible since there cannot be an ATM with 5L capacity.
The same is the case with the intersection (RA, V2). So, we can narrow down the fact that the 15L ATM has to either be at (RA, V1) or (RA, V3)
Case 1: 15L ATM is on the intersection (RA, V3)

We see that, for V3 to add upto 26, there has to be an ATM with cash of 11L, there cannot be two ATM's since the minimum capacity is 7L.
We can place the 11L ATM at (RB, V3) or (RC, V3), if we place them at either of these intersections, the remaining ATM has to have a capacity of 9L for the same reason. 9L cannot be at (RC, V1) or (RB, V1) since the total capacity of V1 is 15L and there cannot be an ATM with 6L. And it also cannot be at (RB, V2) since there is already an ATM with 11L that means the ATM with the second highest capacity cannot be 9. So that means 9L has to be at (RC, V2). And then filling in the rest of the numbers we get the final arrangement for Case-1.

Case 2: When 15L is at (RA, V1)
There can be no other ATM on V1 in this scenario, 7L ATM which is on RA cannot be on (RA, V2) considering the sum of the numbers on V2 is 21, and there cannot be 7+7 or a 14L ATM since the capacity of both RB and RC is 20. So, 7L has to be on V3, and since there cannot be a single ATM of 19L on V3, there has to be two other ATMs on V3 adding up to 19. Rearranging the numbers, we get the scenario for the second case.

Using the two cases, we can answer the given questions.
ATMs that can be uniquely determines are the ATMs with cash 9L, 11L and 12L. 
Hence the answer is 3.

Ans: 3

It is given that some of the houses are occupied. The remaining ones are vacant and are the only ones available for sale.
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 × (neighbor count).
It is also known that the maximum quoted price of a house in Block XX is Rs. 24 lakhs
Hence, there can be two cases for the maximum quoted price of a house in block XX.
Case 1: House with parking space:
=> 12+5a+3b = 24 => 5a+3b = 12 ( a = road adjacency value, b= neighbor count)
The only value for which the equation satisfies is (a = 0, and b=4). But the value of b can't be 4 because the maximum neighbor count can be at most 3.
Hence, case 1 is invalid.
Case 2: House without parking space:
=> 10+5a+3b = 24 => 5a+3b = 14
=> (a, b) = (1, 3)
Hence, the house must have 3 neighbors and 1 road connected to it. Hence, the only possible case is B2. Therefore, the neighbor houses of B2, which are (B1, A2, and C2) are occupied.
It is known that Row 1 has two occupied houses, one in each block. Since B1 is already occupied, it implies A1, and C1 are vacant.
Hence, the configuration of block XX is given below: (Where U = Unoccupied/ Vacant, and U = Occupied)

Now for block YY, we know that both houses in Column E are vacant. Each of Column-D and Column-F has at least one occupied house. There is only one house with parking space in Block YY.
It is also known that the minimum quoted price of a house in block YY is Rs. 15 lakhs, and one such house is in Column E.
Case 1: The minimum quoted house is E2:
We know that the road adjacency of E2 is 1, hence we can calculate whether the house has parking space or not, and the neighbor count (b)
If the house has parking space, then: 12+5*1+3*b = 15 => 3b = -2 (which is not possible)
Hence, the house has no parking space => 10+5*1+3b = 15 => b = 0
b = 0 implies all the neighbor house of E2 is vacant, which are (E1, D2, and F2).
It is known that each of Column-D and Column-F has at least one occupied house, which implies D1, and F1 must be occupied.
But D1 and F1 can't be occupied together since the total number of occupied houses in Row 1 is 2 (one in each block).
Hence, This case is invalid.
Case 2: The minimum quoted house is E1:
We know that the road adjacency of E1 is 0, hence we can calculate whether the house has parking space or not, and the neighbor count (b).
i) If the house has no working space, then: 10+5*0+3b = 15 => b = 5/3 (this is not possible since b has to be an integer value)
Hence, the house has parking space => 12+5*0+3b = 15 => b = 1 => One neighbor house is occupied among D1 and F1.
Let's take the case of house D1 being occupied and F1 being empty. In that case, the value of house F1 would be 10(there is no parking space)+ (5*0) + (3*the number of neighbours)
Here, even if we take the number of neighbors to be 1, which is the maximum for F1 in this case, the value of F1 would be a maximum of 13. This is lower than the lowest-value house in block YY. Therefore, F1 cannot be empty.
Since F1 is occupied and we know that there is only one house occupied in row 1 of each block, D1 becomes unoccupied. D2 becomes occupied because it is given in the question that each of Column-D and Column-F has at least one occupied house.
Here, the value of D1 is 18 as D2 is occupied.
We do not know the status of house F2.
Therefore, the final diagram is given below:

From the diagram, we can see that 3 houses are vacant in block XX.

Ans: B1

It is given that some of the houses are occupied. The remaining ones are vacant and are the only ones available for sale.
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 × (neighbor count).
It is also known that the maximum quoted price of a house in Block XX is Rs. 24 lakhs
Hence, there can be two cases for the maximum quoted price of a house in block XX.
Case 1: House with parking space:
=> 12+5a+3b = 24 => 5a+3b = 12 ( a = road adjacency value, b= neighbor count)
The only value for which the equation satisfies is (a = 0, and b=4). But the value of b can't be 4 because the maximum neighbor count can be at most 3.
Hence, case 1 is invalid.
Case 2: House without parking space:
=> 10+5a+3b = 24 => 5a+3b = 14
=> (a, b) = (1, 3)
Hence, the house must have 3 neighbors and 1 road connected to it. Hence, the only possible case is B2. Therefore, the neighbor houses of B2, which are (B1, A2, and C2) are occupied.
It is known that Row 1 has two occupied houses, one in each block. Since B1 is already occupied, it implies A1, and C1 are vacant.
Hence, the configuration of block XX is given below: (Where U = Unoccupied/ Vacant, and U = Occupied)

Now for block YY, we know that both houses in Column E are vacant. Each of Column-D and Column-F has at least one occupied house. There is only one house with parking space in Block YY.
It is also known that the minimum quoted price of a house in block YY is Rs. 15 lakhs, and one such house is in Column E.
Case 1: The minimum quoted house is E2:
We know that the road adjacency of E2 is 1, hence we can calculate whether the house has parking space or not, and the neighbor count (b)
If the house has parking space, then: 12+5*1+3*b = 15 => 3b = -2 (which is not possible)
Hence, the house has no parking space => 10+5*1+3b = 15 => b = 0
b = 0 implies all the neighbor house of E2 is vacant, which are (E1, D2, and F2).
It is known that each of Column-D and Column-F has at least one occupied house, which implies D1, and F1 must be occupied.
But D1 and F1 can't be occupied together since the total number of occupied houses in Row 1 is 2 (one in each block).
Hence, This case is invalid.
Case 2: The minimum quoted house is E1:
We know that the road adjacency of E1 is 0, hence we can calculate whether the house has parking space or not, and the neighbor count (b).
i) If the house has no working space, then: 10+5*0+3b = 15 => b = 5/3 (this is not possible since b has to be an integer value)
Hence, the house has parking space => 12+5*0+3b = 15 => b = 1 => One neighbor house is occupied among D1 and F1.
Let's take the case of house D1 being occupied and F1 being empty. In that case, the value of house F1 would be 10(there is no parking space)+ (5*0) + (3*the number of neighbours)
Here, even if we take the number of neighbors to be 1, which is the maximum for F1 in this case, the value of F1 would be a maximum of 13. This is lower than the lowest-value house in block YY. Therefore, F1 cannot be empty.
Since F1 is occupied and we know that there is only one house occupied in row 1 of each block, D1 becomes unoccupied. D2 becomes occupied because it is given in the question that each of Column-D and Column-F has at least one occupied house.
Here, the value of D1 is 18 as D2 is occupied.
We do not know the status of house F2.
Therefore, the final diagram is given below:

From the diagram, we can see that B1 and D2 are definitely occupied. The rest of the options are not definitely correct.
The correct options are both B and C.

Ans: 21

It is given that some of the houses are occupied. The remaining ones are vacant and are the only ones available for sale.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 × (neighbor count).It is also known that the maximum quoted price of a house in Block XX is Rs. 24 lakhs
Hence, there can be two cases for the maximum quoted price of a house in block XX.
Case 1: House with parking space:
=> 12+5a+3b = 24 => 5a+3b = 12 ( a = road adjacency value, b= neighbor count)
The only value for which the equation satisfies is (a = 0, and b=4). But the value of b can't be 4 because the maximum neighbor count can be at most 3.
Hence, case 1 is invalid.
Case 2: House without parking space:
=> 10+5a+3b = 24 => 5a+3b = 14
=> (a, b) = (1, 3)
Hence, the house must have 3 neighbors and 1 road connected to it. Hence, the only possible case is B2. Therefore, the neighbor houses of B2, which are (B1, A2, and C2) are occupied.
It is known that Row 1 has two occupied houses, one in each block. Since B1 is already occupied, it implies A1, and C1 are vacant.
Hence, the configuration of block XX is given below: (Where U = Unoccupied/ Vacant, and U = Occupied)

Now for block YY, we know that both houses in Column E are vacant. Each of Column-D and Column-F has at least one occupied house. There is only one house with parking space in Block YY.
It is also known that the minimum quoted price of a house in block YY is Rs. 15 lakhs, and one such house is in Column E.
Case 1: The minimum quoted house is E2:
We know that the road adjacency of E2 is 1, hence we can calculate whether the house has parking space or not, and the neighbor count (b)
If the house has parking space, then: 12+5*1+3*b = 15 => 3b = -2 (which is not possible)
Hence, the house has no parking space => 10+5*1+3b = 15 => b = 0
b = 0 implies all the neighbor house of E2 is vacant, which are (E1, D2, and F2).
It is known that each of Column-D and Column-F has at least one occupied house, which implies D1, and F1 must be occupied.
But D1 and F1 can't be occupied together since the total number of occupied houses in Row 1 is 2 (one in each block).
Hence, This case is invalid.
Case 2: The minimum quoted house is E1:
We know that the road adjacency of E1 is 0, hence we can calculate whether the house has parking space or not, and the neighbor count (b).
i) If the house has no working space, then: 10+5*0+3b = 15 => b = 5/3 (this is not possible since b has to be an integer value)
Hence, the house has parking space => 12+5*0+3b = 15 => b = 1 => One neighbor house is occupied among D1 and F1.
Let's take the case of house D1 being occupied and F1 being empty. In that case, the value of house F1 would be 10(there is no parking space)+ (5*0) + (3*the number of neighbours)
Here, even if we take the number of neighbors to be 1, which is the maximum for F1 in this case, the value of F1 would be a maximum of 13. This is lower than the lowest-value house in block YY. Therefore, F1 cannot be empty.
Since F1 is occupied and we know that there is only one house occupied in row 1 of each block, D1 becomes unoccupied. D2 becomes occupied because it is given in the question that each of Column-D and Column-F has at least one occupied house.
Here, the value of D1 is 18 as D2 is occupied.
We do not know the status of house F2.
Therefore, the final diagram is given below:

From the diagram, the vacant house with the maximum possible quoted price in column E is E2 when F2 is occupied.
The maximum possible quoted price of E2 is 10+5*1+3*2 = 21 Lacs. ( E2 has no parking space because E1 has the parking space, and it is given that there is only one house with parking space in Block YY.)

Ans: E1

It is given that some of the houses are occupied. The remaining ones are vacant and are the only ones available for sale.
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 × (neighbor count).
It is also known that the maximum quoted price of a house in Block XX is Rs. 24 lakhs
Hence, there can be two cases for the maximum quoted price of a house in block XX.
Case 1: House with parking space:
=> 12+5a+3b = 24 => 5a+3b = 12 ( a = road adjacency value, b= neighbor count)
The only value for which the equation satisfies is (a = 0, and b=4). But the value of b can't be 4 because the maximum neighbor count can be at most 3.
Hence, case 1 is invalid.
Case 2: House without parking space:
=> 10+5a+3b = 24 => 5a+3b = 14
=> (a, b) = (1, 3)
Hence, the house must have 3 neighbors and 1 road connected to it. Hence, the only possible case is B2. Therefore, the neighbor houses of B2, which are (B1, A2, and C2) are occupied.
It is known that Row 1 has two occupied houses, one in each block. Since B1 is already occupied, it implies A1, and C1 are vacant.
Hence, the configuration of block XX is given below: (Where U = Unoccupied/ Vacant, and U = Occupied)

Now for block YY, we know that both houses in Column E are vacant. Each of Column-D and Column-F has at least one occupied house. There is only one house with parking space in Block YY.
It is also known that the minimum quoted price of a house in block YY is Rs. 15 lakhs, and one such house is in Column E.
Case 1: The minimum quoted house is E2:
We know that the road adjacency of E2 is 1, hence we can calculate whether the house has parking space or not, and the neighbor count (b)
If the house has parking space, then: 12+5*1+3*b = 15 => 3b = -2 (which is not possible)
Hence, the house has no parking space => 10+5*1+3b = 15 => b = 0
b = 0 implies all the neighbor house of E2 is vacant, which are (E1, D2, and F2).
It is known that each of Column-D and Column-F has at least one occupied house, which implies D1, and F1 must be occupied.
But D1 and F1 can't be occupied together since the total number of occupied houses in Row 1 is 2 (one in each block).
Hence, This case is invalid.
Case 2: The minimum quoted house is E1:
We know that the road adjacency of E1 is 0, hence we can calculate whether the house has parking space or not, and the neighbor count (b).
i) If the house has no working space, then: 10+5*0+3b = 15 => b = 5/3 (this is not possible since b has to be an integer value)
Hence, the house has parking space => 12+5*0+3b = 15 => b = 1 => One neighbor house is occupied among D1 and F1.
Let's take the case of house D1 being occupied and F1 being empty. In that case, the value of house F1 would be 10(there is no parking space)+ (5*0) + (3*the number of neighbours)
Here, even if we take the number of neighbors to be 1, which is the maximum for F1 in this case, the value of F1 would be a maximum of 13. This is lower than the lowest-value house in block YY. Therefore, F1 cannot be empty.
Since F1 is occupied and we know that there is only one house occupied in row 1 of each block, D1 becomes unoccupied. D2 becomes occupied because it is given in the question that each of Column-D and Column-F has at least one occupied house.
Here, the value of D1 is 18 as D2 is occupied.
We do not know the status of house F2.
Therefore, the final diagram is given below:

From the diagram, we can see that E1 has the parking space (case 2).
The correct option is A

Ans: 2
Since we are required to use only two colours, these can be either
1. Green + Blue
2. ⁠Blue + Red
3. ⁠Green + Red
But we know that Between any two Red coloured beads in a row or a column, there have to be both a Green and a Blue coloured bead. Hence without both Green and Blue, Red beads cannot be used to fill the grid.Thus if we use only Green and Blue beads, the two configurations that are possible are:

There are only 2 configurations possible

Ans: 9

Maximum 9 red beads are possible as shown here

Ans: 6
To solve this question we can use the answer of the previous question, since maximum 9 red beads are possible, filling the remaining space with green and blue beads, in such a way that number of blue beads is minimised

Hence number of blue beads is 6

Ans: 6
6 more beads can be placed as shown