Free CAT library

Practice Exercise 2 (40 Questions)

Practice Exercise 2 of Chapter 24 (Sports Based) delivers 40 advanced, authentic CAT-level tournament and match analysis problem sets. The exercise focuses on stage races and speed constraints, recursive resource depletion and amplification, zero-day bounty payoff matrices, discrete fluid/buffer capacity routing, multi-stage tournament structures (round-robin pools and single-elimination…

Practice Exercise 2 — Advanced Sports & Tournament Analytics Theory

Advanced CAT Sports and Tournament problem sets test formal mathematical reasoning across diverse competitive and operational models. Key analytical frameworks and deduction principles include:

1. Multi-Stage Speed & Energy Endurance Models

  • Staged Speed Regimes: For piecewise constant speeds viv_i over stretches of length did_i, total time is T=∑diviT = \sum \frac{d_i}{v_i}. The overall average speed is vˉ=∑di∑divi\bar{v} = \frac{\sum d_i}{\sum \frac{d_i}{v_i}}.

  • In benchmark pacing, the feasibility of breaking a record requires testing whether the maximum permitted speed over the final stretch satisfies vk≥dkTrecord−∑i<ktiv_k \ge \frac{d_k}{T_{\text{record}} - \sum_{i < k} t_i}.

  • Harmonic & Ratio Links: When the average speed over a multi-sector prefix is an algebraic multiple of the final stretch speed (e.g., vˉ1..k−1=mvk\bar{v}_{1..k-1} = m v_k), total time simplifies directly to an algebraic function of vkv_k, making the system immediately solvable.

2. Discrete Resource Amplification & Depletion Recurrences

  • When a quantity xx undergoes alternating multiplication (amplification by factor kk) and constant subtraction (consumption/discharge of yy), the state after nn iterations follows:

    En=knx−y∑j=0n−1kj=knx−ykn−1k−1E_n = k^n x - y \sum_{j=0}^{n-1} k^j = k^n x - y \frac{k^n - 1}{k - 1}

  • For complete depletion (En=0E_n = 0), knx=ykn−1k−1k^n x = y \frac{k^n - 1}{k - 1}.

  • When k=2k = 2 and n=4n = 4, this yields 16x−15y=0  ⟹  x=1516y16x - 15y = 0 \implies x = \frac{15}{16}y.

  • By number-theoretic coprimality (gcd⁡(15,16)=1\gcd(15, 16) = 1), the minimal positive integer solution is uniquely y=16,x=15y = 16, x = 15.

3. Zero-Sum Payout & Verification Sandboxes

  • In multi-round verification games with advancing credits and conditional penalties, track cumulative cash flows Δk\Delta_k dynamically.

  • The minimum initial capital XX required to prevent deficit at any point is X=max⁡(0,−min⁡t(Balancet))X = \max(0, -\min_t(\text{Balance}_t)).

4. Round-Robin and Knockout Dual-Stage Structures

  • Round-Robin Pools: A pool of NN teams playing single round-robin conducts (N2)=N(N−1)2\binom{N}{2} = \frac{N(N-1)}{2} matches.

  • Single-Elimination Knockouts: A knockout tournament of MM teams requires exactly M−1M - 1 matches to crown a champion, played over ⌈log⁡2M⌉\lceil \log_2 M \rceil rounds.

  • Advancement Guarantees (Pigeonhole Principle):

    • In an 8-team pool with 28 matches where top 4 advance, a team with 5 wins is not guaranteed qualification, because 5 teams can tie with 5 wins each (5×5+3=285 \times 5 + 3 = 28).

    • However, 5 teams cannot achieve 6 wins each (5×6=30>285 \times 6 = 30 > 28), so 6 wins strictly guarantees qualification.

  • Maximum Wins for an Eliminated Team: Minimized bottom-team internal matches allow maximum concentration of wins among the remaining teams.

5. Knockout Tournament Brackets & Upset Dynamics

  • Standard Seeding Rule: In a 32-team bracket, Round 1 matches pair Seed ii with Seed 33−i33 - i.

  • Recursive Bracket Merging:

    • In Round 2, Winner(Match jj) plays Winner(Match 17−j17 - j).

    • In Quarterfinals, Winner(R2-kk) plays Winner(R2-(9−k)(9 - k)).

    • In Semifinals, Winner(QF-1) plays Winner(QF-4), and Winner(QF-2) plays Winner(QF-3).

  • Quadrant Confinement: A team in the top half of the bracket (e.g., Seeds 1, 4, 5, 8, 9, 12, 13, 16, etc.) can only ever meet teams from the bottom half (Seeds 2, 3, 6, 7, etc.) in the Grand Final. Teams within the same quadrant can meet only in the Semifinals or earlier.

6. Multi-Round Elimination Balloting Systems

  • Under multi-round runoff voting where the lowest candidate is eliminated each round, track delegates who switch votes.

  • Eligibility rules (e.g., at most 2 distinct candidates voted for across all rounds) dynamically constrain subsequent round voter pools when both supported candidates are eliminated.

  • Representatives of eliminated candidates re-enter the active voting pool in subsequent rounds.

7. Network Graph Distance (Turing/Erdös Metric)

  • Distance to a root entity satisfies d(X)=min⁡Y∈Neighbors(X)d(Y)+1d(X) = \min_{Y \in \text{Neighbors}(X)} d(Y) + 1.

  • Joint collaboration between node FF (with minimal distance yy) and unlinked/distant nodes instantly updates their distances to y+1y + 1.

  • System-wide average shifts translate to exact linear equations on the unknown initial distances.

8. Spatial Line-of-Sight Visibility on Elevation Grids

  • Tower AA reaches Tower BB in row/column if hA<hBh_A < h_B and max⁡i∈(A,B)hi<hA\max_{i \in (A, B)} h_i < h_A.

  • Minimum elevation elements (h=1h = 1) can never be reached by any other element.

  • Directional scans from each cell establish reachability matrices efficiently.

9. Chessboard Orthogonal & Diagonal Attack Geometry

  • An unobstructed Queen at coordinate (r,c)(r, c) on an 8×88 \times 8 board attacks:

    • Row: 7 squares

    • Column: 7 squares

    • Main diagonal: min⁡(8−r,8−c)+min⁡(r−1,c−1)\min(8 - r, 8 - c) + \min(r - 1, c - 1)

    • Anti-diagonal: min⁡(8−r,c−1)+min⁡(r−1,8−c)\min(8 - r, c - 1) + \min(r - 1, 8 - c)

  • Intervening pieces block line of fire beyond their positions.

10. Conservation Laws in League Standings

  • In any sports league where matches involve two teams:

    ∑all teamsWins=∑all teamsLosses=Total Decisive Matches\sum_{\text{all teams}} \text{Wins} = \sum_{\text{all teams}} \text{Losses} = \text{Total Decisive Matches}

    ∑all teamsTies=2×(Total Tied Matches)\sum_{\text{all teams}} \text{Ties} = 2 \times (\text{Total Tied Matches})

    Total Matches=∑Losses+∑Ties2\text{Total Matches} = \sum \text{Losses} + \frac{\sum \text{Ties}}{2}

  • These fundamental invariances uniquely determine missing variables X,Y,ZX, Y, Z without needing individual match scorecards.

Practice questions

Question 1 · Moderate

Directions for Questions 1 to 3

Answer the questions on the basis of the information given below:

During the annual World Solar Vehicle Challenge, prototypes undergo an endurance prologue across a specialized 6 km desert circuit partitioned into three distinct terrain stretches: Sector A (Salt Pan), Sector B (Gravel Track), and Sector C (Sand Dune Corridor).

Each of the three sectors is exactly 2 km long and must be traversed using a specific propulsion mode. The table below specifies the propulsion mode for each stretch, along with the minimum and maximum permitted cruising speeds (in km/h). The cruising speed over any given stretch is held strictly constant.

SectorLengthPropulsion ConfigurationMinimum Speed (km/h)Maximum Speed (km/h)
Sector A2 kmSolar-Cruiser Mode4060
Sector B2 kmTorque-Hybrid Buggy3050
Sector C2 kmAll-Terrain Solar Rover1020

The benchmark course record established in previous seasons for completing the entire 6 km prologue is 10 minutes.

Pilot Anshuman travels at the minimum permitted speed in Solar-Cruiser mode over Sector A and completes Sector B at the maximum permitted speed. At what speed should he cover Sector C in order to break the previous benchmark record?

  1. A

    Maximum speed for Sector C

  2. B

    Minimum speed for Sector C

  3. C

    This is not possible

  4. D

    None of these

Show answer and explanation

Answer: (C) This is not possible

Question 1 Solution:

  1. Sector A at Minimum Speed:

    • Minimum speed for Sector A = 40 km/h40\text{ km/h}.

    • Time taken:

      tA=2 km40 km/h=120 hr=3 minutest_A = \frac{2\text{ km}}{40\text{ km/h}} = \frac{1}{20}\text{ hr} = 3\text{ minutes}

  2. Sector B at Fastest Speed:

    • Maximum speed for Sector B = 50 km/h50\text{ km/h}.

    • Time taken:

      tB=2 km50 km/h=125 hr=2.4 minutest_B = \frac{2\text{ km}}{50\text{ km/h}} = \frac{1}{25}\text{ hr} = 2.4\text{ minutes}

  3. Cumulative Time for First Two Stretches:

    tA+B=3+2.4=5.4 minutest_{A+B} = 3 + 2.4 = 5.4\text{ minutes}

  4. Required Time for Sector C:

    • To break the previous record of 10 minutes10\text{ minutes}, total time must be strictly less than 10 min10\text{ min}.

    • Allowed time for Sector C:

      tC<10−5.4=4.6 minutest_C < 10 - 5.4 = 4.6\text{ minutes}

    • Required speed over Sector C (2 km2\text{ km}):

      vC>2 km4.660 hr=1204.6≈26.09 km/hv_C > \frac{2\text{ km}}{\frac{4.6}{60}\text{ hr}} = \frac{120}{4.6} \approx 26.09\text{ km/h}

  5. Feasibility Check:

    • Telemetry limits restrict the maximum speed over Sector C to 20 km/h20\text{ km/h}.

    • Since 26.09 km/h>20 km/h26.09\text{ km/h} > 20\text{ km/h}, it is impossible to break the record under these conditions.

Hence, This is not possible.

Question 2 · Moderate

Directions for Questions 1 to 3

Answer the questions on the basis of the information given below:

During the annual World Solar Vehicle Challenge, prototypes undergo an endurance prologue across a specialized 6 km desert circuit partitioned into three distinct terrain stretches: Sector A (Salt Pan), Sector B (Gravel Track), and Sector C (Sand Dune Corridor).

Each of the three sectors is exactly 2 km long and must be traversed using a specific propulsion mode. The table below specifies the propulsion mode for each stretch, along with the minimum and maximum permitted cruising speeds (in km/h). The cruising speed over any given stretch is held strictly constant.

SectorLengthPropulsion ConfigurationMinimum Speed (km/h)Maximum Speed (km/h)
Sector A2 kmSolar-Cruiser Mode4060
Sector B2 kmTorque-Hybrid Buggy3050
Sector C2 kmAll-Terrain Solar Rover1020

The benchmark course record established in previous seasons for completing the entire 6 km prologue is 10 minutes.

Pilot Hare completes the first stretch at the minimum speed and takes exactly the same time for Sector B. He takes 50% more time than the previous benchmark record to complete the entire 6 km circuit. What is Pilot Hare's cruising speed over Sector C?

  1. A

    10.9 km/h

  2. B

    13.3 km/h

  3. C

    17.1 km/h

  4. D

    None of these

Show answer and explanation

Answer: (B) 13.3 km/h

Question 2 Solution:

  1. Time for Sector A:

    • Sector A traveled at minimum speed (40 km/h40\text{ km/h}):

      tA=2 km40 km/h=3 minutest_A = \frac{2\text{ km}}{40\text{ km/h}} = 3\text{ minutes}

  2. Time for Sector B:

    • Given that he takes the same time for Sector B as Sector A:

      tB=3 minutest_B = 3\text{ minutes}

  3. Total Race Duration:

    • Total time is 50% more than the record (10 min10\text{ min}):

      ttotal=10×1.50=15 minutest_{\text{total}} = 10 \times 1.50 = 15\text{ minutes}

  4. Time and Speed for Sector C:

    • Remaining time for Sector C:

      tC=15−(tA+tB)=15−(3+3)=9 minutest_C = 15 - (t_A + t_B) = 15 - (3 + 3) = 9\text{ minutes}

    • Cruising speed over Sector C (2 km2\text{ km} in 9 minutes9\text{ minutes}):

      vC=2 km960 hr=1209=403≈13.33 km/h≈13.3 km/hv_C = \frac{2\text{ km}}{\frac{9}{60}\text{ hr}} = \frac{120}{9} = \frac{40}{3} \approx 13.33\text{ km/h} \approx 13.3\text{ km/h}

Hence, Pilot Hare's cruising speed is 13.3 km/h.

Question 3 · Moderate

Directions for Questions 1 to 3

Answer the questions on the basis of the information given below:

During the annual World Solar Vehicle Challenge, prototypes undergo an endurance prologue across a specialized 6 km desert circuit partitioned into three distinct terrain stretches: Sector A (Salt Pan), Sector B (Gravel Track), and Sector C (Sand Dune Corridor).

Each of the three sectors is exactly 2 km long and must be traversed using a specific propulsion mode. The table below specifies the propulsion mode for each stretch, along with the minimum and maximum permitted cruising speeds (in km/h). The cruising speed over any given stretch is held strictly constant.

SectorLengthPropulsion ConfigurationMinimum Speed (km/h)Maximum Speed (km/h)
Sector A2 kmSolar-Cruiser Mode4060
Sector B2 kmTorque-Hybrid Buggy3050
Sector C2 kmAll-Terrain Solar Rover1020

The benchmark course record established in previous seasons for completing the entire 6 km prologue is 10 minutes.

Pilot Tortoise completes the race at an overall average speed of 20 km/h. His average speed across the first two stretches combined is four times his speed over the last stretch. Find his speed over Sector C.

  1. A

    15 km/h

  2. B

    12 km/h

  3. C

    10 km/h

  4. D

    This is not possible

Show answer and explanation

Answer: (C) 10 km/h

Question 3 Solution:

  1. Define Variables:

    • Let the cruising speed over Sector C be x km/hx\text{ km/h}.

    • The combined length of the first two stretches (A and B) is 2+2=4 km2 + 2 = 4\text{ km}.

    • The average speed over the first two stretches is 4x km/h4x\text{ km/h}.

  2. Calculate Travel Times:

    • Time over first two stretches:

      tA+B=4 km4x km/h=1x hourst_{A+B} = \frac{4\text{ km}}{4x\text{ km/h}} = \frac{1}{x}\text{ hours}

    • Time over Sector C (2 km2\text{ km}):

      tC=2 kmx km/h=2x hourst_C = \frac{2\text{ km}}{x\text{ km/h}} = \frac{2}{x}\text{ hours}

    • Total time for the race:

      ttotal=tA+B+tC=1x+2x=3x hourst_{\text{total}} = t_{A+B} + t_C = \frac{1}{x} + \frac{2}{x} = \frac{3}{x}\text{ hours}

  3. Use Overall Average Speed:

    • Total distance = 2+2+2=6 km2 + 2 + 2 = 6\text{ km}.

    • Overall average speed = 20 km/h20\text{ km/h}:

      Total Distancettotal=63x=2x km/h\frac{\text{Total Distance}}{t_{\text{total}}} = \frac{6}{\frac{3}{x}} = 2x\text{ km/h}

    • Equating to 20 km/h20\text{ km/h}:

      2x=20  ⟹  x=10 km/h2x = 20 \implies x = 10\text{ km/h}

  4. Feasibility Check:

    • Permitted speed range for Sector C is 10 km/h10\text{ km/h} to 20 km/h20\text{ km/h}.

    • Since 10 km/h10\text{ km/h} is within this range, the speed over Sector C is valid.

Hence, the speed over Sector C is 10 km/h.

Question 4 · Moderate

Directions for Questions 4 to 6

Answer the questions on the basis of the information given below:

An autonomous solar surveillance drone, deployed during the World Solar Vehicle Challenge, departs its central operations base with an initial supercapacitor charge of xx megajoules (MJ).

Along its designated aerial transmission corridor, there are four sequential solar radiation harvesting belts located in a straight line. Every time the drone traverses one of these harvesting belts, high-efficiency solar concentrators double its currently stored onboard energy.

Immediately after passing through each harvesting belt, the drone enters a localized ground telemetry station, where it transmits telemetry data and discharges a fixed payload of yy MJ of energy into the station's energy bank.

The operational sequence unfolds as follows:

  1. The drone passes through the first harvesting belt (energy doubles from xx to 2x2x), enters the first telemetry station, and discharges yy MJ.

  2. The remaining energy doubles as it traverses the second harvesting belt, after which it enters the second station and discharges yy MJ.

  3. The remaining energy doubles as it traverses the third harvesting belt, after which it enters the third station and discharges yy MJ.

  4. The remaining energy doubles as it traverses the fourth harvesting belt, after which it enters the fourth station and discharges yy MJ.

Upon completing the discharge at the fourth telemetry station, the drone's energy is completely exhausted (0 MJ0\text{ MJ} remaining).

If the drone departs the central operations base with 30 MJ of energy (x=30x = 30), the fixed amount of energy yy discharged to each telemetry station is:

  1. A

    30 MJ

  2. B

    31 MJ

  3. C

    32 MJ

  4. D

    33 MJ

Show answer and explanation

Answer: (C) 32 MJ

Question 4 Solution:

  1. Trace Energy Levels Across the Four Stations:

    • Departing base: E0=xE_0 = x.

    • Station 1: Enters belt (2x2x), discharges yy:

      E1=2x−yE_1 = 2x - y

    • Station 2: Enters belt (2E12E_1), discharges yy:

      E2=2(2x−y)−y=4x−3yE_2 = 2(2x - y) - y = 4x - 3y

    • Station 3: Enters belt (2E22E_2), discharges yy:

      E3=2(4x−3y)−y=8x−7yE_3 = 2(4x - 3y) - y = 8x - 7y

    • Station 4: Enters belt (2E32E_3), discharges yy:

      E4=2(8x−7y)−y=16x−15yE_4 = 2(8x - 7y) - y = 16x - 15y

  2. Apply Boundary Condition:

    • Drone is left with no energy after station 4 (E4=0E_4 = 0):

      16x−15y=0  ⟹  16x=15y  ⟹  x=1516y16x - 15y = 0 \implies 16x = 15y \implies x = \frac{15}{16}y

  3. Solve for yy with x=30x = 30:

    30=1516y  ⟹  y=30×1615=2×16=32 MJ30 = \frac{15}{16}y \implies y = \frac{30 \times 16}{15} = 2 \times 16 = 32\text{ MJ}

Hence, the drone discharges 32 MJ at each station.

Question 5 · Moderate

Directions for Questions 4 to 6

Answer the questions on the basis of the information given below:

An autonomous solar surveillance drone, deployed during the World Solar Vehicle Challenge, departs its central operations base with an initial supercapacitor charge of xx megajoules (MJ).

Along its designated aerial transmission corridor, there are four sequential solar radiation harvesting belts located in a straight line. Every time the drone traverses one of these harvesting belts, high-efficiency solar concentrators double its currently stored onboard energy.

Immediately after passing through each harvesting belt, the drone enters a localized ground telemetry station, where it transmits telemetry data and discharges a fixed payload of yy MJ of energy into the station's energy bank.

The operational sequence unfolds as follows:

  1. The drone passes through the first harvesting belt (energy doubles from xx to 2x2x), enters the first telemetry station, and discharges yy MJ.

  2. The remaining energy doubles as it traverses the second harvesting belt, after which it enters the second station and discharges yy MJ.

  3. The remaining energy doubles as it traverses the third harvesting belt, after which it enters the third station and discharges yy MJ.

  4. The remaining energy doubles as it traverses the fourth harvesting belt, after which it enters the fourth station and discharges yy MJ.

Upon completing the discharge at the fourth telemetry station, the drone's energy is completely exhausted (0 MJ0\text{ MJ} remaining).

Assuming both xx and yy are positive integers, the minimum possible amount of energy (in MJ) that could be discharged at each telemetry station is:

  1. A

    0 MJ

  2. B

    15 MJ

  3. C

    16 MJ

  4. D

    Cannot be determined

Show answer and explanation

Answer: (C) 16 MJ

Question 5 Solution:

  1. Relating xx and yy:

    • From the energy recurrence equation:

      16x=15y  ⟹  x=15y1616x = 15y \implies x = \frac{15y}{16}

  2. Integrality Constraints:

    • Since xx and yy represent discrete, non-zero whole units of energy (x,y∈Z+x, y \in \mathbb{Z}^+), 16x=15y16x = 15y requires 15y15y to be divisible by 16.

    • Because gcd⁡(15,16)=1\gcd(15, 16) = 1, 16 must divide yy.

    • The smallest positive integer multiple of 16 is y=16y = 16.

Therefore, the minimum number of energy units discharged is 16 MJ.

Question 6 · Moderate

Directions for Questions 4 to 6

Answer the questions on the basis of the information given below:

An autonomous solar surveillance drone, deployed during the World Solar Vehicle Challenge, departs its central operations base with an initial supercapacitor charge of xx megajoules (MJ).

Along its designated aerial transmission corridor, there are four sequential solar radiation harvesting belts located in a straight line. Every time the drone traverses one of these harvesting belts, high-efficiency solar concentrators double its currently stored onboard energy.

Immediately after passing through each harvesting belt, the drone enters a localized ground telemetry station, where it transmits telemetry data and discharges a fixed payload of yy MJ of energy into the station's energy bank.

The operational sequence unfolds as follows:

  1. The drone passes through the first harvesting belt (energy doubles from xx to 2x2x), enters the first telemetry station, and discharges yy MJ.

  2. The remaining energy doubles as it traverses the second harvesting belt, after which it enters the second station and discharges yy MJ.

  3. The remaining energy doubles as it traverses the third harvesting belt, after which it enters the third station and discharges yy MJ.

  4. The remaining energy doubles as it traverses the fourth harvesting belt, after which it enters the fourth station and discharges yy MJ.

Upon completing the discharge at the fourth telemetry station, the drone's energy is completely exhausted (0 MJ0\text{ MJ} remaining).

Assuming both xx and yy are positive integers, the minimum amount of energy with which the drone could leave the operations base is:

  1. A

    16 MJ

  2. B

    15 MJ

  3. C

    0 MJ

  4. D

    Cannot be determined

Show answer and explanation

Answer: (B) 15 MJ

Question 6 Solution:

  1. Calculate Minimum xx:

    • From Question 5, the minimal positive integer value for yy is y=16y = 16.

    • Substituting y=16y = 16 into the formula for xx:

      x=15y16=15×1616=15 MJx = \frac{15y}{16} = \frac{15 \times 16}{16} = 15\text{ MJ}

  2. Verification:

    • Start with x=15x = 15:

      • Belt 1: 15×2=3015 \times 2 = 30; Station 1: 30−16=1430 - 16 = 14

      • Belt 2: 14×2=2814 \times 2 = 28; Station 2: 28−16=1228 - 16 = 12

      • Belt 3: 12×2=2412 \times 2 = 24; Station 3: 24−16=824 - 16 = 8

      • Belt 4: 8×2=168 \times 2 = 16; Station 4: 16−16=016 - 16 = 0

    • All intermediate amounts are strictly positive, and final amount is 0.

Hence, the minimum initial energy is 15 MJ.

Question 7 · Moderate

Directions for Questions 7 to 9

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, elite white-hat researchers participate in an automated zero-day exploit validation sandbox with an enterprise verification server.

Trials are conducted using a standard 52-vector vulnerability library comprising 13 severity tiers across four technical domains:

  • Red Team Sectors (Kernel & Hardware): Firmware Sub-domain, Hardware Sub-domain

  • Blue Team Sectors (Network & Application): Network Sub-domain, Application Sub-domain

In each validation trial:

  1. The researcher submits a randomly drawn primary exploit vector from the library, termed the Base Vector. The base severity score is equal to the face rating of the vector (Severity Score = 10 for Kernel, Root, Admin, and Shell; numerical rating 2 to 9 for other tiers).

  2. The verification server immediately pays the researcher an advance bounty equal to the base severity score in Cyber-Credits (CC).

  3. The server then deploys a countermeasures challenge vector, termed the Response Vector:

    • Same Sub-Domain: If the Response Vector belongs to the exact same sub-domain as the Base Vector, the exploit is neutralized, and the researcher must pay a remediation fee of twice the base severity score to the server (Net round outcome: −1×-1 \times base score).

    • Same Sector, Different Sub-Domain: If the Response Vector belongs to the same overarching defense sector (Red or Blue) but a different sub-domain, the exploit is partially parried; the researcher pays the server once the base severity score (Net round outcome: 00 CC).

    • Different Sector: If the Response Vector belongs to a different defense sector entirely, the enterprise defenses are completely breached; the server awards an additional payout equal to once the base severity score to the researcher (Net round outcome: +2×+2 \times base score).

Lead researcher Ghosh Babu participated in four consecutive validation trials:

  • Trial 1: Base Vector: Tier 8 of Application Sub-domain (Blue). Response Vector: Admin of Application Sub-domain (Blue).

  • Trial 2: Base Vector: Tier 10 of Hardware Sub-domain (Red). Response Vector: Tier 2 of Network Sub-domain (Blue).

  • Trial 3: Base Vector: Tier 6 of Firmware Sub-domain (Red). Response Vector: Kernel of Hardware Sub-domain (Red).

  • Trial 4: Base Vector: Tier 8 of Network Sub-domain (Blue). Response Vector: Shell of Network Sub-domain (Blue).

If Ghosh Babu had stopped testing after the trial that maximized his cumulative net gain, what would his peak gain (in CC) have been?

  1. A

    12 CC

  2. B

    20 CC

  3. C

    16 CC

  4. D

    4 CC

Show answer and explanation

Answer: (A) 12 CC

Question 7 Solution:

Let us evaluate the net payoff for each of the four trials:

  1. Trial 1:

    • Base Vector: Tier 8, Application (Blue). Advance = +8+8 CC.

    • Response: Admin, Application (Blue, exact same sub-domain).

    • Penalty: −2×8=−16-2 \times 8 = -16 CC.

    • Net outcome = +8−16=−8+8 - 16 = -8 CC.

    • Cumulative balance = −8-8 CC.

  2. Trial 2:

    • Base Vector: Tier 10, Hardware (Red). Advance = +10+10 CC.

    • Response: Tier 2, Network (Blue, different sector).

    • Server payout: +10+10 CC.

    • Net outcome = +10+10=+20+10 + 10 = +20 CC.

    • Cumulative balance = −8+20=+12-8 + 20 = \mathbf{+12} CC.

  3. Trial 3:

    • Base Vector: Tier 6, Firmware (Red). Advance = +6+6 CC.

    • Response: Kernel, Hardware (Red, same sector, different sub-domain).

    • Researcher pays base score: −6-6 CC.

    • Net outcome = +6−6=0+6 - 6 = 0 CC.

    • Cumulative balance = +12+0=+12+12 + 0 = \mathbf{+12} CC.

  4. Trial 4:

    • Base Vector: Tier 8, Network (Blue). Advance = +8+8 CC.

    • Response: Shell, Network (Blue, exact same sub-domain).

    • Penalty: −2×8=−16-2 \times 8 = -16 CC.

    • Net outcome = +8−16=−8+8 - 16 = -8 CC.

    • Cumulative balance = +12−8=+4+12 - 8 = \mathbf{+4} CC.

The peak cumulative gain achieved across the session is 12 CC (reached after Trial 2 and maintained after Trial 3).

Question 8 · Moderate

Directions for Questions 7 to 9

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, elite white-hat researchers participate in an automated zero-day exploit validation sandbox with an enterprise verification server.

Trials are conducted using a standard 52-vector vulnerability library comprising 13 severity tiers across four technical domains:

  • Red Team Sectors (Kernel & Hardware): Firmware Sub-domain, Hardware Sub-domain

  • Blue Team Sectors (Network & Application): Network Sub-domain, Application Sub-domain

In each validation trial:

  1. The researcher submits a randomly drawn primary exploit vector from the library, termed the Base Vector. The base severity score is equal to the face rating of the vector (Severity Score = 10 for Kernel, Root, Admin, and Shell; numerical rating 2 to 9 for other tiers).

  2. The verification server immediately pays the researcher an advance bounty equal to the base severity score in Cyber-Credits (CC).

  3. The server then deploys a countermeasures challenge vector, termed the Response Vector:

    • Same Sub-Domain: If the Response Vector belongs to the exact same sub-domain as the Base Vector, the exploit is neutralized, and the researcher must pay a remediation fee of twice the base severity score to the server (Net round outcome: −1×-1 \times base score).

    • Same Sector, Different Sub-Domain: If the Response Vector belongs to the same overarching defense sector (Red or Blue) but a different sub-domain, the exploit is partially parried; the researcher pays the server once the base severity score (Net round outcome: 00 CC).

    • Different Sector: If the Response Vector belongs to a different defense sector entirely, the enterprise defenses are completely breached; the server awards an additional payout equal to once the base severity score to the researcher (Net round outcome: +2×+2 \times base score).

Lead researcher Ghosh Babu participated in four consecutive validation trials:

  • Trial 1: Base Vector: Tier 8 of Application Sub-domain (Blue). Response Vector: Admin of Application Sub-domain (Blue).

  • Trial 2: Base Vector: Tier 10 of Hardware Sub-domain (Red). Response Vector: Tier 2 of Network Sub-domain (Blue).

  • Trial 3: Base Vector: Tier 6 of Firmware Sub-domain (Red). Response Vector: Kernel of Hardware Sub-domain (Red).

  • Trial 4: Base Vector: Tier 8 of Network Sub-domain (Blue). Response Vector: Shell of Network Sub-domain (Blue).

Ghosh Babu started the testing session with an initial account reserve of XX CC. At no point during the trials did his account balance dip below zero (he never had to borrow credits). What is the minimum possible value of XX?

  1. A

    16 CC

  2. B

    8 CC

  3. C

    100 CC

  4. D

    24 CC

Show answer and explanation

Answer: (B) 8 CC

Question 8 Solution:

  1. Track Intermediate Account Balances:

    • Starting balance: XX.

    • During Trial 1: He receives +8+8 CC advance (balance becomes X+8X + 8), then pays 1616 CC (balance drops to X−8X - 8).

    • During Trial 2: Balance rises from X−8X - 8 to X+12X + 12.

    • During Trial 3: Balance remains at X+12X + 12.

    • During Trial 4: Balance drops from X+12X + 12 to X+4X + 4.

  2. Minimum Balance Constraint:

    • The lowest balance reached at any point in time is X−8X - 8 (at the conclusion of Trial 1).

    • For him to never borrow money, we must have:

      X−8≥0  ⟹  X≥8 CCX - 8 \ge 0 \implies X \ge 8\text{ CC}

Hence, the minimum initial reserve required is 8 CC.

Question 9 · Moderate

Directions for Questions 7 to 9

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, elite white-hat researchers participate in an automated zero-day exploit validation sandbox with an enterprise verification server.

Trials are conducted using a standard 52-vector vulnerability library comprising 13 severity tiers across four technical domains:

  • Red Team Sectors (Kernel & Hardware): Firmware Sub-domain, Hardware Sub-domain

  • Blue Team Sectors (Network & Application): Network Sub-domain, Application Sub-domain

In each validation trial:

  1. The researcher submits a randomly drawn primary exploit vector from the library, termed the Base Vector. The base severity score is equal to the face rating of the vector (Severity Score = 10 for Kernel, Root, Admin, and Shell; numerical rating 2 to 9 for other tiers).

  2. The verification server immediately pays the researcher an advance bounty equal to the base severity score in Cyber-Credits (CC).

  3. The server then deploys a countermeasures challenge vector, termed the Response Vector:

    • Same Sub-Domain: If the Response Vector belongs to the exact same sub-domain as the Base Vector, the exploit is neutralized, and the researcher must pay a remediation fee of twice the base severity score to the server (Net round outcome: −1×-1 \times base score).

    • Same Sector, Different Sub-Domain: If the Response Vector belongs to the same overarching defense sector (Red or Blue) but a different sub-domain, the exploit is partially parried; the researcher pays the server once the base severity score (Net round outcome: 00 CC).

    • Different Sector: If the Response Vector belongs to a different defense sector entirely, the enterprise defenses are completely breached; the server awards an additional payout equal to once the base severity score to the researcher (Net round outcome: +2×+2 \times base score).

Lead researcher Ghosh Babu participated in four consecutive validation trials:

  • Trial 1: Base Vector: Tier 8 of Application Sub-domain (Blue). Response Vector: Admin of Application Sub-domain (Blue).

  • Trial 2: Base Vector: Tier 10 of Hardware Sub-domain (Red). Response Vector: Tier 2 of Network Sub-domain (Blue).

  • Trial 3: Base Vector: Tier 6 of Firmware Sub-domain (Red). Response Vector: Kernel of Hardware Sub-domain (Red).

  • Trial 4: Base Vector: Tier 8 of Network Sub-domain (Blue). Response Vector: Shell of Network Sub-domain (Blue).

If Ghosh Babu's final balance after completing all four trials was 100 CC, what was his initial reserve balance prior to the start of the session?

  1. A

    120 CC

  2. B

    8 CC

  3. C

    4 CC

  4. D

    96 CC

Show answer and explanation

Answer: (D) 96 CC

Question 9 Solution:

  1. Net Change Over All Four Trials:

    • Net change Δ=(−8)+(+20)+(0)+(−8)=+4 CC\Delta = (-8) + (+20) + (0) + (-8) = +4\text{ CC}.
  2. Calculate Initial Amount:

    • Final Balance = Initial Balance+Δ\text{Initial Balance} + \Delta

    100=X+4  ⟹  X=96 CC100 = X + 4 \implies X = 96\text{ CC}

Hence, Ghosh Babu began the session with 96 CC.

Question 10 · Moderate

Directions for Questions 10 and 11

Answer the questions on the basis of the information given below:

An automated thermal management module on an endurance prototype in the World Solar Vehicle Challenge monitors three connected cryogenic coolant reservoirs: Tank Alpha (A), Tank Beta (B), and Tank Gamma (C), with volumetric capacities of 5 L, 3 L, and 2 L respectively.

The automated transfer system is controlled by deterministic telemetry instructions from an onboard controller:

Instruction TypeOperational Telemetry Protocol
FILL(X, Y)Fill reservoir labelled X from the coolant in reservoir labelled Y until X is completely full, where the remaining capacity of X is less than or equal to the amount of coolant available in Y.
EMPTY(X, Y)Empty out all the coolant in reservoir labelled X into reservoir labelled Y, where the amount of coolant in X is less than or equal to the remaining unfilled capacity of Y.
PURGE(X)Drain and purge out all the coolant contained in reservoir labelled X to the external thermal radiator.

Initially, Tank A is completely full (5 L) with coolant, while Tank B and Tank C are completely empty (0 L).

After executing a sequence of three instructions, Tank A contains exactly 1 L of coolant. The first and third instructions in this sequence are:

  • First instruction: FILL(C, A)

  • Third instruction: FILL(C, A)

Which of the following statements about the instructions is necessarily true?

  1. A

    The second instruction is FILL(B, A)

  2. B

    The second instruction is EMPTY(C, B)

  3. C

    The second instruction transfers coolant from B to C

  4. D

    The second instruction involves using coolant from Tank A

Show answer and explanation

Answer: (B) The second instruction is EMPTY(C, B)

Question 10 Solution:

  1. Initial State:

    A=5 L,B=0 L,C=0 LA = 5\text{ L}, \quad B = 0\text{ L}, \quad C = 0\text{ L}

  2. Execution of First Instruction: FILL(C, A):

    • Tank C has a total capacity of 2 L. It is filled to capacity from Tank A.

    • State after Instruction 1:

      A=3 L,B=0 L,C=2 LA = 3\text{ L}, \quad B = 0\text{ L}, \quad C = 2\text{ L}

  3. Requirement for Third Instruction: FILL(C, A):

    • At the end of the 3-instruction sequence, Tank A contains 1 L1\text{ L}.

    • Since Tank A entered Instruction 3 with 3 L3\text{ L} (assuming A was not modified in step 2) and finishes with 1 L1\text{ L}, exactly 2 L2\text{ L} must have been transferred from A to C during Instruction 3.

    • For FILL(C, A) to transfer 2 L2\text{ L} into Tank C, Tank C's remaining capacity must have been 2 L2\text{ L} immediately before Instruction 3.

    • This means Tank C was completely empty (0 L0\text{ L}) when Instruction 3 was executed!

  4. Deducing the Second Instruction:

    • Tank C had 2 L2\text{ L} after Instruction 1 and must have 0 L0\text{ L} before Instruction 3.

    • Therefore, the second instruction must remove the 2 L2\text{ L} from Tank C.

    • If PURGE(C) were used, it would discard coolant, but looking at the options:

      • EMPTY(C, B): Tank B has capacity 3 L and currently holds 0 L. The 2 L in C can be completely emptied into B since 2≤32 \le 3.

      • After EMPTY(C, B): A=3 L,B=2 L,C=0 LA = 3\text{ L}, B = 2\text{ L}, C = 0\text{ L}.

      • Then Instruction 3 FILL(C, A) transfers 2 L from A to C, leaving A=1 L,B=2 L,C=2 LA = 1\text{ L}, B = 2\text{ L}, C = 2\text{ L}.

    • Any instruction that uses water from A in step 2 would leave A with too little coolant to execute FILL(C, A) in step 3.

Therefore, the second instruction is strictly EMPTY(C, B).

Question 11 · Moderate

Directions for Questions 10 and 11

Answer the questions on the basis of the information given below:

An automated thermal management module on an endurance prototype in the World Solar Vehicle Challenge monitors three connected cryogenic coolant reservoirs: Tank Alpha (A), Tank Beta (B), and Tank Gamma (C), with volumetric capacities of 5 L, 3 L, and 2 L respectively.

The automated transfer system is controlled by deterministic telemetry instructions from an onboard controller:

Instruction TypeOperational Telemetry Protocol
FILL(X, Y)Fill reservoir labelled X from the coolant in reservoir labelled Y until X is completely full, where the remaining capacity of X is less than or equal to the amount of coolant available in Y.
EMPTY(X, Y)Empty out all the coolant in reservoir labelled X into reservoir labelled Y, where the amount of coolant in X is less than or equal to the remaining unfilled capacity of Y.
PURGE(X)Drain and purge out all the coolant contained in reservoir labelled X to the external thermal radiator.

Initially, Tank A is completely full (5 L) with coolant, while Tank B and Tank C are completely empty (0 L).

Consider the same initial state and the same sequence of three instructions. Three additional instructions are added at the end of the sequence so that Tank A eventually contains 4 L of coolant. In this total sequence of six instructions, the fourth instruction is PURGE(A). This is the only PURGE instruction in the entire sequence. At the end of the execution of the six instructions, how much coolant is contained in Tank C?

  1. A

    1 L

  2. B

    2 L

  3. C

    0 L

  4. D

    None of these

Show answer and explanation

Answer: (C) 0 L

Question 11 Solution:

  1. State After the First Three Instructions:

    • From Question 10, after the third instruction:

      A=1 L,B=2 L,C=2 LA = 1\text{ L}, \quad B = 2\text{ L}, \quad C = 2\text{ L}

    • Total coolant in the system = 1+2+2=5 L1 + 2 + 2 = 5\text{ L}.

  2. Effect of the Fourth Instruction: PURGE(A):

    • Tank A is completely drained, discarding its 1 L1\text{ L} of coolant.

    • State after Instruction 4:

      A=0 L,B=2 L,C=2 LA = 0\text{ L}, \quad B = 2\text{ L}, \quad C = 2\text{ L}

    • Total coolant remaining in the system = 5−1=4 L5 - 1 = 4\text{ L}.

  3. Total Coolant Invariance for Instructions 5 and 6:

    • We are given that PURGE(A) is the only PURGE instruction in the entire sequence of six instructions.

    • Because FILL and EMPTY only transfer coolant between tanks without adding or removing coolant from the system, the total amount of coolant across tanks A, B, and C remains strictly invariant at 4 L.

  4. Final State Analysis:

    • At the conclusion of the six instructions, Tank A contains 4 L4\text{ L}.

    • Since Total Coolant=A+B+C=4 L\text{Total Coolant} = A + B + C = 4\text{ L}, we must have:

      4+B+C=4  ⟹  B+C=04 + B + C = 4 \implies B + C = 0

    • Since volumetric quantities cannot be negative, B=0 LB = 0\text{ L} and C=0 LC = 0\text{ L}.

Therefore, Tank C contains 0 L of coolant.

Question 12 · Moderate

Directions for Questions 12 to 16

Answer the questions on the basis of the information given below:

Sixteen elite sovereign cyber defense consortiums are invited to participate in the prestigious Continental Cyber Shield Championship. The championship is conducted across two successive stages:

Stage 1 (Division Pool Stage):

  • The 16 consortiums are partitioned into two equal groups of eight teams: Division Alpha and Division Beta.

  • Within each division, every consortium engages every other consortium in its group exactly once in a single round-robin format.

  • Each match produces a definitive outcome (one winner and one loser; ties are prohibited). A team earns 1 point for a win and 0 points for a loss.

  • At the conclusion of Stage 1, consortiums are ranked within their division by total wins/points. The top four teams from Division Alpha and the top four teams from Division Beta advance to Stage 2, while the bottom four teams of each division are eliminated.

  • Any ties in points are resolved through deterministic tie-breaking metrics so that exactly four teams qualify from each division.

Stage 2 (Knockout Playoff Stage):

  • The eight qualifying teams enter a single-elimination tournament consisting of several knockout rounds.

  • In each round, every surviving team plays one match. The winner of each match advances to the subsequent round, while the loser is immediately eliminated.

  • The solitary undefeated team in Stage 2 is crowned the Continental Cyber Shield Champion.

What is the total number of matches played in the entire championship across both stages?

  1. A

    28

  2. B

    55

  3. C

    63

  4. D

    35

Show answer and explanation

Answer: (C) 63

Question 12 Solution:

  1. Stage 1 Matches:

    • In each division of 8 teams, every team plays every other team once:

      Matches per division=(82)=8×72=28 matches\text{Matches per division} = \binom{8}{2} = \frac{8 \times 7}{2} = 28\text{ matches}

    • Across both divisions (Alpha and Beta):

      Total Stage 1 matches=28×2=56 matches\text{Total Stage 1 matches} = 28 \times 2 = 56\text{ matches}

  2. Stage 2 Matches:

    • 8 teams enter the single-elimination knockout stage.

    • In any knockout bracket, every match eliminates exactly one team. To produce 1 champion from 8 teams, exactly 8−1=78 - 1 = 7 matches are played:

      • Quarterfinals: 4 matches (4 teams eliminated, 4 advance)

      • Semifinals: 2 matches (2 teams eliminated, 2 advance)

      • Grand Final: 1 match (1 team eliminated, 1 champion)

    • Total Stage 2 matches = 4+2+1=7 matches4 + 2 + 1 = 7\text{ matches}.

  3. Total Championship Matches:

    Total Matches=56+7=63 matches\text{Total Matches} = 56 + 7 = 63\text{ matches}

Hence, the total number of matches played is 63.

Question 13 · Moderate

Directions for Questions 12 to 16

Answer the questions on the basis of the information given below:

Sixteen elite sovereign cyber defense consortiums are invited to participate in the prestigious Continental Cyber Shield Championship. The championship is conducted across two successive stages:

Stage 1 (Division Pool Stage):

  • The 16 consortiums are partitioned into two equal groups of eight teams: Division Alpha and Division Beta.

  • Within each division, every consortium engages every other consortium in its group exactly once in a single round-robin format.

  • Each match produces a definitive outcome (one winner and one loser; ties are prohibited). A team earns 1 point for a win and 0 points for a loss.

  • At the conclusion of Stage 1, consortiums are ranked within their division by total wins/points. The top four teams from Division Alpha and the top four teams from Division Beta advance to Stage 2, while the bottom four teams of each division are eliminated.

  • Any ties in points are resolved through deterministic tie-breaking metrics so that exactly four teams qualify from each division.

Stage 2 (Knockout Playoff Stage):

  • The eight qualifying teams enter a single-elimination tournament consisting of several knockout rounds.

  • In each round, every surviving team plays one match. The winner of each match advances to the subsequent round, while the loser is immediately eliminated.

  • The solitary undefeated team in Stage 2 is crowned the Continental Cyber Shield Champion.

What is the minimum number of wins needed for a team in Stage 1 to strictly guarantee advancement to Stage 2, regardless of how other matches turn out?

  1. A

    5

  2. B

    6

  3. C

    7

  4. D

    4

Show answer and explanation

Answer: (B) 6

Question 13 Solution:

  1. Tournament Parameters:

    • 8 teams per group, each playing 7 matches.

    • Total matches per division = 28.

    • Top 4 teams qualify.

  2. Testing 5 Wins:

    • Can 5 teams finish with 5 wins each?

    • Consider the scenario where the bottom 3 teams lose all their matches against the top 5 teams (3×5=153 \times 5 = 15 wins for the top 5 teams).

    • The bottom 3 teams play (32)=3\binom{3}{2} = 3 matches among themselves.

    • The remaining 10 matches are played among the top 5 teams. In a round-robin among 5 teams ((52)=10\binom{5}{2} = 10 matches), each team can win exactly 2 matches.

    • Thus, each of the top 5 teams finishes with 3+2=53 + 2 = 5 wins.

    • Total wins accounted for: 5×5+3=285 \times 5 + 3 = 28 wins.

    • In this situation, 5 teams tie with 5 wins, and one of them is eliminated on tiebreaks.

    • Therefore, 5 wins does not guarantee qualification.

  3. Testing 6 Wins:

    • For a team with 6 wins to be eliminated, at least 4 other teams must also achieve ≥6\ge 6 wins (meaning at least 5 teams with ≥6\ge 6 wins).

    • But 5 teams with at least 6 wins would require at least 5×6=305 \times 6 = 30 wins.

    • Since there are only 28 total matches/wins in the group, it is mathematically impossible for 5 teams to have 6 wins each.

    • At most 4 teams can ever have 6 or more wins.

Thus, 6 wins strictly guarantees advancement to Stage 2.

Question 14 · Moderate

Directions for Questions 12 to 16

Answer the questions on the basis of the information given below:

Sixteen elite sovereign cyber defense consortiums are invited to participate in the prestigious Continental Cyber Shield Championship. The championship is conducted across two successive stages:

Stage 1 (Division Pool Stage):

  • The 16 consortiums are partitioned into two equal groups of eight teams: Division Alpha and Division Beta.

  • Within each division, every consortium engages every other consortium in its group exactly once in a single round-robin format.

  • Each match produces a definitive outcome (one winner and one loser; ties are prohibited). A team earns 1 point for a win and 0 points for a loss.

  • At the conclusion of Stage 1, consortiums are ranked within their division by total wins/points. The top four teams from Division Alpha and the top four teams from Division Beta advance to Stage 2, while the bottom four teams of each division are eliminated.

  • Any ties in points are resolved through deterministic tie-breaking metrics so that exactly four teams qualify from each division.

Stage 2 (Knockout Playoff Stage):

  • The eight qualifying teams enter a single-elimination tournament consisting of several knockout rounds.

  • In each round, every surviving team plays one match. The winner of each match advances to the subsequent round, while the loser is immediately eliminated.

  • The solitary undefeated team in Stage 2 is crowned the Continental Cyber Shield Champion.

What is the highest number of wins a team in Stage 1 could achieve and yet still be eliminated at the end of the first stage on tiebreaks?

  1. A

    3

  2. B

    4

  3. C

    5

  4. D

    6

Show answer and explanation

Answer: (C) 5

Question 14 Solution:

  1. Objective:

    • To maximize the number of wins of a team finishing in 5th place (and thus being eliminated), we must minimize the wins earned by the bottom 3 teams.
  2. Minimizing Bottom 3 Teams:

    • The bottom 3 teams play (32)=3\binom{3}{2} = 3 matches among themselves, producing at least 3 wins.

    • If the bottom 3 teams lose every single match against the top 5 teams, the remaining wins available to the top 5 teams are:

      28−3=25 wins28 - 3 = 25\text{ wins}

  3. Distributing Among Top 5 Teams:

    • To maximize the wins of the 5th-ranked team, we distribute these 25 wins as equally as possible among the top 5 teams:

      255=5 wins each\frac{25}{5} = 5\text{ wins each}

    • In this scenario, all top 5 teams finish with 5 wins and 2 losses.

    • On the application of tiebreak criteria, exactly one of these five teams is ranked 5th and eliminated from the championship.

Hence, the highest number of wins for an eliminated team is 5.

Question 15 · Moderate

Directions for Questions 12 to 16

Answer the questions on the basis of the information given below:

Sixteen elite sovereign cyber defense consortiums are invited to participate in the prestigious Continental Cyber Shield Championship. The championship is conducted across two successive stages:

Stage 1 (Division Pool Stage):

  • The 16 consortiums are partitioned into two equal groups of eight teams: Division Alpha and Division Beta.

  • Within each division, every consortium engages every other consortium in its group exactly once in a single round-robin format.

  • Each match produces a definitive outcome (one winner and one loser; ties are prohibited). A team earns 1 point for a win and 0 points for a loss.

  • At the conclusion of Stage 1, consortiums are ranked within their division by total wins/points. The top four teams from Division Alpha and the top four teams from Division Beta advance to Stage 2, while the bottom four teams of each division are eliminated.

  • Any ties in points are resolved through deterministic tie-breaking metrics so that exactly four teams qualify from each division.

Stage 2 (Knockout Playoff Stage):

  • The eight qualifying teams enter a single-elimination tournament consisting of several knockout rounds.

  • In each round, every surviving team plays one match. The winner of each match advances to the subsequent round, while the loser is immediately eliminated.

  • The solitary undefeated team in Stage 2 is crowned the Continental Cyber Shield Champion.

What is the total number of rounds in the second stage (knockout playoffs) of the championship?

  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

Show answer and explanation

Answer: (C) 3

Question 15 Solution:

  1. Exactly 8 teams qualify for Stage 2.

  2. In a single-elimination tournament with N=8N = 8 teams:

    • Round 1 (Quarterfinals): 8 teams compete in 4 matches   ⟹  4\implies 4 winners advance.

    • Round 2 (Semifinals): 4 teams compete in 2 matches   ⟹  2\implies 2 winners advance.

    • Round 3 (Grand Final): 2 teams compete in 1 match   ⟹  1\implies 1 champion emerges.

  3. Total number of rounds = log⁡2(8)=3\log_2(8) = 3.

Hence, there are 3 rounds in Stage 2.

Question 16 · CAT Level

Directions for Questions 12 to 16

Answer the questions on the basis of the information given below:

Sixteen elite sovereign cyber defense consortiums are invited to participate in the prestigious Continental Cyber Shield Championship. The championship is conducted across two successive stages:

Stage 1 (Division Pool Stage):

  • The 16 consortiums are partitioned into two equal groups of eight teams: Division Alpha and Division Beta.

  • Within each division, every consortium engages every other consortium in its group exactly once in a single round-robin format.

  • Each match produces a definitive outcome (one winner and one loser; ties are prohibited). A team earns 1 point for a win and 0 points for a loss.

  • At the conclusion of Stage 1, consortiums are ranked within their division by total wins/points. The top four teams from Division Alpha and the top four teams from Division Beta advance to Stage 2, while the bottom four teams of each division are eliminated.

  • Any ties in points are resolved through deterministic tie-breaking metrics so that exactly four teams qualify from each division.

Stage 2 (Knockout Playoff Stage):

  • The eight qualifying teams enter a single-elimination tournament consisting of several knockout rounds.

  • In each round, every surviving team plays one match. The winner of each match advances to the subsequent round, while the loser is immediately eliminated.

  • The solitary undefeated team in Stage 2 is crowned the Continental Cyber Shield Champion.

Which of the following statements is necessarily true regarding the championship outcomes?

  1. A

    The championship winner will have more wins than any other team in the tournament

  2. B

    At the end of the first stage, no team eliminated from the tournament will have more wins than any of the teams qualifying for the second stage

  3. C

    It is possible that the championship winner will have the same total number of wins in the entire tournament as a team eliminated at the end of the first stage

  4. D

    The number of teams with exactly one win in the second stage of the tournament is 4

Show answer and explanation

Answer: (C) It is possible that the championship winner will have the same total number of wins in the entire tournament as a team eliminated at the end of the first stage

Question 16 Solution:

Let us evaluate each statement systematically:

  1. Statement 1 is FALSE:

    • Suppose in Division Alpha, the 4th-qualifying team advances with only 2 wins (e.g. top 3 teams win 7, 6, 5 matches; remaining 5 teams tie with 2 wins each, and one qualifies on tiebreaks).

    • In Stage 2, that team wins all 3 knockout matches (Quarterfinals, Semifinals, Final) to become champion. Their total tournament wins = 2+3=52 + 3 = 5.

    • Meanwhile, the runner-up from Division Beta who had 7 wins in Stage 1 and won 2 matches in Stage 2 finishes with 7+2=97 + 2 = 9 wins, which is greater than 5!

  2. Statement 2 is FALSE:

    • An eliminated team in Division Alpha can have 5 wins (as shown in Question 14), while a qualifying team in Division Beta could advance in 4th place with only 2 or 3 wins.
  3. Statement 3 is TRUE:

    • As shown above, a team eliminated in Stage 1 can have 5 wins.

    • The tournament champion could have qualified with 2 wins in Stage 1 and then achieved 3 wins in Stage 2, for a total of 2+3=52 + 3 = 5 wins!

    • Thus, it is entirely possible for the champion to finish with the exact same total wins as a team eliminated in Stage 1.

  4. Statement 4 is FALSE:

    • In Stage 2, 4 teams win their Quarterfinal matches and play in the Semifinals.

    • In the Semifinals, 2 teams win (advancing to the final, thus earning at least 2 wins in Stage 2) and 2 teams lose (having won exactly 1 match in Stage 2).

    • Thus, exactly 2 teams finish with exactly one win in Stage 2, not 4.

Hence, Statement 3 is the only true statement.

Question 17 · CAT Level

Directions for Questions 17 to 20

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, 32 autonomous AI cyber-defense agents, seeded from highest (#1) to lowest (#32), compete in an elite single-elimination cybersecurity tournament.

The tournament features four preliminary knockout rounds before the Grand Final: Round 1 (Round of 32), Round 2 (Round of 16), Quarterfinals, and Semifinals.

Tournament Seeding & Bracket Rules:

  • In Round 1, the highest-seeded agent plays the lowest-seeded agent (Seed #1 plays Seed #32, designated Match 1 of Round 1); Seed #2 plays Seed #31 (Match 2); and generally, in Match ii of Round 1 (i=1,…,16i = 1, \dots, 16), Seed ii plays Seed 33−i33 - i.

  • In Round 2, the winner of Match 1 of Round 1 plays the winner of Match 16 of Round 1 (designated Match 1 of Round 2). Similarly, the winner of Match 2 plays the winner of Match 15 (Match 2 of Round 2); and generally, in Match jj of Round 2 (j=1,…,8j = 1, \dots, 8), Winner(Match jj) plays Winner(Match 17−j17 - j).

  • In the Quarterfinals, Match 1 features Winner(R2-Match 1) vs Winner(R2-Match 8); Match 2 features Winner(R2-Match 2) vs Winner(R2-Match 7); Match 3 features Winner(R2-Match 3) vs Winner(R2-Match 6); and Match 4 features Winner(R2-Match 4) vs Winner(R2-Match 5).

  • In the Semifinals, Semifinal 1 features Winner(QF-Match 1) vs Winner(QF-Match 4), while Semifinal 2 features Winner(QF-Match 2) vs Winner(QF-Match 3).

  • The Grand Final is contested between Winner(Semifinal 1) and Winner(Semifinal 2).

An upset is strictly defined as a match where a lower-seeded agent (numerically higher seed number) defeats a higher-seeded agent (numerically lower seed number).

Seed #Agent CodenameSeed #Agent CodenameSeed #Agent Codename
1Aegis Prime12Cipher Bastion23Omega Shield
2Iron Sentry13Binary Ghost24Titan Vault
3Quantum Ward14Sentinel Fox25Vortex Armor
4Cyber Sentinel15Nova Barrier26Helix Guard
5Neural Citadel16Echo Defensor27Vector Wall
6Apex Fortress17Shadow Lock28Solar Aegis
7Valkyrie Core18Hyperion Gate29Zero Bastion
8Spectre Node19Krypton Grid30Prism Shell
9Phantom Wall20Paladin Vector31Chronos Ward
10Cerberus Gate21Argus Watch32Eclipse Shield
11Gorgon Aegis22Starlight Node——

If there are no upsets in Round 1, and only Match Nos. 6, 7, and 8 of Round 2 result in upsets, which agent would meet Seed #2 (Iron Sentry) in the Quarterfinals, assuming Iron Sentry reaches the Quarterfinals?

  1. A

    Valkyrie Core

  2. B

    Phantom Wall

  3. C

    Gorgon Aegis

  4. D

    Cerberus Gate

Show answer and explanation

Answer: (D) Cerberus Gate

Question 17 Solution:

  1. Locate Iron Sentry in the Tournament Bracket:

    • Iron Sentry is Seed #2, which plays in QF Match 2.

    • QF Match 2 is fed by Winner(R2-Match 2) and Winner(R2-Match 7).

    • Assuming Seed #2 reaches the Quarterfinals, it represents Winner(R2-Match 2).

    • Its opponent in QF Match 2 is Winner(R2-Match 7).

  2. Determine the Matchup in R2-Match 7:

    • R2-Match 7 is contested between Winner(R1-Match 7) and Winner(R1-Match 10).

    • In Round 1, with no upsets:

      • R1-Match 7: Seed #7 (Valkyrie Core) defeats Seed #26.

      • R1-Match 10: Seed #10 (Cerberus Gate) defeats Seed #23.

    • Thus, R2-Match 7 is contested between Seed #7 (Valkyrie Core) and Seed #10 (Cerberus Gate).

  3. Apply Round 2 Upset Condition:

    • We are explicitly told that R2-Match 7 results in an upset.

    • An upset means the lower-seeded agent (numerically higher seed number) wins.

    • Seed #10 (Cerberus Gate) is lower-seeded than Seed #7 (Valkyrie Core).

    • Therefore, Seed #10 (Cerberus Gate) defeats Seed #7 and advances to face Seed #2 in the Quarterfinals.

Hence, Iron Sentry's opponent is Cerberus Gate.

Question 18 · CAT Level

Directions for Questions 17 to 20

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, 32 autonomous AI cyber-defense agents, seeded from highest (#1) to lowest (#32), compete in an elite single-elimination cybersecurity tournament.

The tournament features four preliminary knockout rounds before the Grand Final: Round 1 (Round of 32), Round 2 (Round of 16), Quarterfinals, and Semifinals.

Tournament Seeding & Bracket Rules:

  • In Round 1, the highest-seeded agent plays the lowest-seeded agent (Seed #1 plays Seed #32, designated Match 1 of Round 1); Seed #2 plays Seed #31 (Match 2); and generally, in Match ii of Round 1 (i=1,…,16i = 1, \dots, 16), Seed ii plays Seed 33−i33 - i.

  • In Round 2, the winner of Match 1 of Round 1 plays the winner of Match 16 of Round 1 (designated Match 1 of Round 2). Similarly, the winner of Match 2 plays the winner of Match 15 (Match 2 of Round 2); and generally, in Match jj of Round 2 (j=1,…,8j = 1, \dots, 8), Winner(Match jj) plays Winner(Match 17−j17 - j).

  • In the Quarterfinals, Match 1 features Winner(R2-Match 1) vs Winner(R2-Match 8); Match 2 features Winner(R2-Match 2) vs Winner(R2-Match 7); Match 3 features Winner(R2-Match 3) vs Winner(R2-Match 6); and Match 4 features Winner(R2-Match 4) vs Winner(R2-Match 5).

  • In the Semifinals, Semifinal 1 features Winner(QF-Match 1) vs Winner(QF-Match 4), while Semifinal 2 features Winner(QF-Match 2) vs Winner(QF-Match 3).

  • The Grand Final is contested between Winner(Semifinal 1) and Winner(Semifinal 2).

An upset is strictly defined as a match where a lower-seeded agent (numerically higher seed number) defeats a higher-seeded agent (numerically lower seed number).

Seed #Agent CodenameSeed #Agent CodenameSeed #Agent Codename
1Aegis Prime12Cipher Bastion23Omega Shield
2Iron Sentry13Binary Ghost24Titan Vault
3Quantum Ward14Sentinel Fox25Vortex Armor
4Cyber Sentinel15Nova Barrier26Helix Guard
5Neural Citadel16Echo Defensor27Vector Wall
6Apex Fortress17Shadow Lock28Solar Aegis
7Valkyrie Core18Hyperion Gate29Zero Bastion
8Spectre Node19Krypton Grid30Prism Shell
9Phantom Wall20Paladin Vector31Chronos Ward
10Cerberus Gate21Argus Watch32Eclipse Shield
11Gorgon Aegis22Starlight Node——

If Seed #6 (Apex Fortress) and Seed #8 (Spectre Node) lose in Round 2, while Seed #7 (Valkyrie Core) and Seed #9 (Phantom Wall) advance to the Semifinals, who would play against Seed #1 (Aegis Prime) in the Quarterfinals, assuming Aegis Prime reaches the Quarterfinals?

  1. A

    Starlight Node

  2. B

    Valkyrie Core

  3. C

    Phantom Wall

  4. D

    Gorgon Aegis

Show answer and explanation

Answer: (C) Phantom Wall

Question 18 Solution:

  1. Locate Aegis Prime in the Tournament Bracket:

    • Aegis Prime is Seed #1, competing in QF Match 1.

    • QF Match 1 is fed by Winner(R2-Match 1) and Winner(R2-Match 8).

    • Aegis Prime represents Winner(R2-Match 1).

    • Its opponent in QF Match 1 is Winner(R2-Match 8).

  2. Examine R2-Match 8 and its Quadrant:

    • R2-Match 8 is fed by Winner(R1-Match 8) and Winner(R1-Match 9).

    • In R1-Match 8: Seed #8 (Spectre Node) plays Seed #25.

    • In R1-Match 9: Seed #9 (Phantom Wall) plays Seed #24.

    • We are given that Seed #9 (Phantom Wall) advances all the way to the Semifinals!

  3. Deduction:

    • Semifinal 1 is contested between Winner(QF-Match 1) and Winner(QF-Match 4).

    • Since Seed #9 advances to the Semifinals, it must have won R2-Match 8, played in QF Match 1, and won QF Match 1.

    • Therefore, Seed #9 (Phantom Wall) must have played against Seed #1 in QF Match 1!

Hence, the agent facing Aegis Prime in the Quarterfinals is Phantom Wall.

Question 19 · CAT Level

Directions for Questions 17 to 20

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, 32 autonomous AI cyber-defense agents, seeded from highest (#1) to lowest (#32), compete in an elite single-elimination cybersecurity tournament.

The tournament features four preliminary knockout rounds before the Grand Final: Round 1 (Round of 32), Round 2 (Round of 16), Quarterfinals, and Semifinals.

Tournament Seeding & Bracket Rules:

  • In Round 1, the highest-seeded agent plays the lowest-seeded agent (Seed #1 plays Seed #32, designated Match 1 of Round 1); Seed #2 plays Seed #31 (Match 2); and generally, in Match ii of Round 1 (i=1,…,16i = 1, \dots, 16), Seed ii plays Seed 33−i33 - i.

  • In Round 2, the winner of Match 1 of Round 1 plays the winner of Match 16 of Round 1 (designated Match 1 of Round 2). Similarly, the winner of Match 2 plays the winner of Match 15 (Match 2 of Round 2); and generally, in Match jj of Round 2 (j=1,…,8j = 1, \dots, 8), Winner(Match jj) plays Winner(Match 17−j17 - j).

  • In the Quarterfinals, Match 1 features Winner(R2-Match 1) vs Winner(R2-Match 8); Match 2 features Winner(R2-Match 2) vs Winner(R2-Match 7); Match 3 features Winner(R2-Match 3) vs Winner(R2-Match 6); and Match 4 features Winner(R2-Match 4) vs Winner(R2-Match 5).

  • In the Semifinals, Semifinal 1 features Winner(QF-Match 1) vs Winner(QF-Match 4), while Semifinal 2 features Winner(QF-Match 2) vs Winner(QF-Match 3).

  • The Grand Final is contested between Winner(Semifinal 1) and Winner(Semifinal 2).

An upset is strictly defined as a match where a lower-seeded agent (numerically higher seed number) defeats a higher-seeded agent (numerically lower seed number).

Seed #Agent CodenameSeed #Agent CodenameSeed #Agent Codename
1Aegis Prime12Cipher Bastion23Omega Shield
2Iron Sentry13Binary Ghost24Titan Vault
3Quantum Ward14Sentinel Fox25Vortex Armor
4Cyber Sentinel15Nova Barrier26Helix Guard
5Neural Citadel16Echo Defensor27Vector Wall
6Apex Fortress17Shadow Lock28Solar Aegis
7Valkyrie Core18Hyperion Gate29Zero Bastion
8Spectre Node19Krypton Grid30Prism Shell
9Phantom Wall20Paladin Vector31Chronos Ward
10Cerberus Gate21Argus Watch32Eclipse Shield
11Gorgon Aegis22Starlight Node——

If, in Round 1, all even-numbered matches (and none of the odd-numbered matches) result in upsets, and there are no upsets in Round 2, who could be the lowest-seeded agent (numerically highest seed number) facing Seed #1 (Aegis Prime) in the Semifinals?

  1. A

    Binary Ghost

  2. B

    Zero Bastion

  3. C

    Phantom Wall

  4. D

    Neural Citadel

Show answer and explanation

Answer: (A) Binary Ghost

Question 19 Solution:

  1. Semifinal 1 Structure:

    • Seed #1 (Aegis Prime) is in QF Match 1. Upon winning, it advances to Semifinal 1.

    • In Semifinal 1, Winner(QF-1) faces Winner(QF-4).

    • QF Match 4 is contested between Winner(R2-Match 4) and Winner(R2-Match 5).

  2. Trace R2-Match 4:

    • R2-Match 4 is fed by R1-Match 4 and R1-Match 13.

    • R1-Match 4 (Even   ⟹  \implies Upset): Seed #4 vs Seed #29. The lower seed wins   ⟹  \implies Seed #29 (Zero Bastion) wins!

    • R1-Match 13 (Odd   ⟹  \implies No Upset): Seed #13 vs Seed #20. Higher seed wins   ⟹  \implies Seed #13 (Binary Ghost) wins.

    • R2-Match 4: Seed #29 faces Seed #13. With no upsets in Round 2, the higher seed wins:

      Seed #13 (Binary Ghost) defeats Seed #29.

      Thus, Winner(R2-Match 4) = Seed #13 (Binary Ghost).

  3. Trace R2-Match 5:

    • R2-Match 5 is fed by R1-Match 5 and R1-Match 12.

    • R1-Match 5 (Odd   ⟹  \implies No Upset): Seed #5 vs Seed #28   ⟹  \implies Seed #5 (Neural Citadel) wins.

    • R1-Match 12 (Even   ⟹  \implies Upset): Seed #12 vs Seed #21   ⟹  \implies Seed #21 (Argus Watch) wins.

    • R2-Match 5: Seed #5 faces Seed #21. With no upsets in Round 2, Seed #5 defeats Seed #21.

      Thus, Winner(R2-Match 5) = Seed #5 (Neural Citadel).

  4. Contenders for Semifinal 1:

    • QF Match 4 is contested between Seed #13 (Binary Ghost) and Seed #5 (Neural Citadel).

    • Since no constraints restrict upsets in the Quarterfinals, either Seed #5 or Seed #13 could win QF Match 4.

    • The question asks for the lowest-seeded agent (numerically highest seed number) that could face Aegis Prime.

    • Between Seed #13 and Seed #5, the lower seed is Seed #13 (Binary Ghost).

Hence, the lowest-seeded agent is Binary Ghost.

Question 20 · CAT Level

Directions for Questions 17 to 20

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, 32 autonomous AI cyber-defense agents, seeded from highest (#1) to lowest (#32), compete in an elite single-elimination cybersecurity tournament.

The tournament features four preliminary knockout rounds before the Grand Final: Round 1 (Round of 32), Round 2 (Round of 16), Quarterfinals, and Semifinals.

Tournament Seeding & Bracket Rules:

  • In Round 1, the highest-seeded agent plays the lowest-seeded agent (Seed #1 plays Seed #32, designated Match 1 of Round 1); Seed #2 plays Seed #31 (Match 2); and generally, in Match ii of Round 1 (i=1,…,16i = 1, \dots, 16), Seed ii plays Seed 33−i33 - i.

  • In Round 2, the winner of Match 1 of Round 1 plays the winner of Match 16 of Round 1 (designated Match 1 of Round 2). Similarly, the winner of Match 2 plays the winner of Match 15 (Match 2 of Round 2); and generally, in Match jj of Round 2 (j=1,…,8j = 1, \dots, 8), Winner(Match jj) plays Winner(Match 17−j17 - j).

  • In the Quarterfinals, Match 1 features Winner(R2-Match 1) vs Winner(R2-Match 8); Match 2 features Winner(R2-Match 2) vs Winner(R2-Match 7); Match 3 features Winner(R2-Match 3) vs Winner(R2-Match 6); and Match 4 features Winner(R2-Match 4) vs Winner(R2-Match 5).

  • In the Semifinals, Semifinal 1 features Winner(QF-Match 1) vs Winner(QF-Match 4), while Semifinal 2 features Winner(QF-Match 2) vs Winner(QF-Match 3).

  • The Grand Final is contested between Winner(Semifinal 1) and Winner(Semifinal 2).

An upset is strictly defined as a match where a lower-seeded agent (numerically higher seed number) defeats a higher-seeded agent (numerically lower seed number).

Seed #Agent CodenameSeed #Agent CodenameSeed #Agent Codename
1Aegis Prime12Cipher Bastion23Omega Shield
2Iron Sentry13Binary Ghost24Titan Vault
3Quantum Ward14Sentinel Fox25Vortex Armor
4Cyber Sentinel15Nova Barrier26Helix Guard
5Neural Citadel16Echo Defensor27Vector Wall
6Apex Fortress17Shadow Lock28Solar Aegis
7Valkyrie Core18Hyperion Gate29Zero Bastion
8Spectre Node19Krypton Grid30Prism Shell
9Phantom Wall20Paladin Vector31Chronos Ward
10Cerberus Gate21Argus Watch32Eclipse Shield
11Gorgon Aegis22Starlight Node——

If the top eight seeds all successfully advance to the Quarterfinals, which of the following agents could definitely NOT play against Seed #1 (Aegis Prime) in the Grand Final, assuming Aegis Prime reaches the Grand Final?

  1. A

    Quantum Ward

  2. B

    Apex Fortress

  3. C

    Cyber Sentinel

  4. D

    Iron Sentry

Show answer and explanation

Answer: (C) Cyber Sentinel

Question 20 Solution:

  1. Quarterfinal Lineup with Top 8 Seeds:

    • QF Match 1: Seed #1 (Aegis Prime) vs Seed #8 (Spectre Node)

    • QF Match 2: Seed #2 (Iron Sentry) vs Seed #7 (Valkyrie Core)

    • QF Match 3: Seed #3 (Quantum Ward) vs Seed #6 (Apex Fortress)

    • QF Match 4: Seed #4 (Cyber Sentinel) vs Seed #5 (Neural Citadel)

  2. Semifinal Bracket Pairings:

    • Semifinal 1: Winner(QF-1) vs Winner(QF-4). Contenders: Seeds {1, 8} vs Seeds {4, 5}.

    • Semifinal 2: Winner(QF-2) vs Winner(QF-3). Contenders: Seeds {2, 7} vs Seeds {3, 6}.

  3. Grand Final Opponent Analysis:

    • The Grand Final is contested between Winner(Semifinal 1) and Winner(Semifinal 2).

    • If Seed #1 (Aegis Prime) reaches the Grand Final, it advances from Semifinal 1.

    • Therefore, Aegis Prime's opponent in the Grand Final must emerge from Semifinal 2!

    • Possible Grand Final opponents from Semifinal 2 are Seeds {2, 3, 6, 7} (Iron Sentry, Quantum Ward, Apex Fortress, Valkyrie Core).

    • Seed #4 (Cyber Sentinel) and Seed #5 (Neural Citadel) belong to Semifinal 1.

    • Consequently, Seed #4 could only ever play Seed #1 in the Semifinals, and can never meet Seed #1 in the Grand Final!

Hence, Cyber Sentinel definitely cannot play Aegis Prime in the Grand Final.

Question 21 · CAT Level

Directions for Questions 21 to 24

Answer the questions on the basis of the information given below:

In the year 2089, four candidate metropolitan hubs—Beijing, London, New York, and Paris—are in contention to host the prestigious World Solar Vehicle Challenge Proving Grounds.

The host city is chosen through several sequential rounds of secret balloting by delegates of the World Solar Council (WSC), where each delegate represents a unique global city. All four candidate cities in contention are also represented by delegates on the WSC.

Voting Rules & Regulations:

  1. In any voting round, the candidate city receiving the fewest votes in that round is eliminated. The solitary surviving city after the final round wins the right to host the event.

  2. A delegate is permitted to cast votes for at most two different candidate cities across all rounds combined. Consequently, a delegate becomes ineligible to vote in a given round if both cities they voted for in earlier rounds have already been eliminated.

  3. A delegate is also strictly ineligible to vote in any round in which the city they represent is actively in contention.

  4. As long as a delegate is eligible, they must cast exactly one vote for a candidate city in that round.

The incomplete table below summarizes the voting outcomes across the rounds:

RoundTotal Votes CastTop ContenderVotes ReceivedEliminated CityVotes Received
Round 1—London30New York12
Round 283Paris32Beijing21
Round 375————

Additional Telemetry & Delegate Behaviour:

  • All delegates who voted for London and Paris in Round 1 continued to vote for the same cities in all subsequent rounds as long as those cities remained in contention.

  • Exactly 75% of those who voted for Beijing in Round 1 voted for Beijing in Round 2 as well.

  • Those who voted for New York in Round 1 voted either for Beijing or for Paris in Round 2.

  • In Round 3 (the final round between London and Paris), the difference in votes cast between the two contending cities was exactly 1.

  • Exactly 50% of the delegates who voted for Beijing in Round 1 voted for Paris in Round 3.

What percentage of the delegates who voted for New York in Round 1 voted for Beijing in Round 2?

  1. A

    33.33%

  2. B

    50%

  3. C

    66.67%

  4. D

    75%

Show answer and explanation

Answer: (D) 75%

Question 21 Solution:

  1. Round 2 Overview:

    • Contending cities in Round 2: London (L), Paris (P), Beijing (B).

    • Total votes cast = 83.

    • P received 32 votes; B received 21 votes.

    • Therefore, London received:

      L2=83−(32+21)=30 votesL_2 = 83 - (32 + 21) = 30\text{ votes}

    • Since all 30 delegates who voted for London in Round 1 stayed with London in Round 2, no additional delegates voted for London in Round 2.

  2. Deducing Round 1 Votes for Beijing (B1B_1) and Paris (P1P_1):

    • In Round 1, the delegate representing New York was ineligible (NY in contention).

    • In Round 2, NY was eliminated, so the NY delegate became eligible.

    • Total eligible voters in Round 2 increased by 1 (the NY delegate) compared to Round 1.

    • Thus, total votes cast in Round 1 was 83−1=8283 - 1 = 82.

    • In Round 1:

      L1+P1+B1+NY1=82  ⟹  30+P1+B1+12=82  ⟹  P1+B1=40L_1 + P_1 + B_1 + NY_1 = 82 \implies 30 + P_1 + B_1 + 12 = 82 \implies P_1 + B_1 = 40

  3. Breakdown of Beijing's Round 2 Votes:

    • 75% of Round 1 Beijing voters supported Beijing again: 0.75B10.75 B_1.

    • The remaining votes for Beijing came from NY voters who switched to Beijing: let this be kk voters (out of 12).

    • Thus:

      0.75B1+k=210.75 B_1 + k = 21

    • Since B1B_1 must be a multiple of 4, test multiples of 4:

      • If B1=16B_1 = 16: 0.75(16)+k=12+k=21  ⟹  k=90.75(16) + k = 12 + k = 21 \implies k = 9.

        Then P1=40−16=24P_1 = 40 - 16 = 24.

        Let's check Paris in Round 2:

        P2=P1+(12−k)+0.25B1+1 (NY delegate)=24+(12−9)+4+1=24+3+4+1=32 votesP_2 = P_1 + (12 - k) + 0.25 B_1 + 1\text{ (NY delegate)} = 24 + (12 - 9) + 4 + 1 = 24 + 3 + 4 + 1 = 32\text{ votes}

        This matches P2=32P_2 = 32 perfectly!

      • If B1=20B_1 = 20: 0.75(20)+k=15+k=21  ⟹  k=60.75(20) + k = 15 + k = 21 \implies k = 6.

        Then P1=20P_1 = 20.

        P2=20+(12−6)+5+1=32P_2 = 20 + (12 - 6) + 5 + 1 = 32. But then in Round 3, 50% of B1B_1 is 10, which violates Round 3 constraints (difference of 1 between L and P).

    • Thus, uniquely: B1=16B_1 = 16 and k=9k = 9.

  4. Calculate Required Percentage:

    • 9 out of the 12 delegates who voted for NY in Round 1 voted for Beijing in Round 2:

      912×100%=75%\frac{9}{12} \times 100\% = 75\%

Hence, the answer is 75%.

Question 22 · CAT Level

Directions for Questions 21 to 24

Answer the questions on the basis of the information given below:

In the year 2089, four candidate metropolitan hubs—Beijing, London, New York, and Paris—are in contention to host the prestigious World Solar Vehicle Challenge Proving Grounds.

The host city is chosen through several sequential rounds of secret balloting by delegates of the World Solar Council (WSC), where each delegate represents a unique global city. All four candidate cities in contention are also represented by delegates on the WSC.

Voting Rules & Regulations:

  1. In any voting round, the candidate city receiving the fewest votes in that round is eliminated. The solitary surviving city after the final round wins the right to host the event.

  2. A delegate is permitted to cast votes for at most two different candidate cities across all rounds combined. Consequently, a delegate becomes ineligible to vote in a given round if both cities they voted for in earlier rounds have already been eliminated.

  3. A delegate is also strictly ineligible to vote in any round in which the city they represent is actively in contention.

  4. As long as a delegate is eligible, they must cast exactly one vote for a candidate city in that round.

The incomplete table below summarizes the voting outcomes across the rounds:

RoundTotal Votes CastTop ContenderVotes ReceivedEliminated CityVotes Received
Round 1—London30New York12
Round 283Paris32Beijing21
Round 375————

Additional Telemetry & Delegate Behaviour:

  • All delegates who voted for London and Paris in Round 1 continued to vote for the same cities in all subsequent rounds as long as those cities remained in contention.

  • Exactly 75% of those who voted for Beijing in Round 1 voted for Beijing in Round 2 as well.

  • Those who voted for New York in Round 1 voted either for Beijing or for Paris in Round 2.

  • In Round 3 (the final round between London and Paris), the difference in votes cast between the two contending cities was exactly 1.

  • Exactly 50% of the delegates who voted for Beijing in Round 1 voted for Paris in Round 3.

What was the exact number of votes cast for Paris in Round 1?

  1. A

    16

  2. B

    18

  3. C

    22

  4. D

    24

Show answer and explanation

Answer: (D) 24

Question 22 Solution:

  1. From the deduction in Question 21:

    • Total votes in Round 1 = 82.

    • L1=30L_1 = 30

    • NY1=12NY_1 = 12

    • B1=16B_1 = 16

  2. Calculate P1P_1:

    P1=82−(30+12+16)=82−58=24 votesP_1 = 82 - (30 + 12 + 16) = 82 - 58 = 24\text{ votes}

Hence, Paris received 24 votes in Round 1.

Question 23 · CAT Level

Directions for Questions 21 to 24

Answer the questions on the basis of the information given below:

In the year 2089, four candidate metropolitan hubs—Beijing, London, New York, and Paris—are in contention to host the prestigious World Solar Vehicle Challenge Proving Grounds.

The host city is chosen through several sequential rounds of secret balloting by delegates of the World Solar Council (WSC), where each delegate represents a unique global city. All four candidate cities in contention are also represented by delegates on the WSC.

Voting Rules & Regulations:

  1. In any voting round, the candidate city receiving the fewest votes in that round is eliminated. The solitary surviving city after the final round wins the right to host the event.

  2. A delegate is permitted to cast votes for at most two different candidate cities across all rounds combined. Consequently, a delegate becomes ineligible to vote in a given round if both cities they voted for in earlier rounds have already been eliminated.

  3. A delegate is also strictly ineligible to vote in any round in which the city they represent is actively in contention.

  4. As long as a delegate is eligible, they must cast exactly one vote for a candidate city in that round.

The incomplete table below summarizes the voting outcomes across the rounds:

RoundTotal Votes CastTop ContenderVotes ReceivedEliminated CityVotes Received
Round 1—London30New York12
Round 283Paris32Beijing21
Round 375————

Additional Telemetry & Delegate Behaviour:

  • All delegates who voted for London and Paris in Round 1 continued to vote for the same cities in all subsequent rounds as long as those cities remained in contention.

  • Exactly 75% of those who voted for Beijing in Round 1 voted for Beijing in Round 2 as well.

  • Those who voted for New York in Round 1 voted either for Beijing or for Paris in Round 2.

  • In Round 3 (the final round between London and Paris), the difference in votes cast between the two contending cities was exactly 1.

  • Exactly 50% of the delegates who voted for Beijing in Round 1 voted for Paris in Round 3.

What percentage of the delegates who voted for Beijing in Round 2 and remained eligible to vote in Round 3, cast their vote for London?

  1. A

    33.33%

  2. B

    38.10%

  3. C

    50%

  4. D

    66.67%

Show answer and explanation

Answer: (D) 66.67%

Question 23 Solution:

  1. Eligibility for Round 3:

    • Rule 2 states that a delegate can vote for at most 2 different cities across all rounds.

    • In Round 2, 21 delegates voted for Beijing:

      • 9 delegates voted for New York in Round 1 and Beijing in Round 2. They have now voted for 2 distinct cities (both of which are eliminated). Thus, all 9 are ineligible to vote in Round 3!

      • 12 delegates voted for Beijing in both Round 1 and Round 2. They have only voted for 1 city so far. Thus, all 12 are eligible to vote in Round 3.

  2. Voting Behaviour in Round 3:

    • Exactly 50% of Round 1 Beijing voters (0.50×16=80.50 \times 16 = 8 delegates) voted for Paris in Round 3.

    • 4 of these 8 had already switched to Paris in Round 2.

    • Therefore, exactly 8−4=48 - 4 = 4 of the 12 eligible Beijing Round 2 voters voted for Paris in Round 3.

    • The remaining 12−4=812 - 4 = 8 eligible delegates must have voted for London in Round 3.

  3. Calculate Percentage:

    812×100%=23×100%=66.67%\frac{8}{12} \times 100\% = \frac{2}{3} \times 100\% = 66.67\%

Hence, 66.67% of eligible Beijing voters voted for London.

Question 24 · CAT Level

Directions for Questions 21 to 24

Answer the questions on the basis of the information given below:

In the year 2089, four candidate metropolitan hubs—Beijing, London, New York, and Paris—are in contention to host the prestigious World Solar Vehicle Challenge Proving Grounds.

The host city is chosen through several sequential rounds of secret balloting by delegates of the World Solar Council (WSC), where each delegate represents a unique global city. All four candidate cities in contention are also represented by delegates on the WSC.

Voting Rules & Regulations:

  1. In any voting round, the candidate city receiving the fewest votes in that round is eliminated. The solitary surviving city after the final round wins the right to host the event.

  2. A delegate is permitted to cast votes for at most two different candidate cities across all rounds combined. Consequently, a delegate becomes ineligible to vote in a given round if both cities they voted for in earlier rounds have already been eliminated.

  3. A delegate is also strictly ineligible to vote in any round in which the city they represent is actively in contention.

  4. As long as a delegate is eligible, they must cast exactly one vote for a candidate city in that round.

The incomplete table below summarizes the voting outcomes across the rounds:

RoundTotal Votes CastTop ContenderVotes ReceivedEliminated CityVotes Received
Round 1—London30New York12
Round 283Paris32Beijing21
Round 375————

Additional Telemetry & Delegate Behaviour:

  • All delegates who voted for London and Paris in Round 1 continued to vote for the same cities in all subsequent rounds as long as those cities remained in contention.

  • Exactly 75% of those who voted for Beijing in Round 1 voted for Beijing in Round 2 as well.

  • Those who voted for New York in Round 1 voted either for Beijing or for Paris in Round 2.

  • In Round 3 (the final round between London and Paris), the difference in votes cast between the two contending cities was exactly 1.

  • Exactly 50% of the delegates who voted for Beijing in Round 1 voted for Paris in Round 3.

Which of the following statements must be true?

  • Statement I: The council delegate representing New York must have voted for Paris in Round 2.

  • Statement II: The council delegate representing Beijing voted for London in Round 3.

  1. A

    Only I

  2. B

    Only II

  3. C

    Both I and II

  4. D

    Neither I nor II

Show answer and explanation

Answer: (A) Only I

Question 24 Solution:

  1. Evaluation of Statement I:

    • In Round 1, the delegate representing New York could not vote because New York was in contention.

    • In Round 2, New York was eliminated, making this delegate eligible.

    • London's votes in Round 2 remained exactly 30 (all 30 original Round 1 voters).

    • Beijing's 21 votes are fully accounted for (12 from Round 1 Beijing voters, 9 from Round 1 New York voters).

    • Therefore, the delegate from New York must have cast their vote for Paris in Round 2.

    • Statement I is strictly TRUE.

  2. Evaluation of Statement II:

    • In Round 3, Beijing was eliminated, so the delegate representing Beijing became eligible to vote.

    • Total votes cast in Round 3 was 75.

    • London received: 30 (original)+8 (from Beijing)=38 votes30\text{ (original)} + 8\text{ (from Beijing)} = 38\text{ votes}.

    • Paris received: 32 (Round 2)+4 (from Beijing)+1 (Beijing delegate)=37 votes32\text{ (Round 2)} + 4\text{ (from Beijing)} + 1\text{ (Beijing delegate)} = 37\text{ votes}.

    • Note that 38−37=138 - 37 = 1, satisfying the condition that the difference in votes was 1.

    • For Paris to reach 37 votes (and for the total to be 38+37=7538 + 37 = 75), the Beijing delegate must have voted for Paris, not London!

    • Therefore, Statement II is FALSE.

Hence, Only I must be true.

Question 25 · CAT Level

Directions for Questions 25 to 29

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, cryptographers and vulnerability researchers are assigned an integer topological index called the Turing Distance (named after foundational pioneer Alan Turing).

The metric represents the shortest co-authorship distance to the root authority:

  • Alan Turing himself has a Turing Distance of 0.

  • Any researcher who has directly co-authored a cryptographic research paper with Turing has a Turing Distance of 1.

  • For all other researchers: if researcher XX has co-authored papers with multiple peers, and peer YY among them has the smallest Turing Distance yy, then researcher XX is assigned a Turing Distance of y+1y + 1.

  • Any researcher with no collaborative chain connecting them to Turing has a Turing Distance of ∞\infty.

During a 7-day specialized summit, a closed cohort of eight researchers—designated A, B, C, D, E, F, G, and H—collaborated on advanced zero-day mitigations.

  • At the start of the summit, A was the only participant with an infinite (∞\infty) Turing Distance.

  • Nobody in the group had a Turing Distance strictly less than that of F.

  • Day 3 Milestone: Researcher F co-authored a joint research paper with A and C. This single paper reduced the average Turing Distance of the entire group of eight researchers to 3.0. The Turing Distances of B, D, E, G, and H remained unchanged. Furthermore, no alternative co-authorship among any three members of the cohort could have reduced the average Turing Distance of the group to as low as 3.0.

  • Day 3 Distribution: At the end of the third day, exactly five members of the cohort possessed identical Turing Distances, while the other three had Turing Distances distinct from each other.

  • Day 5 Milestone: Researcher E co-authored a joint paper with F, which reduced the group's average Turing Distance by 0.5. The Turing Distances of the other six researchers remained unchanged.

  • No other papers were co-authored during the summit.

How many researchers in the cohort did not change their Turing Distance during the entire 7-day summit?

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (D) 5

Question 25 Solution:

  1. Analyze Co-authorship Events:

    • Day 3: F co-authored with A and C.

      • A had ∞\infty, so A's distance changed to y+1y + 1.

      • C's distance changed to y+1y + 1.

      • F had the minimum distance yy in the group, so F's distance did not change.

    • Day 5: E co-authored with F.

      • E's distance changed to y+1y + 1.

      • F's distance remained unchanged.

    • No other papers were co-authored during the summit.

  2. Counting Unchanged Participants:

    • The only researchers whose Turing Distances changed during the summit were A, C, and E (3 researchers).

    • The remaining 5 researchers (B, D, F, G, and H) did not change their Turing Distance at any point during the summit.

Hence, exactly 5 researchers did not change their Turing Distance.

Question 26 · CAT Level

Directions for Questions 25 to 29

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, cryptographers and vulnerability researchers are assigned an integer topological index called the Turing Distance (named after foundational pioneer Alan Turing).

The metric represents the shortest co-authorship distance to the root authority:

  • Alan Turing himself has a Turing Distance of 0.

  • Any researcher who has directly co-authored a cryptographic research paper with Turing has a Turing Distance of 1.

  • For all other researchers: if researcher XX has co-authored papers with multiple peers, and peer YY among them has the smallest Turing Distance yy, then researcher XX is assigned a Turing Distance of y+1y + 1.

  • Any researcher with no collaborative chain connecting them to Turing has a Turing Distance of ∞\infty.

During a 7-day specialized summit, a closed cohort of eight researchers—designated A, B, C, D, E, F, G, and H—collaborated on advanced zero-day mitigations.

  • At the start of the summit, A was the only participant with an infinite (∞\infty) Turing Distance.

  • Nobody in the group had a Turing Distance strictly less than that of F.

  • Day 3 Milestone: Researcher F co-authored a joint research paper with A and C. This single paper reduced the average Turing Distance of the entire group of eight researchers to 3.0. The Turing Distances of B, D, E, G, and H remained unchanged. Furthermore, no alternative co-authorship among any three members of the cohort could have reduced the average Turing Distance of the group to as low as 3.0.

  • Day 3 Distribution: At the end of the third day, exactly five members of the cohort possessed identical Turing Distances, while the other three had Turing Distances distinct from each other.

  • Day 5 Milestone: Researcher E co-authored a joint paper with F, which reduced the group's average Turing Distance by 0.5. The Turing Distances of the other six researchers remained unchanged.

  • No other papers were co-authored during the summit.

What was the Turing Distance of the researcher who held the largest Turing Distance at the conclusion of the summit?

  1. A

    5

  2. B

    7

  3. C

    9

  4. D

    14

Show answer and explanation

Answer: (B) 7

Question 26 Solution:

  1. Mathematical Deductions:

    • Let F's Turing Distance be yy. Since only Turing has distance 0, y≥1y \ge 1.

    • On Day 3, F co-authored with A and C, giving both of them a distance of y+1y + 1.

    • The average of the 8 members on Day 3 became 3.0, so the sum of distances was 8×3=248 \times 3 = 24.

    • Exactly five members had identical distances on Day 3. Since A and C both have y+1y + 1, the common distance must be y+1y + 1.

    • Thus, 5 members have distance y+1y + 1, F has yy, and the other two members (E and say H) have distinct values ee and hh:

      5(y+1)+y+e+h=24  ⟹  6y+e+h=19— (Equation 1)5(y + 1) + y + e + h = 24 \implies 6y + e + h = 19 \quad \text{--- (Equation 1)}

  2. Day 5 Reduction:

    • On Day 5, E co-authored with F, reducing E's distance to y+1y + 1.

    • The average dropped by 0.5, meaning the total sum decreased by 0.5×8=40.5 \times 8 = 4:

      e−(y+1)=4  ⟹  e=y+5— (Equation 2)e - (y + 1) = 4 \implies e = y + 5 \quad \text{--- (Equation 2)}

  3. Solving for Variables:

    • Substitute Equation 2 into Equation 1:

      6y+(y+5)+h=19  ⟹  7y+h=146y + (y + 5) + h = 19 \implies 7y + h = 14

    • Since y≥1y \ge 1 and h≥1h \ge 1:

      • If y=1y = 1: 7(1)+h=14  ⟹  h=77(1) + h = 14 \implies h = 7.

      • If y≥2y \ge 2: 7y≥14  ⟹  h≤07y \ge 14 \implies h \le 0, which is impossible.

    • Thus, uniquely:

      y=1,e=1+5=6,h=7y = 1, \quad e = 1 + 5 = 6, \quad h = 7

  4. Status at the End of the Summit:

    • Six members have distance 2 (A, C, E, and three of B, D, G).

    • F has distance 1.

    • Researcher H has distance 7.

    • The largest Turing Distance at the conclusion of the summit is 7.

Hence, the answer is 7.

Question 27 · CAT Level

Directions for Questions 25 to 29

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, cryptographers and vulnerability researchers are assigned an integer topological index called the Turing Distance (named after foundational pioneer Alan Turing).

The metric represents the shortest co-authorship distance to the root authority:

  • Alan Turing himself has a Turing Distance of 0.

  • Any researcher who has directly co-authored a cryptographic research paper with Turing has a Turing Distance of 1.

  • For all other researchers: if researcher XX has co-authored papers with multiple peers, and peer YY among them has the smallest Turing Distance yy, then researcher XX is assigned a Turing Distance of y+1y + 1.

  • Any researcher with no collaborative chain connecting them to Turing has a Turing Distance of ∞\infty.

During a 7-day specialized summit, a closed cohort of eight researchers—designated A, B, C, D, E, F, G, and H—collaborated on advanced zero-day mitigations.

  • At the start of the summit, A was the only participant with an infinite (∞\infty) Turing Distance.

  • Nobody in the group had a Turing Distance strictly less than that of F.

  • Day 3 Milestone: Researcher F co-authored a joint research paper with A and C. This single paper reduced the average Turing Distance of the entire group of eight researchers to 3.0. The Turing Distances of B, D, E, G, and H remained unchanged. Furthermore, no alternative co-authorship among any three members of the cohort could have reduced the average Turing Distance of the group to as low as 3.0.

  • Day 3 Distribution: At the end of the third day, exactly five members of the cohort possessed identical Turing Distances, while the other three had Turing Distances distinct from each other.

  • Day 5 Milestone: Researcher E co-authored a joint paper with F, which reduced the group's average Turing Distance by 0.5. The Turing Distances of the other six researchers remained unchanged.

  • No other papers were co-authored during the summit.

How many participants in the cohort shared the exact same Turing Distance at the beginning of the summit?

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (B) 3

Question 27 Solution:

  1. Initial Distribution of Turing Distances:

    • At the end of Day 3, five members had a distance of 2: A, C, and three members from {B, D, G, H}.

    • Participant A began with ∞\infty.

    • Participant C only attained a distance of 2 on Day 3 (prior to Day 3, C's distance was strictly >2> 2).

    • Therefore, exactly three members (among B, D, G, H) already had a Turing Distance of 2 at the beginning of the summit.

    • The other participants had distinct distances at the start: F had 1, E had 6, H had 7, A had ∞\infty.

    • No other distance value was shared by more than one participant.

Hence, exactly 3 participants had the same Turing Distance at the start of the summit.

Question 28 · CAT Level

Directions for Questions 25 to 29

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, cryptographers and vulnerability researchers are assigned an integer topological index called the Turing Distance (named after foundational pioneer Alan Turing).

The metric represents the shortest co-authorship distance to the root authority:

  • Alan Turing himself has a Turing Distance of 0.

  • Any researcher who has directly co-authored a cryptographic research paper with Turing has a Turing Distance of 1.

  • For all other researchers: if researcher XX has co-authored papers with multiple peers, and peer YY among them has the smallest Turing Distance yy, then researcher XX is assigned a Turing Distance of y+1y + 1.

  • Any researcher with no collaborative chain connecting them to Turing has a Turing Distance of ∞\infty.

During a 7-day specialized summit, a closed cohort of eight researchers—designated A, B, C, D, E, F, G, and H—collaborated on advanced zero-day mitigations.

  • At the start of the summit, A was the only participant with an infinite (∞\infty) Turing Distance.

  • Nobody in the group had a Turing Distance strictly less than that of F.

  • Day 3 Milestone: Researcher F co-authored a joint research paper with A and C. This single paper reduced the average Turing Distance of the entire group of eight researchers to 3.0. The Turing Distances of B, D, E, G, and H remained unchanged. Furthermore, no alternative co-authorship among any three members of the cohort could have reduced the average Turing Distance of the group to as low as 3.0.

  • Day 3 Distribution: At the end of the third day, exactly five members of the cohort possessed identical Turing Distances, while the other three had Turing Distances distinct from each other.

  • Day 5 Milestone: Researcher E co-authored a joint paper with F, which reduced the group's average Turing Distance by 0.5. The Turing Distances of the other six researchers remained unchanged.

  • No other papers were co-authored during the summit.

What was the Turing Distance of researcher C at the end of the summit?

  1. A

    1

  2. B

    2

  3. C

    3

  4. D

    4

Show answer and explanation

Answer: (B) 2

Question 28 Solution:

  1. On Day 3, C co-authored a research paper with F.

  2. Since F has a Turing Distance of y=1y = 1, any direct co-author of F who does not already have a smaller distance receives:

    Turing Distance=y+1=1+1=2\text{Turing Distance} = y + 1 = 1 + 1 = 2

  3. C participated in no further papers during the summit.

  4. Therefore, C's Turing Distance at the end of the summit was 2.

Question 29 · CAT Level

Directions for Questions 25 to 29

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, cryptographers and vulnerability researchers are assigned an integer topological index called the Turing Distance (named after foundational pioneer Alan Turing).

The metric represents the shortest co-authorship distance to the root authority:

  • Alan Turing himself has a Turing Distance of 0.

  • Any researcher who has directly co-authored a cryptographic research paper with Turing has a Turing Distance of 1.

  • For all other researchers: if researcher XX has co-authored papers with multiple peers, and peer YY among them has the smallest Turing Distance yy, then researcher XX is assigned a Turing Distance of y+1y + 1.

  • Any researcher with no collaborative chain connecting them to Turing has a Turing Distance of ∞\infty.

During a 7-day specialized summit, a closed cohort of eight researchers—designated A, B, C, D, E, F, G, and H—collaborated on advanced zero-day mitigations.

  • At the start of the summit, A was the only participant with an infinite (∞\infty) Turing Distance.

  • Nobody in the group had a Turing Distance strictly less than that of F.

  • Day 3 Milestone: Researcher F co-authored a joint research paper with A and C. This single paper reduced the average Turing Distance of the entire group of eight researchers to 3.0. The Turing Distances of B, D, E, G, and H remained unchanged. Furthermore, no alternative co-authorship among any three members of the cohort could have reduced the average Turing Distance of the group to as low as 3.0.

  • Day 3 Distribution: At the end of the third day, exactly five members of the cohort possessed identical Turing Distances, while the other three had Turing Distances distinct from each other.

  • Day 5 Milestone: Researcher E co-authored a joint paper with F, which reduced the group's average Turing Distance by 0.5. The Turing Distances of the other six researchers remained unchanged.

  • No other papers were co-authored during the summit.

What was the Turing Distance of researcher E at the beginning of the summit?

  1. A

    2

  2. B

    5

  3. C

    6

  4. D

    7

Show answer and explanation

Answer: (C) 6

Question 29 Solution:

  1. From the solution to Question 26, on Day 5, E co-authored with F, reducing E's distance to y+1=2y + 1 = 2.

  2. This co-authorship decreased the group's total sum of distances by 4 (0.5×8=40.5 \times 8 = 4).

  3. Therefore:

    e−2=4  ⟹  e=6e - 2 = 4 \implies e = 6

  4. Since E did not participate in any paper prior to Day 5, E's initial Turing Distance at the start of the summit was 6.

Question 30 · CAT Level

Directions for Questions 30 to 33

Answer the questions on the basis of the information given below:

In the telemetry testing sector of the World Solar Vehicle Challenge, engineers construct a 5 m×5 m5\text{ m} \times 5\text{ m} modular sensor grid consisting of 25 equal-sized square platform towers.

The height (in metres) of the solar transceiver tower erected on each cell of the grid is shown in the matrix below:

61243
95328
78465
39512
17639

Optical transceivers (all of identical physical elevation above their respective tower platforms) are mounted on these towers.

An optical transceiver on tower AA can establish an uninterrupted line-of-sight uplink to a transceiver on tower BB (we say A can reach B) if and only if all three of the following geometric conditions are satisfied:

  1. Tower AA and Tower BB are situated in the same row or the same column.

  2. Tower AA is at a strictly lower elevation than Tower BB (hA<hBh_A < h_B).

  3. If there are any intermediate tower(s) located directly between AA and BB, every such intermediate tower must have an elevation strictly lower than that of Tower AA (i.e., no intervening tower can obstruct or occlude the line of sight from AA).

Example: Consider the tower of height 8 situated in Row 3, Column 2. It can be reached by exactly four transceivers:

  • By the tower to its left at height 7;

  • By the two towers to its right at heights 4 and 6 (since the intermediate tower at height 4 does not block the line of sight from height 6);

  • By the tower directly above it at height 5.

Rows are numbered 1 to 5 from top to bottom, and columns are numbered 1 to 5 from left to right.

How many solar transceiver towers in this grid can be reached by exactly one other transceiver?

  1. A

    3

  2. B

    5

  3. C

    7

  4. D

    8

Show answer and explanation

Answer: (C) 7

Question 30 Solution:

  1. Calculate the Number of Reaching Towers for Every Cell:

    An individual at tower AA can reach tower BB if AA and BB are in the same row/column, hA<hBh_A < h_B, and all intermediate heights are <hA< h_A.

    Evaluating this line-of-sight condition in all 4 cardinal directions for all 25 positions yields the following reach-count matrix:

    3 & 0 & 1 & 3 & 0 \\ 4 & 2 & 2 & 0 & 5 \\ 1 & 4 & 1 & 6 & 1 \\ 1 & 4 & 3 & 0 & 1 \\ 0 & 2 & 2 & 1 & 6 \end{pmatrix}$$
  2. Identify Towers with a Reach Count of Exactly 1:

    • Row 1, Column 3 [height 2]: reached only by (1,2) [height 1]. (1 tower)

    • Row 3, Column 1 [height 7]: reached only by (4,1) [height 3] (since intermediate (5,1) [height 1] <3< 3). (1 tower)

    • Row 3, Column 3 [height 4]: reached only by (2,3) [height 3]. (1 tower)

    • Row 3, Column 5 [height 5]: reached only by (4,5) [height 2]. (1 tower)

    • Row 4, Column 1 [height 3]: reached only by (5,1) [height 1]. (1 tower)

    • Row 4, Column 5 [height 2]: reached only by (4,4) [height 1]. (1 tower)

    • Row 5, Column 4 [height 3]: reached only by (4,4) [height 1]. (1 tower)

  3. Total Count:

    1+0+3+2+1=7 towers1 + 0 + 3 + 2 + 1 = 7\text{ towers}

Hence, exactly 7 individuals can be reached by just one individual.

Question 31 · CAT Level

Directions for Questions 30 to 33

Answer the questions on the basis of the information given below:

In the telemetry testing sector of the World Solar Vehicle Challenge, engineers construct a 5 m×5 m5\text{ m} \times 5\text{ m} modular sensor grid consisting of 25 equal-sized square platform towers.

The height (in metres) of the solar transceiver tower erected on each cell of the grid is shown in the matrix below:

61243
95328
78465
39512
17639

Optical transceivers (all of identical physical elevation above their respective tower platforms) are mounted on these towers.

An optical transceiver on tower AA can establish an uninterrupted line-of-sight uplink to a transceiver on tower BB (we say A can reach B) if and only if all three of the following geometric conditions are satisfied:

  1. Tower AA and Tower BB are situated in the same row or the same column.

  2. Tower AA is at a strictly lower elevation than Tower BB (hA<hBh_A < h_B).

  3. If there are any intermediate tower(s) located directly between AA and BB, every such intermediate tower must have an elevation strictly lower than that of Tower AA (i.e., no intervening tower can obstruct or occlude the line of sight from AA).

Example: Consider the tower of height 8 situated in Row 3, Column 2. It can be reached by exactly four transceivers:

  • By the tower to its left at height 7;

  • By the two towers to its right at heights 4 and 6 (since the intermediate tower at height 4 does not block the line of sight from height 6);

  • By the tower directly above it at height 5.

Rows are numbered 1 to 5 from top to bottom, and columns are numbered 1 to 5 from left to right.

Which of the following statements is necessarily true for any transceiver tower of height 1 m in this grid?

  1. A

    They can be reached by all the individuals in their own row and column

  2. B

    They can be reached by at least 4 individuals

  3. C

    They can be reached by at least one individual

  4. D

    They cannot be reached by anyone

Show answer and explanation

Answer: (D) They cannot be reached by anyone

Question 31 Solution:

  1. By Condition (ii), for tower AA to reach tower BB, we must have:

    hA<hBh_A < h_B

  2. The minimum height of any platform in the entire 5×55 \times 5 layout is 1 m1\text{ m}.

  3. For an individual at a platform of height hB=1 mh_B = 1\text{ m} to be reached, there must exist some platform with height hA<1 mh_A < 1\text{ m}.

  4. Since no platform has a height less than 1 m1\text{ m}, no individual can reach anyone seated at height 1 m1\text{ m}.

Hence, They cannot be reached by anyone.

Question 32 · CAT Level

Directions for Questions 30 to 33

Answer the questions on the basis of the information given below:

In the telemetry testing sector of the World Solar Vehicle Challenge, engineers construct a 5 m×5 m5\text{ m} \times 5\text{ m} modular sensor grid consisting of 25 equal-sized square platform towers.

The height (in metres) of the solar transceiver tower erected on each cell of the grid is shown in the matrix below:

61243
95328
78465
39512
17639

Optical transceivers (all of identical physical elevation above their respective tower platforms) are mounted on these towers.

An optical transceiver on tower AA can establish an uninterrupted line-of-sight uplink to a transceiver on tower BB (we say A can reach B) if and only if all three of the following geometric conditions are satisfied:

  1. Tower AA and Tower BB are situated in the same row or the same column.

  2. Tower AA is at a strictly lower elevation than Tower BB (hA<hBh_A < h_B).

  3. If there are any intermediate tower(s) located directly between AA and BB, every such intermediate tower must have an elevation strictly lower than that of Tower AA (i.e., no intervening tower can obstruct or occlude the line of sight from AA).

Example: Consider the tower of height 8 situated in Row 3, Column 2. It can be reached by exactly four transceivers:

  • By the tower to its left at height 7;

  • By the two towers to its right at heights 4 and 6 (since the intermediate tower at height 4 does not block the line of sight from height 6);

  • By the tower directly above it at height 5.

Rows are numbered 1 to 5 from top to bottom, and columns are numbered 1 to 5 from left to right.

In which of the following lines of the grid can we find exactly two transceiver towers that cannot be reached by any other transceiver?

  1. A

    The last row

  2. B

    The fourth row

  3. C

    The fourth column

  4. D

    The middle column

Show answer and explanation

Answer: (C) The fourth column

Question 32 Solution:

  1. A tower cannot be reached by anyone if its reach count is 0.

  2. Let us inspect Column 4:

    • Tower at Row 1, Col 4 [height 4]: reached by 3 towers.

    • Tower at Row 2, Col 4 [height 2]:

      • In Row 2: left is height 3 (3>23 > 2), right is height 8 (8>28 > 2).

      • In Col 4: above is height 4 (4>24 > 2), below is height 6 (6>26 > 2).

      • None of the 4 adjacent platforms is lower than 2. Thus, reach count = 0.

    • Tower at Row 3, Col 4 [height 6]: reach count = 6.

    • Tower at Row 4, Col 4 [height 1]: minimum height, reach count = 0.

    • Tower at Row 5, Col 4 [height 3]: reach count = 1.

    • Column 4 contains exactly two towers with reach count 0 (at Row 2 and Row 4).

  3. Checking the other options:

    • Last row (Row 5): contains only one tower with reach count 0 (at Col 1).

    • Fourth row (Row 4): contains only one tower with reach count 0 (at Col 4).

    • Middle column (Column 3): contains zero towers with reach count 0.

Hence, the answer is The fourth column.

Question 33 · CAT Level

Directions for Questions 30 to 33

Answer the questions on the basis of the information given below:

In the telemetry testing sector of the World Solar Vehicle Challenge, engineers construct a 5 m×5 m5\text{ m} \times 5\text{ m} modular sensor grid consisting of 25 equal-sized square platform towers.

The height (in metres) of the solar transceiver tower erected on each cell of the grid is shown in the matrix below:

61243
95328
78465
39512
17639

Optical transceivers (all of identical physical elevation above their respective tower platforms) are mounted on these towers.

An optical transceiver on tower AA can establish an uninterrupted line-of-sight uplink to a transceiver on tower BB (we say A can reach B) if and only if all three of the following geometric conditions are satisfied:

  1. Tower AA and Tower BB are situated in the same row or the same column.

  2. Tower AA is at a strictly lower elevation than Tower BB (hA<hBh_A < h_B).

  3. If there are any intermediate tower(s) located directly between AA and BB, every such intermediate tower must have an elevation strictly lower than that of Tower AA (i.e., no intervening tower can obstruct or occlude the line of sight from AA).

Example: Consider the tower of height 8 situated in Row 3, Column 2. It can be reached by exactly four transceivers:

  • By the tower to its left at height 7;

  • By the two towers to its right at heights 4 and 6 (since the intermediate tower at height 4 does not block the line of sight from height 6);

  • By the tower directly above it at height 5.

Rows are numbered 1 to 5 from top to bottom, and columns are numbered 1 to 5 from left to right.

Which of the following statements is true regarding this grid layout?

  1. A

    Each row has an individual who can be reached by 5 or more individuals

  2. B

    Each row has an individual who cannot be reached by anyone

  3. C

    Each row has at least two individuals who can be reached by an equal number of individuals

  4. D

    All individuals at the height of 9 m can be reached by at least 5 individuals

Show answer and explanation

Answer: (C) Each row has at least two individuals who can be reached by an equal number of individuals

Question 33 Solution:

Let us evaluate each statement against the reach-count matrix:

3 & 0 & 1 & 3 & 0 \\ 4 & 2 & 2 & 0 & 5 \\ 1 & 4 & 1 & 6 & 1 \\ 1 & 4 & 3 & 0 & 1 \\ 0 & 2 & 2 & 1 & 6 \end{pmatrix}$$ 1. **Option 1 is FALSE:** - In Row 1, reach counts are $[3, 0, 1, 3, 0]$. The maximum reach count is 3, so no individual can be reached by 5 or more individuals. 2. **Option 2 is FALSE:** - In Row 3, reach counts are $[1, 4, 1, 6, 1]$. Every platform can be reached by at least 1 individual (there are no zeros). 3. **Option 4 is FALSE:** - The platform of height 9 in Row 2, Column 1 has a reach count of 4, which is not at least 5. 4. **Option 3 is TRUE:** - **Row 1:** Reach counts $[3, 0, 1, 3, 0] \implies 3$ appears twice, $0$ appears twice. - **Row 2:** Reach counts $[4, 2, 2, 0, 5] \implies 2$ appears twice. - **Row 3:** Reach counts $[1, 4, 1, 6, 1] \implies 1$ appears three times. - **Row 4:** Reach counts $[1, 4, 3, 0, 1] \implies 1$ appears twice. - **Row 5:** Reach counts $[0, 2, 2, 1, 6] \implies 2$ appears twice. - In every single row, at least two platforms share the exact same reach count. Hence, Statement 3 is strictly true.

Question 34 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, an automated perimeter defense grid is modelled as an 8×88 \times 8 airspace coordinate matrix.

Columns are labelled a to h from left to right, and rows are numbered 1 to 8 from bottom to top. The position of any aerial node is defined by its column-row coordinate (for example, c5 refers to column c, row 5).

An Interceptor Radar Drone (functioning analogously to a chess Queen) placed at any vacant coordinate on the grid can lock onto and neutralize another node if that node lies in the same row, the same column, or along any of the four diagonal trajectories, provided there is no intermediate node blocking the line of fire along that trajectory.

If an Interceptor Drone is positioned at c5, and target drones are positioned at c2, g1, g3, g5, and a3 (with no other nodes present on the grid), how many target drones are actively under lock by the Interceptor Drone?

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (C) 4

Question 34 Solution:

  1. Interceptor Drone Position: c5 (Column c=3c = 3, Row 55).

  2. Evaluate Target Drones:

    • c2: Same column cc (c=3,r=2c = 3, r = 2). Straight line downwards with no intervening piece   ⟹  \implies Under lock.

    • g1: Target at c=7,r=1c = 7, r = 1. Δc=7−3=+4\Delta c = 7 - 3 = +4, Δr=1−5=−4\Delta r = 1 - 5 = -4. Since ∣Δc∣=∣Δr∣=4|\Delta c| = |\Delta r| = 4, it lies on the down-right diagonal. Direct line of sight   ⟹  \implies Under lock.

    • g3: Target at c=7,r=3c = 7, r = 3. Δc=+4,Δr=−2\Delta c = +4, \Delta r = -2. Since ∣Δc∣≠∣Δr∣|\Delta c| \ne |\Delta r|, this is not on a diagonal, row, or column   ⟹  \implies Not under lock.

    • g5: Same row 5 (c=7,r=5c = 7, r = 5). Straight line to the right with no intervening piece   ⟹  \implies Under lock.

    • a3: Target at c=1,r=3c = 1, r = 3. Δc=1−3=−2,Δr=3−5=−2\Delta c = 1 - 3 = -2, \Delta r = 3 - 5 = -2. Since ∣Δc∣=∣Δr∣=2|\Delta c| = |\Delta r| = 2, it lies on the down-left diagonal. Direct line of sight   ⟹  \implies Under lock.

  3. Total Drones Under Lock:

    Four target drones (c2, g1, g5, and a3) are under lock.

Hence, the answer is 4.

Question 35 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, an automated perimeter defense grid is modelled as an 8×88 \times 8 airspace coordinate matrix.

Columns are labelled a to h from left to right, and rows are numbered 1 to 8 from bottom to top. The position of any aerial node is defined by its column-row coordinate (for example, c5 refers to column c, row 5).

An Interceptor Radar Drone (functioning analogously to a chess Queen) placed at any vacant coordinate on the grid can lock onto and neutralize another node if that node lies in the same row, the same column, or along any of the four diagonal trajectories, provided there is no intermediate node blocking the line of fire along that trajectory.

If target drones are positioned exclusively at a1, a3, b4, d7, h7, and h8, which of the following coordinates for the Interceptor Drone results in the maximum number of target drones being under lock?

  1. A

    f8

  2. B

    a7

  3. C

    c1

  4. D

    d3

Show answer and explanation

Answer: (D) d3

Question 35 Solution:

Target drones are at: a1, a3, b4, d7, h7, h8.

Let us test each candidate position:

  1. At f8:

    • Row 8: sees h8 (collinear).

    • Diagonal down-left: Δc=−5,Δr=−5  ⟹  \Delta c = -5, \Delta r = -5 \implies sees a3.

    • Total targets under lock = 2.

  2. At a7:

    • Column a: sees a3 (target a1 is directly behind a3 and is blocked).

    • Row 7: sees d7 (target h7 is directly behind d7 and is blocked).

    • Total targets under lock = 2.

  3. At c1:

    • Row 1: sees a1.

    • Diagonal up-left: Δc=−2,Δr=+2  ⟹  \Delta c = -2, \Delta r = +2 \implies sees a3.

    • Total targets under lock = 2.

  4. At d3:

    • Row 3: sees a3 along the horizontal line of fire to the left.

    • Column d: sees d7 along the vertical line of fire upwards.

    • Diagonal up-right: Δc=+4,Δr=+4  ⟹  \Delta c = +4, \Delta r = +4 \implies sees h7 along the diagonal.

    • Total targets under lock = 3.

Position d3 achieves the maximum of 3 targets under lock.

Hence, the answer is d3.

Question 36 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, an automated perimeter defense grid is modelled as an 8×88 \times 8 airspace coordinate matrix.

Columns are labelled a to h from left to right, and rows are numbered 1 to 8 from bottom to top. The position of any aerial node is defined by its column-row coordinate (for example, c5 refers to column c, row 5).

An Interceptor Radar Drone (functioning analogously to a chess Queen) placed at any vacant coordinate on the grid can lock onto and neutralize another node if that node lies in the same row, the same column, or along any of the four diagonal trajectories, provided there is no intermediate node blocking the line of fire along that trajectory.

If target drones are positioned exclusively at a1, a3, b4, d7, h7, and h8, from how many vacant coordinates on the entire 8×88 \times 8 grid would the Interceptor Drone be unable to lock onto ANY of the target drones?

  1. A

    0

  2. B

    3

  3. C

    4

  4. D

    6

Show answer and explanation

Answer: (C) 4

Question 36 Solution:

Target drones are at: a1, a3, b4, d7, h7, h8.

We seek coordinates that do not share any row, column, or diagonal with any of the six target positions:

  1. Targets occupy:

    • Rows: 1, 3, 4, 7, 8 (so only rows 2, 5, 6 could possibly be free of row attacks).

    • Columns: a, b, d, h (so only columns c, e, f, g could be free of column attacks).

  2. Testing candidates in the remaining intersection squares:

    • e2:

      • Row 2: free. Column e: free.

      • Diagonals from e2:

        • Up-right: f3, g4, h5 (no target)

        • Down-left: d1 (no target)

        • Up-left: d3, c4, b5, a6 (no target)

        • Down-right: f1 (no target)

          ⟹  \implies e2 sees 0 targets!

    • f2:

      • Row 2: free. Column f: free.

      • Diagonals: e1, g3, h4; e3, d4, c5, b6, a7; g1; none contain targets   ⟹  \implies f2 sees 0 targets!

    • g2:

      • Row 2: free. Column g: free.

      • Diagonals: f1, h3; f3, e4, d5, c6, b7, a8; h1; none contain targets   ⟹  \implies g2 sees 0 targets!

    • g5:

      • Row 5: free. Column g: free.

      • Diagonals: f4 (free, target is b4), e3, d2, c1; h6; f6, e7 (free, target is d7), d8; h4; none contain targets   ⟹  \implies g5 sees 0 targets!

  3. Exhaustive check confirms no other vacant squares are completely immune from all six targets.

Thus, exactly 4 coordinates (e2, f2, g2, g5) cannot lock onto any target.

Hence, the answer is 4.

Question 37 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the information given below:

In the Continental Cyber-Security League, an automated perimeter defense grid is modelled as an 8×88 \times 8 airspace coordinate matrix.

Columns are labelled a to h from left to right, and rows are numbered 1 to 8 from bottom to top. The position of any aerial node is defined by its column-row coordinate (for example, c5 refers to column c, row 5).

An Interceptor Radar Drone (functioning analogously to a chess Queen) placed at any vacant coordinate on the grid can lock onto and neutralize another node if that node lies in the same row, the same column, or along any of the four diagonal trajectories, provided there is no intermediate node blocking the line of fire along that trajectory.

Suppose the Interceptor Drone is the only node present on the grid and is positioned at d5. In how many vacant positions on the board can a reconnaissance drone be placed such that it is completely safe from lock by the Interceptor Drone?

  1. A

    32

  2. B

    33

  3. C

    36

  4. D

    37

Show answer and explanation

Answer: (C) 36

Question 37 Solution:

  1. Total Board Squares: 8×8=648 \times 8 = 64.

  2. The Interceptor Drone occupies square d5 (1 square).

  3. Count Squares Attacked by d5 (Column 4, Row 5):

    • Same Row (Row 5): 7 squares.

    • Same Column (Column d): 7 squares.

    • Main Diagonal (slope +1): passes through a2, b3, c4, d5, e6, f7, g8   ⟹  6\implies 6 other squares.

    • Anti-Diagonal (slope -1): passes through a8, b7, c6, d5, e4, f3, g2, h1   ⟹  7\implies 7 other squares.

    • Total squares under lock = 7+7+6+7=277 + 7 + 6 + 7 = 27 squares.

  4. Calculate Safe Squares:

    Safe Squares=64−1 (drone position)−27 (attacked)=36 squares\text{Safe Squares} = 64 - 1\text{ (drone position)} - 27\text{ (attacked)} = 36\text{ squares}

Hence, a reconnaissance drone can be placed in 36 safe positions.

Question 38 · CAT Level

Directions for Questions 38 to 40

Answer the questions on the basis of the information given below:

Five sovereign cyber divisions—Division Alpha, Division Beta, Division Gamma, Division Delta, and Division Epsilon—participated in the annual Continental Cyber Penetration League.

League Tournament Structure:

  • Every division engages every other division exactly 5 times across the tournament, resulting in a total of 4×5=204 \times 5 = 20 matches played per division, and a grand total of 5×42×5=50\frac{5 \times 4}{2} \times 5 = 50 matches across the league.

  • Each match concludes in a Win (W), Loss (L), or Tie (T).

  • When a match produces a decisive result, 1 win is credited to the victor and 1 loss to the defeated division.

  • When a match ends in a tie, 1 tie is credited to each of the two competing divisions.

The standings table below records the completed match outcomes for the five divisions. The statistics for Division Epsilon are denoted by the variables X,Y,X, Y, and ZZ.

Cyber DivisionMatches Won (W)Matches Lost (L)Matches Tied (T)Total Matches
Division Alpha (Haryana)215320
Division Beta (Maharashtra)79420
Division Gamma (Punjab)612220
Division Delta (Bengal)108220
Division Epsilon (Assam)XYZ20

What is the value of XX (the number of matches won by Division Epsilon)?

  1. A

    0

  2. B

    1

  3. C

    19

  4. D

    20

Show answer and explanation

Answer: (C) 19

Question 38 Solution:

  1. Tournament Conservation Principles:

    • Every decisive match generates exactly one win and one loss. Therefore, the sum of all wins must equal the sum of all losses:

      ∑W=∑L\sum W = \sum L

    • Every tie awards one tie to each team, so the number of tied matches is ∑T2\frac{\sum T}{2}.

    • The total number of matches played across the entire league is:

      Total Matches=∑L+∑T2=50\text{Total Matches} = \sum L + \frac{\sum T}{2} = 50

  2. Summing Known Division Statistics:

    • Sum of Wins: 2+7+6+10+X=25+X2 + 7 + 6 + 10 + X = 25 + X

    • Sum of Losses: 15+9+12+8+Y=44+Y15 + 9 + 12 + 8 + Y = 44 + Y

    • Sum of Ties: 3+4+2+2+Z=11+Z3 + 4 + 2 + 2 + Z = 11 + Z

  3. Setting Up the System of Equations:

    • From ∑W=∑L\sum W = \sum L:

      25+X=44+Y  ⟹  X−Y=19— (Equation 1)25 + X = 44 + Y \implies X - Y = 19 \quad \text{--- (Equation 1)}

    • From Total Matches = 50:

      (44+Y)+11+Z2=50(44 + Y) + \frac{11 + Z}{2} = 50

      44+Y+5.5+0.5Z=50  ⟹  Y+0.5Z=0.5  ⟹  2Y+Z=1— (Equation 2)44 + Y + 5.5 + 0.5Z = 50 \implies Y + 0.5Z = 0.5 \implies 2Y + Z = 1 \quad \text{--- (Equation 2)}

  4. Solving for Non-negative Integer Values:

    • Since YY and ZZ represent match counts, they must be non-negative integers (Y,Z∈{0,1,2,… }Y, Z \in \{0, 1, 2, \dots\}).

    • The equation 2Y+Z=12Y + Z = 1 has the unique non-negative integer solution:

      Y=0,Z=1Y = 0, \quad Z = 1

    • Substituting Y=0Y = 0 into Equation 1:

      X=19+0=19X = 19 + 0 = 19

    • Verify total matches for Division Epsilon: X+Y+Z=19+0+1=20X + Y + Z = 19 + 0 + 1 = 20. Matches perfectly!

Hence, the value of XX is 19.

Question 39 · CAT Level

Directions for Questions 38 to 40

Answer the questions on the basis of the information given below:

Five sovereign cyber divisions—Division Alpha, Division Beta, Division Gamma, Division Delta, and Division Epsilon—participated in the annual Continental Cyber Penetration League.

League Tournament Structure:

  • Every division engages every other division exactly 5 times across the tournament, resulting in a total of 4×5=204 \times 5 = 20 matches played per division, and a grand total of 5×42×5=50\frac{5 \times 4}{2} \times 5 = 50 matches across the league.

  • Each match concludes in a Win (W), Loss (L), or Tie (T).

  • When a match produces a decisive result, 1 win is credited to the victor and 1 loss to the defeated division.

  • When a match ends in a tie, 1 tie is credited to each of the two competing divisions.

The standings table below records the completed match outcomes for the five divisions. The statistics for Division Epsilon are denoted by the variables X,Y,X, Y, and ZZ.

Cyber DivisionMatches Won (W)Matches Lost (L)Matches Tied (T)Total Matches
Division Alpha (Haryana)215320
Division Beta (Maharashtra)79420
Division Gamma (Punjab)612220
Division Delta (Bengal)108220
Division Epsilon (Assam)XYZ20

What is the value of YY (the number of matches lost by Division Epsilon)?

  1. A

    0

  2. B

    1

  3. C

    19

  4. D

    20

Show answer and explanation

Answer: (A) 0

Question 39 Solution:

  1. From the system derived in Question 38:

    2Y+Z=12Y + Z = 1

  2. Since YY and ZZ must be non-negative integers:

    • If Y≥1Y \ge 1, then 2Y+Z≥2>12Y + Z \ge 2 > 1, which is impossible.

    • Therefore, YY must be 0.

    • When Y=0Y = 0, Z=1Z = 1.

Hence, the value of YY is 0.

Question 40 · CAT Level

Directions for Questions 38 to 40

Answer the questions on the basis of the information given below:

Five sovereign cyber divisions—Division Alpha, Division Beta, Division Gamma, Division Delta, and Division Epsilon—participated in the annual Continental Cyber Penetration League.

League Tournament Structure:

  • Every division engages every other division exactly 5 times across the tournament, resulting in a total of 4×5=204 \times 5 = 20 matches played per division, and a grand total of 5×42×5=50\frac{5 \times 4}{2} \times 5 = 50 matches across the league.

  • Each match concludes in a Win (W), Loss (L), or Tie (T).

  • When a match produces a decisive result, 1 win is credited to the victor and 1 loss to the defeated division.

  • When a match ends in a tie, 1 tie is credited to each of the two competing divisions.

The standings table below records the completed match outcomes for the five divisions. The statistics for Division Epsilon are denoted by the variables X,Y,X, Y, and ZZ.

Cyber DivisionMatches Won (W)Matches Lost (L)Matches Tied (T)Total Matches
Division Alpha (Haryana)215320
Division Beta (Maharashtra)79420
Division Gamma (Punjab)612220
Division Delta (Bengal)108220
Division Epsilon (Assam)XYZ20

What is the value of ZZ (the number of matches tied by Division Epsilon)?

  1. A

    0

  2. B

    1

  3. C

    19

  4. D

    20

Show answer and explanation

Answer: (B) 1

Question 40 Solution:

  1. From the relation 2Y+Z=12Y + Z = 1 and Y=0Y = 0:

    2(0)+Z=1  ⟹  Z=12(0) + Z = 1 \implies Z = 1

  2. Notice that with Z=1Z = 1, the total sum of ties across all teams becomes:

    ∑T=11+1=12\sum T = 11 + 1 = 12

    which is an even number, ensuring that the number of tied matches 122=6\frac{12}{2} = 6 is an integer.

Hence, the value of ZZ is 1.

Try real CAT questions

Study this concept with interactive practice in PrepSoc.

Open the concept library