Free CAT library

CAT Miscellaneous LR: Concepts and Formulas

3 concepts for CAT Miscellaneous LR (DILR), from basics to CAT-level shortcuts.

  1. Concepts & Solved Examples
    Master non-standard reasoning paradigms in CAT DILR: abstract binary operations and Cayley tables (identity, inverses, Latin square property), tri-state Boolean epistemic models (Truth-tellers,…
  2. Practice Exercise 1 (48 Questions)
    48 comprehensive practice questions across 12 diverse logical reasoning and data interpretation problem sets, featuring quantum logic routing, leader election protocols, sensor payload optimization,…
  3. Practice Exercise 2 (49 Questions)
    Practice Exercise 2 of Chapter 25 (Miscellaneous) presents 49 advanced, authentic CAT-level problem sets isomorphically re-themed into High-Dimensional Spatial Matrices and Autonomous Cyber-Defense…

Key formulas

Painted Cube Slicing & Layer Partitioning

N3=8,N2=12(n−2),N1=6(n−2)2,N0=(n−2)3,∑k=03Nk=n3N_3 = 8, \quad N_2 = 12(n-2), \quad N_1 = 6(n-2)^2, \quad N_0 = (n-2)^3, \quad \sum_{k=0}^3 N_k = n^3

For an n x n x n cube with all outer faces painted, smaller unit cubes are uniquely partitioned by their geometric location: 8 corner vertices have 3 painted faces, 12(n-2) edge interiors have 2, 6(n-2)^2 face interiors have 1, and (n-2)^3 internal core cubes have 0.
Kirchhoff Flow Conservation at Intermediate Routing Nodes

∑u:(u,v)∈Ef(u,v)=∑w:(v,w)∈Ef(v,w)∀v∈Vint,0≤f(e)≤C(e)\sum_{u: (u, v) \in E} f(u, v) = \sum_{w: (v, w) \in E} f(v, w) \quad \forall v \in V_{\text{int}}, \quad 0 \le f(e) \le C(e)

In steady-state pipeline routing networks, intermediate junction nodes cannot accumulate or generate flow. Total ingress bandwidth equals total egress bandwidth across all intermediate vertices.
Binary Operation Group Identity & Latin Square Invariant

a⊙e=e⊙a=a,a⊙a−1=e,∀r,c∈S,  ∣{c′:M[r,c′]=x}∣=1a \odot e = e \odot a = a, \quad a \odot a^{-1} = e, \quad \forall r, c \in S, \; |\{c' : M[r, c'] = x\}| = 1

In a Cayley table for an algebraic group or quasigroup, the row and column of identity element e replicate the respective headers. Every element appears exactly once in each row and column (Latin square property).
Tri-State Boolean Epistemic Invariants

v(STruth)=1,v(SLiar)=0,v(SAlt,k+1)=1−v(SAlt,k),v(S)+v(¬S)=1v(S_{\text{Truth}}) = 1, \quad v(S_{\text{Liar}}) = 0, \quad v(S_{\text{Alt}, k+1}) = 1 - v(S_{\text{Alt}, k}), \quad v(S) + v(\neg S) = 1

Truth-tellers assert only true propositions, liars assert only false propositions, and alternators strictly toggle truth values between successive statements. Direct self-denial ('I am a liar') is possible only for an alternator on an F-turn.
Periodic Pulse Dispatch Collision & Fine Spacing

Δtcollision=k⋅lcm(T1,T2),Δmin⁡=gcd⁡(T1,T2)\Delta t_{\text{collision}} = k \cdot \text{lcm}(T_1, T_2), \quad \Delta_{\min} = \gcd(T_1, T_2)

Periodic transmission streams with cycle lengths T1 and T2 collide at timestamps that are integer multiples of lcm(T1, T2). The minimum non-zero temporal gap between their pulses is given by gcd(T1, T2) via Bezout's identity.

Previous year questions

Recent CAT questions on Miscellaneous LR

  1. CAT 2025 Slot 1 DILR Q9
    What was the occupancy factor for segment D – E?
  2. CAT 2025 Slot 1 DILR Q10
    How many tickets were booked from Station A to Station E?
  3. CAT 2025 Slot 1 DILR Q11
    How many tickets were booked from Station C?
  4. CAT 2025 Slot 1 DILR Q12
    What is the difference between the number of tickets booked to Station C and the number of tickets booked to Station D?
  5. CAT 2025 Slot 1 DILR Q13
    How many tickets were booked to travel in exactly one segment?
  6. CAT 2025 Slot 1 DILR Q19
    How many taps did Clive receive for his question?
  7. CAT 2025 Slot 1 DILR Q20
    Which two people tapped an equal number of times in total?
  8. CAT 2025 Slot 1 DILR Q21
    What was Clive’s response to Ehsaan’s question?