CAT: Logical ReasoningGrids. Free, no login required.

Anu, Bijay, Chetan, Deepak, Eshan, and Faruq are six friends. Each of them uses a mobile number from exactly one of the two mobile operators - Xitel and Yocel. During the last month, the six friends made several calls to each other. Each call was made by one of these six friends to another. The table below summarizes the number of minutes of calls that each of the six made to (outgoing minutes) and received from (incoming minutes) these friends, grouped by the operators. Some of the entries are missing.

It is known that the duration of calls from Faruq to Eshan was 200 minutes.

Also, there were no calls from:

i. Bijay to Eshan,

ii. Chetan to Anu and Chetan to Deepak,

iii. Deepak to Bijay and Deepak to Faruq,

iv. Eshan to Chetan and Eshan to Deepak.

Anu, Bijay, Chetan, Deepak, Eshan, and Faruq are six friends. Each of them uses a mobile number from exactly one of the two mobile operators - Xitel and Yocel. During the last month, the six friends made several calls to each other. Each call was made by one of these six friends to another. The table below summarizes the number of minutes of calls that each of the six made to (outgoing minutes) and received from (incoming minutes) these friends, grouped by the operators. Some of the entries are missing.

It is known that the duration of calls from Faruq to Eshan was 200 minutes.

Also, there were no calls from:

i. Bijay to Eshan,

ii. Chetan to Anu and Chetan to Deepak,

iii. Deepak to Bijay and Deepak to Faruq,

iv. Eshan to Chetan and Eshan to Deepak.

Anu, Bijay, Chetan, Deepak, Eshan, and Faruq are six friends. Each of them uses a mobile number from exactly one of the two mobile operators - Xitel and Yocel. During the last month, the six friends made several calls to each other. Each call was made by one of these six friends to another. The table below summarizes the number of minutes of calls that each of the six made to (outgoing minutes) and received from (incoming minutes) these friends, grouped by the operators. Some of the entries are missing.

It is known that the duration of calls from Faruq to Eshan was 200 minutes.

Also, there were no calls from:

i. Bijay to Eshan,

ii. Chetan to Anu and Chetan to Deepak,

iii. Deepak to Bijay and Deepak to Faruq,

iv. Eshan to Chetan and Eshan to Deepak.

Anu, Bijay, Chetan, Deepak, Eshan, and Faruq are six friends. Each of them uses a mobile number from exactly one of the two mobile operators - Xitel and Yocel. During the last month, the six friends made several calls to each other. Each call was made by one of these six friends to another. The table below summarizes the number of minutes of calls that each of the six made to (outgoing minutes) and received from (incoming minutes) these friends, grouped by the operators. Some of the entries are missing.

It is known that the duration of calls from Faruq to Eshan was 200 minutes.

Also, there were no calls from:

i. Bijay to Eshan,

ii. Chetan to Anu and Chetan to Deepak,

iii. Deepak to Bijay and Deepak to Faruq,

iv. Eshan to Chetan and Eshan to Deepak.

There are six spherical balls, B1, B2, B3, B4, B5, and B6, and four circular hoops H1, H2, H3, and H4.

Each ball was tested on each hoop once, by attempting to pass the ball through the hoop. If the diameter of a ball is not larger than the diameter of the hoop, the ball passes through the hoop and makes a "ping". Any ball having a diameter larger than that of the hoop gets stuck on that hoop and does not make a ping.

The following additional information is known:

1. B1 and B6 each made a ping on H4, but B5 did not.
2. B4 made a ping on H3, but B1 did not.
3. All balls, except B3, made pings on H1.
4. None of the balls, except B2, made a ping on H2.

There are six spherical balls, B1, B2, B3, B4, B5, and B6, and four circular hoops H1, H2, H3, and H4.

Each ball was tested on each hoop once, by attempting to pass the ball through the hoop. If the diameter of a ball is not larger than the diameter of the hoop, the ball passes through the hoop and makes a "ping". Any ball having a diameter larger than that of the hoop gets stuck on that hoop and does not make a ping.

The following additional information is known:

1. B1 and B6 each made a ping on H4, but B5 did not.
2. B4 made a ping on H3, but B1 did not.
3. All balls, except B3, made pings on H1.
4. None of the balls, except B2, made a ping on H2.

There are six spherical balls, B1, B2, B3, B4, B5, and B6, and four circular hoops H1, H2, H3, and H4.

Each ball was tested on each hoop once, by attempting to pass the ball through the hoop. If the diameter of a ball is not larger than the diameter of the hoop, the ball passes through the hoop and makes a "ping". Any ball having a diameter larger than that of the hoop gets stuck on that hoop and does not make a ping.

The following additional information is known:

1. B1 and B6 each made a ping on H4, but B5 did not.
2. B4 made a ping on H3, but B1 did not.
3. All balls, except B3, made pings on H1.
4. None of the balls, except B2, made a ping on H2.

There are six spherical balls, B1, B2, B3, B4, B5, and B6, and four circular hoops H1, H2, H3, and H4.

Each ball was tested on each hoop once, by attempting to pass the ball through the hoop. If the diameter of a ball is not larger than the diameter of the hoop, the ball passes through the hoop and makes a "ping". Any ball having a diameter larger than that of the hoop gets stuck on that hoop and does not make a ping.

The following additional information is known:

1. B1 and B6 each made a ping on H4, but B5 did not.
2. B4 made a ping on H3, but B1 did not.
3. All balls, except B3, made pings on H1.
4. None of the balls, except B2, made a ping on H2.

The figure below shows a network with three parallel roads represented by horizontal lines R-A, R-B, and R-C and another three parallel roads represented by vertical lines V1, V2, and V3. The figure also shows the distance (in km) between two adjacent intersections. Six ATMs are placed at six of the nine road intersections. Each ATM has a distinct integer cash requirement (in Rs. Lakhs), and the numbers at the end of each line in the figure indicate the total cash requirements of all ATMs placed on the corresponding road. For example, the total cash requirement of the ATM(s) placed on road R-A is Rs. 22 Lakhs.

The following additional information is known.

1. The ATMs with the minimum and maximum cash requirements of Rs. 7 Lakhs and Rs. 15 Lakhs are placed on the same road.
2. The road distance between the ATM with the second highest cash requirement and the ATM located at the intersection of R-C and V3 is 12 km.

The figure below shows a network with three parallel roads represented by horizontal lines R-A, R-B, and R-C and another three parallel roads represented by vertical lines V1, V2, and V3. The figure also shows the distance (in km) between two adjacent intersections. Six ATMs are placed at six of the nine road intersections. Each ATM has a distinct integer cash requirement (in Rs. Lakhs), and the numbers at the end of each line in the figure indicate the total cash requirements of all ATMs placed on the corresponding road. For example, the total cash requirement of the ATM(s) placed on road R-A is Rs. 22 Lakhs.

The following additional information is known.

1. The ATMs with the minimum and maximum cash requirements of Rs. 7 Lakhs and Rs. 15 Lakhs are placed on the same road.
2. The road distance between the ATM with the second highest cash requirement and the ATM located at the intersection of R-C and V3 is 12 km.

The figure below shows a network with three parallel roads represented by horizontal lines R-A, R-B, and R-C and another three parallel roads represented by vertical lines V1, V2, and V3. The figure also shows the distance (in km) between two adjacent intersections. Six ATMs are placed at six of the nine road intersections. Each ATM has a distinct integer cash requirement (in Rs. Lakhs), and the numbers at the end of each line in the figure indicate the total cash requirements of all ATMs placed on the corresponding road. For example, the total cash requirement of the ATM(s) placed on road R-A is Rs. 22 Lakhs.

The following additional information is known.

1. The ATMs with the minimum and maximum cash requirements of Rs. 7 Lakhs and Rs. 15 Lakhs are placed on the same road.
2. The road distance between the ATM with the second highest cash requirement and the ATM located at the intersection of R-C and V3 is 12 km.

The figure below shows a network with three parallel roads represented by horizontal lines R-A, R-B, and R-C and another three parallel roads represented by vertical lines V1, V2, and V3. The figure also shows the distance (in km) between two adjacent intersections. Six ATMs are placed at six of the nine road intersections. Each ATM has a distinct integer cash requirement (in Rs. Lakhs), and the numbers at the end of each line in the figure indicate the total cash requirements of all ATMs placed on the corresponding road. For example, the total cash requirement of the ATM(s) placed on road R-A is Rs. 22 Lakhs.

The following additional information is known.

1. The ATMs with the minimum and maximum cash requirements of Rs. 7 Lakhs and Rs. 15 Lakhs are placed on the same road.
2. The road distance between the ATM with the second highest cash requirement and the ATM located at the intersection of R-C and V3 is 12 km.

The figure below shows a network with three parallel roads represented by horizontal lines R-A, R-B, and R-C and another three parallel roads represented by vertical lines V1, V2, and V3. The figure also shows the distance (in km) between two adjacent intersections. Six ATMs are placed at six of the nine road intersections. Each ATM has a distinct integer cash requirement (in Rs. Lakhs), and the numbers at the end of each line in the figure indicate the total cash requirements of all ATMs placed on the corresponding road. For example, the total cash requirement of the ATM(s) placed on road R-A is Rs. 22 Lakhs.

The following additional information is known.

1. The ATMs with the minimum and maximum cash requirements of Rs. 7 Lakhs and Rs. 15 Lakhs are placed on the same road.
2. The road distance between the ATM with the second highest cash requirement and the ATM located at the intersection of R-C and V3 is 12 km.

The above is a schematic diagram of walkways (indicated by all the straight lines) and lakes (3 of them, each in the shape of rectangles - shaded in the diagram) of a gated area. Different points on the walkway are indicated by letters (A through P) with distances being OP = 150 m, ON = MN = 300 m, ML = 400 m, EL = 200 m, DE = 400 m.

The following additional information about the facilities in the area is known.

1. The only entry/exit point is at C.
2. There are many residences within the gated area; all of them are located on the path AH and ML with four of them being at A, H, M, and L.
3. The post office is located at P and the bank is located at B.

The above is a schematic diagram of walkways (indicated by all the straight lines) and lakes (3 of them, each in the shape of rectangles - shaded in the diagram) of a gated area. Different points on the walkway are indicated by letters (A through P) with distances being OP = 150 m, ON = MN = 300 m, ML = 400 m, EL = 200 m, DE = 400 m.

The following additional information about the facilities in the area is known.

1. The only entry/exit point is at C.
2. There are many residences within the gated area; all of them are located on the path AH and ML with four of them being at A, H, M, and L.
3. The post office is located at P and the bank is located at B.

The above is a schematic diagram of walkways (indicated by all the straight lines) and lakes (3 of them, each in the shape of rectangles - shaded in the diagram) of a gated area. Different points on the walkway are indicated by letters (A through P) with distances being OP = 150 m, ON = MN = 300 m, ML = 400 m, EL = 200 m, DE = 400 m.

The following additional information about the facilities in the area is known.

1. The only entry/exit point is at C.
2. There are many residences within the gated area; all of them are located on the path AH and ML with four of them being at A, H, M, and L.
3. The post office is located at P and the bank is located at B.

The above is a schematic diagram of walkways (indicated by all the straight lines) and lakes (3 of them, each in the shape of rectangles - shaded in the diagram) of a gated area. Different points on the walkway are indicated by letters (A through P) with distances being OP = 150 m, ON = MN = 300 m, ML = 400 m, EL = 200 m, DE = 400 m.

The following additional information about the facilities in the area is known.

1. The only entry/exit point is at C.
2. There are many residences within the gated area; all of them are located on the path AH and ML with four of them being at A, H, M, and L.
3. The post office is located at P and the bank is located at B.

There are nine boxes arranged in a $3\times3$ array as shown in Tables 1 and 2. Each box contains three sacks. Each sack has a certain number of coins, between 1 and 9, both inclusive.

The average number of coins per sack in the boxes are all distinct integers. The total number of coins in each row is the same. The total number of coins in each column is also the same.

Table 1 gives information regarding the median of the numbers of coins in the three sacks in a box for some of the boxes. In Table 2 each box has a number which represents the number of sacks in that box having more than 5 coins. That number is followed by a, if the sacks in that box satisfy exactly one among the following three conditions, and it is followed by. if two or more of these conditions are satisfied.

i) The minimum among the numbers of coins in the three sacks in the box is 1.

ii) The median of the numbers of coins in the three sacks is 1.

iii) The maximum among the numbers of coins in the three sacks in the box is 9.

There are nine boxes arranged in a $3\times3$ array as shown in Tables 1 and 2. Each box contains three sacks. Each sack has a certain number of coins, between 1 and 9, both inclusive.

The average number of coins per sack in the boxes are all distinct integers. The total number of coins in each row is the same. The total number of coins in each column is also the same.

Table 1 gives information regarding the median of the numbers of coins in the three sacks in a box for some of the boxes. In Table 2 each box has a number which represents the number of sacks in that box having more than 5 coins. That number is followed by a, if the sacks in that box satisfy exactly one among the following three conditions, and it is followed by. if two or more of these conditions are satisfied.

i) The minimum among the numbers of coins in the three sacks in the box is 1.

ii) The median of the numbers of coins in the three sacks is 1.

iii) The maximum among the numbers of coins in the three sacks in the box is 9.

There are nine boxes arranged in a $3\times3$ array as shown in Tables 1 and 2. Each box contains three sacks. Each sack has a certain number of coins, between 1 and 9, both inclusive.

The average number of coins per sack in the boxes are all distinct integers. The total number of coins in each row is the same. The total number of coins in each column is also the same.

Table 1 gives information regarding the median of the numbers of coins in the three sacks in a box for some of the boxes. In Table 2 each box has a number which represents the number of sacks in that box having more than 5 coins. That number is followed by a, if the sacks in that box satisfy exactly one among the following three conditions, and it is followed by. if two or more of these conditions are satisfied.

i) The minimum among the numbers of coins in the three sacks in the box is 1.

ii) The median of the numbers of coins in the three sacks is 1.

iii) The maximum among the numbers of coins in the three sacks in the box is 9.

There are nine boxes arranged in a $3\times3$ array as shown in Tables 1 and 2. Each box contains three sacks. Each sack has a certain number of coins, between 1 and 9, both inclusive.

The average number of coins per sack in the boxes are all distinct integers. The total number of coins in each row is the same. The total number of coins in each column is also the same.

Table 1 gives information regarding the median of the numbers of coins in the three sacks in a box for some of the boxes. In Table 2 each box has a number which represents the number of sacks in that box having more than 5 coins. That number is followed by a, if the sacks in that box satisfy exactly one among the following three conditions, and it is followed by. if two or more of these conditions are satisfied.

i) The minimum among the numbers of coins in the three sacks in the box is 1.

ii) The median of the numbers of coins in the three sacks is 1.

iii) The maximum among the numbers of coins in the three sacks in the box is 9.

There are nine boxes arranged in a $3\times3$ array as shown in Tables 1 and 2. Each box contains three sacks. Each sack has a certain number of coins, between 1 and 9, both inclusive.

The average number of coins per sack in the boxes are all distinct integers. The total number of coins in each row is the same. The total number of coins in each column is also the same.

Table 1 gives information regarding the median of the numbers of coins in the three sacks in a box for some of the boxes. In Table 2 each box has a number which represents the number of sacks in that box having more than 5 coins. That number is followed by a, if the sacks in that box satisfy exactly one among the following three conditions, and it is followed by. if two or more of these conditions are satisfied.

i) The minimum among the numbers of coins in the three sacks in the box is 1.

ii) The median of the numbers of coins in the three sacks is 1.

iii) The maximum among the numbers of coins in the three sacks in the box is 9.

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.

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 $\times$ (road adjacency value) + 3 $\times$ (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.

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.

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 $\times$ (road adjacency value) + 3 $\times$ (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.

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.

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 $\times$ (road adjacency value) + 3 $\times$ (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.

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.

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 $\times$ (road adjacency value) + 3 $\times$ (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.

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.

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 $\times$ (road adjacency value) + 3 $\times$ (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.

Sixteen patients in a hospital must undergo a blood test for a disease. It is known that exactly one of them has the disease. The hospital has only eight testing kits and has decided to pool blood samples of patients into eight vials for the tests. The patients are numbered $1$ through $16$, and the vials are labelled A, B, C, D, E, F, G, and H. The following table shows the vials into which each patient's blood sample is distributed.

If a patient has the disease, then each vial containing his/her blood sample will test positive. If a vial tests positive, one of the patients whose blood samples were mixed in the vial has the disease. If a vial tests negative, then none of the patients whose blood samples were mixed in the vial has the disease.

Sixteen patients in a hospital must undergo a blood test for a disease. It is known that exactly one of them has the disease. The hospital has only eight testing kits and has decided to pool blood samples of patients into eight vials for the tests. The patients are numbered $1$ through $16$, and the vials are labelled A, B, C, D, E, F, G, and H. The following table shows the vials into which each patient's blood sample is distributed.

If a patient has the disease, then each vial containing his/her blood sample will test positive. If a vial tests positive, one of the patients whose blood samples were mixed in the vial has the disease. If a vial tests negative, then none of the patients whose blood samples were mixed in the vial has the disease.

Sixteen patients in a hospital must undergo a blood test for a disease. It is known that exactly one of them has the disease. The hospital has only eight testing kits and has decided to pool blood samples of patients into eight vials for the tests. The patients are numbered $1$ through $16$, and the vials are labelled A, B, C, D, E, F, G, and H. The following table shows the vials into which each patient's blood sample is distributed.

If a patient has the disease, then each vial containing his/her blood sample will test positive. If a vial tests positive, one of the patients whose blood samples were mixed in the vial has the disease. If a vial tests negative, then none of the patients whose blood samples were mixed in the vial has the disease.