CAT Games and Tournaments Practice Questions With Solutions

Faculty members in a management school can belong to one of four departments - Finance and Accounting (F&A), Marketing and Strategy (M&S), Operations and Quants (O&Q) and Behaviour and Human Resources (B&H). The numbers of faculty members in F&A, M&S, O&Q and B&H departments are 9, 7, 5 and 3 respectively.

Prof. Pakrasi, Prof. Qureshi, Prof. Ramaswamy and Prof. Samuel are four members of the school's faculty who were candidates for the post of the Dean of the school. Only one of the candidates was from O&Q.

Every faculty member, including the four candidates, voted for the post. In each department, all the faculty members who were not candidates voted for the same candidate. The rules for the election are listed below.

1. There cannot be more than two candidates from a single department.
2. A candidate cannot vote for himself/herself.
3. Faculty members cannot vote for a candidate from their own department.

After the election, it was observed that Prof. Pakrasi received 3 votes, Prof. Qureshi received 14 votes, Prof. Ramaswamy received 6 votes and Prof. Samuel received 1 vote. Prof. Pakrasi voted for Prof. Ramaswamy, Prof. Qureshi for Prof. Samuel, Prof. Ramaswamy for Prof. Qureshi and Prof. Samuel for Prof. Pakrasi.

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.

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.

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.

Comprehension:
A, B, C, D, E and F are the six police stations in an area, which are connected by streets as shown below. Four teams - Team 1, Team 2, Team 3 and Team 4 - patrol these streets continuously between 09:00 hrs. and 12:00 hrs. each day.

The teams need 30 minutes to cross a street connecting one police station to another. All four teams start from Station A at 09:00 hrs. and must return to Station A by 12:00 hrs. They can
also pass via Station A at any point on their journeys.
The following facts are known.
1. None of the streets has more than one team traveling along it in any direction at any point in time.
2. Teams 2 and 3 are the only ones in stations E and D respectively at 10:00 hrs.
3. Teams 1 and 3 are the only ones in station E at 10:30 hrs.
4. Teams 1 and 4 are the only ones in stations B and E respectively at 11:30 hrs.
5. Team 1 and Team 4 are the only teams that patrol the street connecting stations A and E.
6. Team 4 never passes through Stations B, D or F.