WhatsAppJoin our WhatsApp Community

Year

CAT 2023

Section

Data

Topic

Network Flow Diagrams

Difficulty

Hard

Question

Slot-2

Read the passage and answer the questions below.

Passage:

There are nine boxes arranged in a 3×3 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.

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

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

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

Question 1

What is the total number of coins in all the boxes in the 3rd row?

36

30

45

15

Question 2

How many boxes have at least one sack containing 9 coins?

3

5

4

8

Question 3

For how many boxes are the average and median of the numbers of coins contained in the three sacks in that box the same?

Question 4

How many sacks have exactly one coin?

Question 5

In how many boxes do all three sacks contain different numbers of coins?

Build Interview Confidence in Days!

Structured mock interviews with real-time feedback help you identify strengths and improve weak areas quickly.

Explore Interview Platform

Loading...

logo
optima learn

Optima Learn — Powered by Optimum Eduteck Pvt. Ltd. Built by learners from FMS Delhi, DTU, and Microsoft. contact@optimalearn.com

Connect with us

LinkedInInstagram

© 2026 Optima. All rights reserved.