CAT 2020 Slot 2 DILR Q3
- Data Interpretation and Logical Reasoning
- Logical Reasoning › Grids
- Hard
- Type in the answer (TITA)
- CAT_2020_SLOT2_DILR_Q03
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 3
What is the minimum number of Blue beads in any configuration?
Type-in-the-answer (TITA) question: no options are given; enter the value.
Show answer and solution
Answer:
6
Solution
Concept: Line Pigeonhole Bounding, Boundary Cell Constraints & Global Minimum Optimization
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
• Mandatory Presence of Blue in Every Row and Column:
• A line with 0 Blues contains only Red and Green. Rule 3 permits Red (requiring Blue between Reds). With Red in 5 cells, the remaining cells must be Green, forcing adjacent duplicate beads (violating Rule 1).
• Thus, every row and column requires Blue bead, establishing a baseline lower bound of .
• Impossibility of 5 Blue Beads via Boundary Exclusion:
• If , every row and column has exactly 1 Blue bead.
• In a row with 1 Blue, placing Blue at boundary index 1 leaves 4 cells for Red and Green, allowing Red and forcing Greens in 4 cells. This forces adjacent Greens (violating Rule 1). Symmetrically, index 5 also forces adjacent Greens. Thus, a row with 1 Blue must place it at interior indices .
• Columns 1 and 5 must each contain a Blue bead. Placing Blue in Column 1 forces that row to contain Blues, pushing the grid total to .
• Thus, 5 Blue beads is impossible, establishing that .
• Constructive Proof of Feasibility for 6 Blue Beads:
• An explicit valid configuration with exactly 6 Blues is:
• Rows 1, 5: $R$–$B$–$G$–$R$–$G$ and $G$–$B$–$G$–$R$–$G$ (1 Blue at col 2 each)
• Row 2: $B$–$G$–$R$–$G$–$B$ (2 Blues at cols 1, 5)
• Rows 3, 4: $G$–$R$–$G$–$B$–$G$ (1 Blue at col 4) and $R$–$G$–$B$–$G$–$R$ (1 Blue at col 3)
• Column checks verify 2 Blues in Col 2 and 1 Blue in Cols 1, 3, 4, 5. All constraints hold, confirming 6 Blue beads.
• Numerical Answer:
• The minimum number of Blue beads in any configuration is 6.
Topper Take
• Every line requires Blue bead to prevent adjacent Green overcrowding.
• A single Blue bead cannot occupy an outer edge (index 1 or 5), forcing boundary columns to demand multiple-Blue rows and raising the minimum from 5 to 6.
Other questions in this set
- Q1. The total number of possible configurations using beads of only two colors is:
- Q2. What is the maximum possible number of Red beads that can appear 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