CAT 2020 Slot 2 DILR Q2
- Data Interpretation and Logical Reasoning
- Logical Reasoning › Grids
- Hard
- Type in the answer (TITA)
- CAT_2020_SLOT2_DILR_Q02
Data set · questions 1–4
Twenty five coloured beads are to be arranged in a grid comprising of five rows and five columns. Each cell in the grid must contain exactly one bead. Each bead is coloured either Red, Blue or Green.
While arranging the beads along any of the five rows or along any of the five columns, the rules given below are to be followed:
- Two adjacent beads along the same row or column are always of different colours.
- There is at least one Green bead between any two Blue beads along the same row or column.
- There is at least one Blue and at least one Green bead between any two Red beads along the same row or column.
Every unique, complete arrangement of twenty five beads is called a configuration.
Question 2
What is the maximum possible number of Red beads that can appear in any configuration?
Type-in-the-answer (TITA) question: no options are given; enter the value.
Show answer and solution
Answer:
9
Solution
Concept: Maximum Independent Spanning, Capacity Upper Bounding & Symmetrical Diagonal Packing
Master State Table
| Color / Constraint | Rule Specification | Min. Separation | Max. per Line (5 cells) | Line Invariants |
|---|---|---|---|---|
| Adjacency (Rule 1) | Adjacent cells in row/col have distinct colors | — | No identical adjacent colors () | |
| Blue Beads () | Rule 2: Green bead between any two | 3 (----) | beads cannot repeat without an intervening | |
| Red Beads () | Rule 3: Blue and Green between two | 2 (indices in ) | Never per line; index 3 implies line max 1 | |
| Green Beads () | Unconstrained beyond Rule 1 adjacency | 3 (----) | Universal buffer separating and beads |
Question Deduction
• Single-Line Upper Bound for Red Beads:
• Rule 3 requires Blue and Green between any two Reds, enforcing index separation .
• Placing 3 Reds requires span . Thus, no row or column can contain Reds, bounding the grid sum by .
• Impossibility of 10 Red Beads via Column Invariance:
• Achieving 10 Reds requires every row and column to contain exactly 2 Reds.
• With separation , allowable 2-Red pairs are strictly , , and .
• Index 3 cannot pair with any valid index (as ). Thus, Column 3 contains 0 Reds in any row with 2 Reds.
• If all 5 rows had 2 Reds, Column 3 would contain 0 Reds, capping the column sum at . Thus, at most 9 Reds can appear.
• Constructive Proof of Feasibility for 9 Red Beads:
• An explicit valid configuration with exactly 9 Reds places 2 Reds in Rows 1, 2, 4, 5 and 1 Red at center cell :
• Rows 1, 4: $R$–$B$–$G$–$R$–$B$ (2 Reds at cols 1, 4 each)
• Rows 2, 5: $G$–$R$–$B$–$G$–$R$ (2 Reds at cols 2, 5 each)
• Row 3: $B$–$G$–$R$–$B$–$G$ (1 Red at col 3)
• Column checks confirm Columns 1, 4 have 2 Reds each, Columns 2, 5 have 2 Reds each, and Column 3 has 1 Red. All constraints hold, confirming 9 Reds is achievable.
• Numerical Answer:
• The maximum possible number of Red beads that can appear in any configuration is 9.
Topper Take
• Single-line capacity is capped at 2 Reds (separation ). Central cell 3 cannot pair with another Red, so Column 3 has 0 Reds if all rows have 2 Reds, capping the grid sum at .
• Placing 2 Reds in 4 rows and 1 Red at center cell achieves the optimal maximum of seamlessly.
Other questions in this set
- Q1. The total number of possible configurations using beads of only two colors is:
- Q3. What is the minimum number of Blue beads in any configuration?
- Q4. Two Red beads have been placed in 'second row, third column' and 'third row, second column'. How many more Red beads…
Grids questions from other CAT papers
- CAT 2025 Slot 2 DILR Q6
- CAT 2025 Slot 2 DILR Q7
- CAT 2025 Slot 2 DILR Q8
- CAT 2025 Slot 2 DILR Q9
- CAT 2025 Slot 3 DILR Q10
Practise this question with timing, notes and your mistake notebook.
Practise in PrepSoc