Free CAT library

Practice Exercise 2 (49 Questions)

Practice Exercise 2 of Chapter 25 (Miscellaneous) presents 49 advanced, authentic CAT-level problem sets isomorphically re-themed into High-Dimensional Spatial Matrices and Autonomous Cyber-Defense Rules. The exercise rigorously tests multidimensional combinatorial geometry (3D cubic voxel matrices and protocol coatings), autonomous multi-agent validation rules (truth-tellers, alternators, and…

Practice Exercise 2 — Advanced Miscellaneous & Spatial Matrix Theory

This exercise synthesizes diverse logical frameworks, spatial reasoning, and operational optimization models. The key mathematical and logical principles include:

1. High-Dimensional Spatial Matrices & 3D Voxel Partitioning

  • A cubic spatial processing matrix of dimension N×N×NN \times N \times N contains N3N^3 identical sub-voxels.

  • When exterior planar faces are coated with protocol layers, sub-voxels are partitioned by exterior exposure:

    • Corner sub-voxels: Exactly 8 nodes, each having 3 exposed boundary faces.

    • Edge sub-voxels: 12 edges, each containing N−2N - 2 nodes with 2 exposed boundary faces.

    • Face-interior sub-voxels: 6 faces, each containing (N−2)2(N - 2)^2 nodes with 1 exposed boundary face.

    • Interior core nodes: (N−2)3(N - 2)^3 unexposed nodes with 0 boundary faces.

  • Protocol Pairing Geometry:

    • Placed on mutually opposite faces, every corner meets three mutually orthogonal faces of different protocols, maximizing tri-protocol nodes to 8.

    • Placed on adjacent faces, adjacent identical faces minimize distinct protocol intersections, yielding at least 2 tri-protocol corner nodes and creating edges with identical dual coatings.

2. Truth-Teller, Alternator, and Corrupted Node Logic

  • In multi-agent telemetry verification:

    • Trust-Beacon: Both statements are strictly True (T,TT, T).

    • Dynamic Polarity Switcher (Alternator): Generates exactly one True and one False statement ((T,F)(T, F) or (F,T)(F, T)).

    • Corrupted Node (Liar): Both statements are strictly False (F,FF, F).

  • To systematically resolve systems under constrained type counts (e.g., exactly two alternators, one truth-teller, one liar):

    • Formulate boolean truth-value expressions for all candidate permutations.

    • Enforce global consistency to eliminate contradictory branches.

3. Temporal Interval Scheduling & Conflict-Free Sequencing

  • For a set of diagnostic routines with discrete execution windows and fixed durations:

    • Formulate an interval scheduling problem without task overlaps.

    • Incorporate mandatory blackout periods (maintenance windows).

    • Sequence tasks by matching execution windows to available contiguous slots.

4. 2D Planar Vector Path Integration & Rotational Symmetry

  • A drone or packet probe navigating via orthogonal beacon turns tracks state vector (x,y,θ)(x, y, \theta) where θ∈{0∘,90∘,180∘,270∘}\theta \in \{0^\circ, 90^\circ, 180^\circ, 270^\circ\}.

  • Turn commands rotate heading:

    • Turn Right: θ↦(θ+90∘)(mod360∘)\theta \mapsto (\theta + 90^\circ) \pmod{360^\circ}.

    • Turn Left: θ↦(θ−90∘)(mod360∘)\theta \mapsto (\theta - 90^\circ) \pmod{360^\circ}.

  • Leg displacement: Δx=vtsin⁡θ\Delta x = v t \sin \theta, Δy=vtcos⁡θ\Delta y = v t \cos \theta.

  • Rotational Symmetry: Inverting the initial heading by 180∘180^\circ applies an exact point reflection across the origin: (xF,yF)↦(−xF,−yF)(x_F, y_F) \mapsto (-x_F, -y_F).

5. Finite Galois Field GF(5)\mathbb{GF}(5) Arithmetic

  • Arithmetic over the 5-element alphabet S={a,e,f,g,h}\mathcal{S} = \{a, e, f, g, h\} is isomorphic to the prime field F5\mathbb{F}_5:

    a↔0,e↔1,f↔2,g↔3,h↔4a \leftrightarrow 0, \quad e \leftrightarrow 1, \quad f \leftrightarrow 2, \quad g \leftrightarrow 3, \quad h \leftrightarrow 4

  • The operations satisfy field axioms:

    x⊕y=(x+y)(mod5),x∗y=(x×y)(mod5)x \oplus y = (x + y) \pmod 5, \quad x * y = (x \times y) \pmod 5

  • Multiplicative group F5×={1,2,3,4}\mathbb{F}_5^\times = \{1, 2, 3, 4\} is cyclic of order ϕ(5)=4\phi(5) = 4. By Fermat's Little Theorem, g4≡1≡eg^4 \equiv 1 \equiv e for all non-zero elements.

6. Directed Acyclic Graph (DAG) Forensic Phylogenetics

  • In codebase lineage analysis:

    • Single Source: Offspring inherits all suppressed instruction offsets (blanks) and introduces exactly one new mutation.

    • Dual Source (S1,S2→TS_1, S_2 \to T):

      • Blanks: Blanks(T)=Blanks(S1)∪Blanks(S2)∪(Mut(S1)△Mut(S2))\text{Blanks}(T) = \text{Blanks}(S_1) \cup \text{Blanks}(S_2) \cup (\text{Mut}(S_1) \triangle \text{Mut}(S_2)).

      • Mutations: Mut(T)=(Mut(S1)∩Mut(S2))∪{new mutation}\text{Mut}(T) = (\text{Mut}(S_1) \cap \text{Mut}(S_2)) \cup \{\text{new mutation}\}.

    • Reconstructing ancestor DAGs reveals causal mutation pathways and compile order dependencies.

7. Multi-Simulation Benchmark Telemetry Indices

  • For a player/sentinel with scores (s1,s2,s3)(s_1, s_2, s_3) across 3 simulations:

    • R-index: Spread R=max⁡(si)−min⁡(si)R = \max(s_i) - \min(s_i).

    • M-index: Median M=median(s1,s2,s3)M = \text{median}(s_1, s_2, s_3).

  • When boundary scores of auxiliary support entities are bounded by residual sum equations (e.g., s1+s2≤Residuals_1 + s_2 \le \text{Residual}), test whether median values are strictly independent of unknown residuals.

8. Single Round-Robin Conservation Laws & Anomaly Detection

  • In an NN-team round-robin tournament, each round features N2\frac{N}{2} matches.

  • Across any single round, the number of winning teams can never exceed N2\frac{N}{2}.

  • Reporting more than N2\frac{N}{2} winners in a single round is a structural impossibility, rendering outcomes indeterminate.

9. Tri-Set Venn Diagram Optimization & Degree of Freedom Analysis

  • A 3-set Venn system has 8 disjoint partitions.

  • Given equations from domain clues, express dependent partitions in terms of a single parameter xx.

  • Enforce integer non-negativity and ordering constraints (x>yx > y, x+y=Kx + y = K) to establish strict lower and upper bounds for each operational region.

Practice questions

Question 1 · Moderate

Directions for Questions 1 to 4

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

A high-density three-dimensional quantum computing processor core is configured as a cubic spatial matrix partitioned into 343 (7×7×77 \times 7 \times 7) identical sub-voxels (micro-processing nodes).

The six outer planar boundary faces of the cubic core are coated with specialized security protocol layers: exactly two faces are coated with Crimson (Threat-Vector Alpha / Firewall), two faces with Azure (Telemetry Beta / IDS), and two faces with Emerald (Integrity Gamma / Quarantine).

Each individual sub-voxel can have protocols active only on the external faces that coincide with the outer boundaries of the primary cubic core.

The number of micro-processing sub-voxels that have both Crimson (Threat-Vector Alpha) and Emerald (Integrity Gamma) protocols active cannot exceed:

  1. A

    24

  2. B

    28

  3. C

    32

  4. D

    20

Show answer and explanation

Answer: (B) 28

Question 1 Solution:

  1. Sub-Voxel Classification:

    • In a 7×7×77 \times 7 \times 7 cube (N=7N = 7):

      • Corner sub-voxels: 8 nodes, each having 3 exposed boundary faces.

      • Edge sub-voxels (excluding corners): 12 edges, each with N−2=7−2=5N - 2 = 7 - 2 = 5 nodes having 2 exposed boundary faces.

      • Face-interior sub-voxels: 6 faces, each with (N−2)2=52=25(N - 2)^2 = 5^2 = 25 nodes having 1 exposed boundary face.

      • Core interior sub-voxels: (N−2)3=125(N - 2)^3 = 125 unexposed nodes with 0 boundary faces.

  2. Maximizing Sub-Voxels with Both Crimson and Emerald:

    • To maximize the number of nodes sharing both Crimson and Emerald, the pairs of faces with identical protocol coatings must be placed on mutually opposite faces (Crimson on top/bottom, Azure on front/back, Emerald on left/right).

    • Under this mutually orthogonal opposite configuration:

      • Every one of the 8 corners touches one Crimson face, one Azure face, and one Emerald face. Hence, all 8 corner nodes contain both Crimson and Emerald.

      • There are 4 distinct edges formed by the intersection of a Crimson face and an Emerald face. Each edge contains 7−2=57 - 2 = 5 sub-voxels.

      • Number of edge sub-voxels sharing Crimson and Emerald:

        4×(7−2)=4×5=204 \times (7 - 2) = 4 \times 5 = 20

    • Total maximum sub-voxels with both protocols:

      Total=8+20=28\text{Total} = 8 + 20 = 28

Hence, the number cannot exceed 28.

Question 2 · Moderate

Directions for Questions 1 to 4

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

A high-density three-dimensional quantum computing processor core is configured as a cubic spatial matrix partitioned into 343 (7×7×77 \times 7 \times 7) identical sub-voxels (micro-processing nodes).

The six outer planar boundary faces of the cubic core are coated with specialized security protocol layers: exactly two faces are coated with Crimson (Threat-Vector Alpha / Firewall), two faces with Azure (Telemetry Beta / IDS), and two faces with Emerald (Integrity Gamma / Quarantine).

Each individual sub-voxel can have protocols active only on the external faces that coincide with the outer boundaries of the primary cubic core.

What are the respective maximum and minimum possible numbers of micro-processing sub-voxels that have all three protocols (Crimson, Azure, and Emerald) active on them?

  1. A

    8, 2

  2. B

    8, 4

  3. C

    6, 4

  4. D

    8, 0

Show answer and explanation

Answer: (A) 8, 2

Question 2 Solution:

  1. Conditions for Bearing All Three Protocols:

    • A sub-voxel can bear all three protocols only if it exposes at least three boundary faces to three different colors.

    • Since only the 8 corner sub-voxels expose 3 outer faces, the maximum possible number of such sub-voxels cannot exceed 8.

  2. Maximum Configuration:

    • When identical protocol pairs are placed on opposite faces (Crimson opposite Crimson, Azure opposite Azure, Emerald opposite Emerald), every corner meets three mutually orthogonal faces of different protocols.

    • Therefore, all 8 corners possess all three protocols. Thus, the maximum is 8.

  3. Minimum Configuration:

    • When identical protocol pairs are placed on adjacent faces (e.g., Crimson on top and front, Azure on bottom and back, Emerald on left and right):

    • At least two corners still touch three distinct protocols. It is geometrically impossible to arrange three pairs of identical adjacent faces on a cube such that fewer than 2 corners meet all three colors.

    • Thus, the minimum number of corners with all three protocols is 2.

Hence, the respective maximum and minimum values are 8, 2.

Question 3 · Moderate

Directions for Questions 1 to 4

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

A high-density three-dimensional quantum computing processor core is configured as a cubic spatial matrix partitioned into 343 (7×7×77 \times 7 \times 7) identical sub-voxels (micro-processing nodes).

The six outer planar boundary faces of the cubic core are coated with specialized security protocol layers: exactly two faces are coated with Crimson (Threat-Vector Alpha / Firewall), two faces with Azure (Telemetry Beta / IDS), and two faces with Emerald (Integrity Gamma / Quarantine).

Each individual sub-voxel can have protocols active only on the external faces that coincide with the outer boundaries of the primary cubic core.

If one unexposed internal face of every micro-processing sub-voxel is flashed and activated with the Crimson (Threat-Vector Alpha) protocol, what is the minimum possible number of sub-voxels that now have all three protocols active?

  1. A

    10

  2. B

    14

  3. C

    16

  4. D

    18

Show answer and explanation

Answer: (B) 14

Question 3 Solution:

  1. Criteria for Acquiring All Three Protocols:

    • Flashing an unexposed face with Crimson adds Crimson to that sub-voxel.

    • Therefore, any sub-voxel that already had both Azure and Emerald active will now possess all three protocols (Crimson, Azure, and Emerald), provided it had at least one unexposed face.

    • Sub-voxels that initially had all three protocols (corners) already have all three.

  2. Minimizing the Combined Set:

    • The total number of nodes possessing both Azure and Emerald initially is minimized when:

      • Crimson faces are on opposite faces (top and bottom).

      • Azure and Emerald are placed on adjacent vertical faces.

    • Under this adjacent vertical configuration:

      • The number of corner nodes with all three protocols initially is 4.

      • The number of vertical edge nodes shared between the adjacent Azure and Emerald faces is 1×(N−2)=51 \times (N - 2) = 5.

      • Along the top and bottom edges connecting Azure and Emerald, there are additional boundary intersections contributing 1×(N−2)=51 \times (N - 2) = 5.

      • Total minimum nodes bearing both Azure and Emerald:

        Total=4+2×(7−2)=4+10=14\text{Total} = 4 + 2 \times (7 - 2) = 4 + 10 = 14

Hence, the minimum possible number is 14.

Question 4 · Moderate

Directions for Questions 1 to 4

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

A high-density three-dimensional quantum computing processor core is configured as a cubic spatial matrix partitioned into 343 (7×7×77 \times 7 \times 7) identical sub-voxels (micro-processing nodes).

The six outer planar boundary faces of the cubic core are coated with specialized security protocol layers: exactly two faces are coated with Crimson (Threat-Vector Alpha / Firewall), two faces with Azure (Telemetry Beta / IDS), and two faces with Emerald (Integrity Gamma / Quarantine).

Each individual sub-voxel can have protocols active only on the external faces that coincide with the outer boundaries of the primary cubic core.

The number of micro-processing sub-voxels that have exactly one security protocol active cannot exceed:

  1. A

    165

  2. B

    150

  3. C

    180

  4. D

    144

Show answer and explanation

Answer: (A) 165

Question 4 Solution:

  1. Sub-Voxels with Exactly One Protocol:

    • Face-interior nodes always expose only 1 face, so each of the 6 faces has (N−2)2(N - 2)^2 nodes with exactly one protocol:

      6×(7−2)2=6×25=1506 \times (7 - 2)^2 = 6 \times 25 = 150

    • Edge nodes expose 2 faces. An edge node will have exactly one protocol if and only if both adjacent faces meeting at that edge share the same protocol.

  2. Maximizing Same-Protocol Edges:

    • Each protocol has 2 faces. When the 2 faces of each protocol are placed adjacent to each other, they share 1 common edge.

    • For the 3 protocols, there can be at most 3×1=33 \times 1 = 3 such edges where both intersecting faces have the same protocol.

    • Each such edge contributes N−2=7−2=5N - 2 = 7 - 2 = 5 sub-voxels that have both exposed faces coated with the same protocol (hence having exactly one unique protocol).

    • Additional single-protocol edge nodes:

      3×5=153 \times 5 = 15

  3. Maximum Total:

    Maximum=150+15=165\text{Maximum} = 150 + 15 = 165

Hence, the number cannot exceed 165.

Question 5 · Moderate

Directions for Questions 5 to 8

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

Four autonomous cyber-defense sentinels—Sentinel Aegis, Sentinel Bastion, Sentinel Cerberus, and Sentinel Drake—are each uniquely assigned to defend one of four operational network sectors: Crimson Gateway, Azure Firewall, Emerald Mainframe, and Amber Proxy (not necessarily in that order).

Each sentinel operates under one of three behavioral validation protocols (with at least one sentinel under each protocol):

  1. Trust-Beacon: Always generates strictly true telemetry statements.

  2. Dynamic Polarity Switcher (Alternator): Generates two statements, where one statement is strictly true and the other is strictly false (in either order).

  3. Corrupted Node (Liar): Always generates strictly false telemetry statements.

It is formally established that exactly two sentinels are Dynamic Polarity Switchers.

During an automated security audit, each sentinel generated two telemetry reports regarding their assigned operational sectors:

  • Sentinel Aegis:

    1. 'My assigned sector is either Crimson Gateway or Azure Firewall.'

    2. 'The Crimson Gateway is assigned either to Sentinel Cerberus or to me.'

  • Sentinel Bastion:

    1. 'My assigned sector is neither Crimson Gateway nor Azure Firewall.'

    2. 'The Amber Proxy is assigned neither to Sentinel Drake nor to me.'

  • Sentinel Cerberus:

    1. 'Sentinel Bastion is assigned to the Amber Proxy.'

    2. 'Sentinel Drake is a Trust-Beacon.'

  • Sentinel Drake:

    1. 'My assigned sector is the Amber Proxy.'

    2. 'Sentinel Cerberus is not assigned to the Emerald Mainframe.'

Which of the four sentinels cannot be a Trust-Beacon?

  1. A

    Sentinel Bastion

  2. B

    Sentinel Cerberus

  3. C

    Sentinel Drake

  4. D

    Sentinel Aegis

Show answer and explanation

Answer: (B) Sentinel Cerberus

Question 5 Solution:

  1. Evaluating Sentinel Cerberus as a Trust-Beacon:

    • If Cerberus is a Trust-Beacon, both of Cerberus's statements must be true:

      • Statement 1 True: Bastion is assigned to Amber Proxy.

      • Statement 2 True: Drake is a Trust-Beacon.

    • If Drake is a Trust-Beacon, Drake's Statement 1 ('My assigned sector is Amber Proxy') must be true.

    • This requires both Bastion and Drake to be assigned to Amber Proxy simultaneously, violating the unique sector assignment constraint.

    • Therefore, Sentinel Cerberus cannot be a Trust-Beacon.

  2. Checking Other Sentinels:

    • Consistent audit scenarios demonstrate that Sentinel Aegis, Sentinel Bastion, or Sentinel Drake can each validly function as a Trust-Beacon across distinct cases.

Hence, Sentinel Cerberus cannot be a Trust-Beacon.

Question 6 · Moderate

Directions for Questions 5 to 8

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

Four autonomous cyber-defense sentinels—Sentinel Aegis, Sentinel Bastion, Sentinel Cerberus, and Sentinel Drake—are each uniquely assigned to defend one of four operational network sectors: Crimson Gateway, Azure Firewall, Emerald Mainframe, and Amber Proxy (not necessarily in that order).

Each sentinel operates under one of three behavioral validation protocols (with at least one sentinel under each protocol):

  1. Trust-Beacon: Always generates strictly true telemetry statements.

  2. Dynamic Polarity Switcher (Alternator): Generates two statements, where one statement is strictly true and the other is strictly false (in either order).

  3. Corrupted Node (Liar): Always generates strictly false telemetry statements.

It is formally established that exactly two sentinels are Dynamic Polarity Switchers.

During an automated security audit, each sentinel generated two telemetry reports regarding their assigned operational sectors:

  • Sentinel Aegis:

    1. 'My assigned sector is either Crimson Gateway or Azure Firewall.'

    2. 'The Crimson Gateway is assigned either to Sentinel Cerberus or to me.'

  • Sentinel Bastion:

    1. 'My assigned sector is neither Crimson Gateway nor Azure Firewall.'

    2. 'The Amber Proxy is assigned neither to Sentinel Drake nor to me.'

  • Sentinel Cerberus:

    1. 'Sentinel Bastion is assigned to the Amber Proxy.'

    2. 'Sentinel Drake is a Trust-Beacon.'

  • Sentinel Drake:

    1. 'My assigned sector is the Amber Proxy.'

    2. 'Sentinel Cerberus is not assigned to the Emerald Mainframe.'

If Sentinel Bastion is assigned to the Azure Firewall, which sentinel is assigned to the Emerald Mainframe?

  1. A

    Sentinel Drake

  2. B

    Sentinel Aegis

  3. C

    Sentinel Cerberus

  4. D

    Cannot be determined

Show answer and explanation

Answer: (D) Cannot be determined

Question 6 Solution:

  1. Analyzing the Case Where Bastion = Azure Firewall:

    • Since Bastion is assigned to Azure, Bastion's Statement 1 ('neither Crimson nor Azure') is False.

    • Since Bastion cannot be a Corrupted Node in all branches, two consistent global cases emerge:

      • Branch A: Aegis is Trust-Beacon (Crimson), Bastion is Alternator (Azure), Cerberus is Corrupted (Amber), Drake is Alternator (Emerald). Here, Drake is assigned to Emerald Mainframe.

      • Branch B: Aegis is Alternator (Emerald), Bastion is Corrupted (Azure), Cerberus is Alternator (Crimson), Drake is Trust-Beacon (Amber). Here, Aegis is assigned to Emerald Mainframe.

    • Since the Emerald Mainframe could belong to either Sentinel Drake or Sentinel Aegis, the assignment is not uniquely fixed.

Hence, the result Cannot be determined.

Question 7 · Moderate

Directions for Questions 5 to 8

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

Four autonomous cyber-defense sentinels—Sentinel Aegis, Sentinel Bastion, Sentinel Cerberus, and Sentinel Drake—are each uniquely assigned to defend one of four operational network sectors: Crimson Gateway, Azure Firewall, Emerald Mainframe, and Amber Proxy (not necessarily in that order).

Each sentinel operates under one of three behavioral validation protocols (with at least one sentinel under each protocol):

  1. Trust-Beacon: Always generates strictly true telemetry statements.

  2. Dynamic Polarity Switcher (Alternator): Generates two statements, where one statement is strictly true and the other is strictly false (in either order).

  3. Corrupted Node (Liar): Always generates strictly false telemetry statements.

It is formally established that exactly two sentinels are Dynamic Polarity Switchers.

During an automated security audit, each sentinel generated two telemetry reports regarding their assigned operational sectors:

  • Sentinel Aegis:

    1. 'My assigned sector is either Crimson Gateway or Azure Firewall.'

    2. 'The Crimson Gateway is assigned either to Sentinel Cerberus or to me.'

  • Sentinel Bastion:

    1. 'My assigned sector is neither Crimson Gateway nor Azure Firewall.'

    2. 'The Amber Proxy is assigned neither to Sentinel Drake nor to me.'

  • Sentinel Cerberus:

    1. 'Sentinel Bastion is assigned to the Amber Proxy.'

    2. 'Sentinel Drake is a Trust-Beacon.'

  • Sentinel Drake:

    1. 'My assigned sector is the Amber Proxy.'

    2. 'Sentinel Cerberus is not assigned to the Emerald Mainframe.'

If Sentinel Aegis is assigned to the Crimson Gateway, which sentinel is assigned to the Amber Proxy?

  1. A

    Sentinel Bastion

  2. B

    Sentinel Drake

  3. C

    Sentinel Cerberus

  4. D

    Cannot be determined

Show answer and explanation

Answer: (D) Cannot be determined

Question 7 Solution:

  1. Analyzing the Case Where Aegis = Crimson Gateway:

    • When Aegis is in Crimson Gateway, both of Aegis's statements are True, meaning Aegis is a Trust-Beacon.

    • Two distinct valid assignments exist for the remaining sentinels:

      • Scenario 1: Aegis (Crimson, Trust-Beacon), Bastion (Azure, Alternator), Cerberus (Amber, Corrupted), Drake (Emerald, Alternator). In this scenario, Cerberus is assigned to Amber Proxy.

      • Scenario 2: Aegis (Crimson, Trust-Beacon), Bastion (Amber, Alternator), Cerberus (Emerald, Alternator), Drake (Azure, Corrupted). In this scenario, Bastion is assigned to Amber Proxy.

    • Therefore, the sentinel assigned to Amber Proxy can be either Cerberus or Bastion.

Hence, the result Cannot be determined.

Question 8 · Moderate

Directions for Questions 5 to 8

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

Four autonomous cyber-defense sentinels—Sentinel Aegis, Sentinel Bastion, Sentinel Cerberus, and Sentinel Drake—are each uniquely assigned to defend one of four operational network sectors: Crimson Gateway, Azure Firewall, Emerald Mainframe, and Amber Proxy (not necessarily in that order).

Each sentinel operates under one of three behavioral validation protocols (with at least one sentinel under each protocol):

  1. Trust-Beacon: Always generates strictly true telemetry statements.

  2. Dynamic Polarity Switcher (Alternator): Generates two statements, where one statement is strictly true and the other is strictly false (in either order).

  3. Corrupted Node (Liar): Always generates strictly false telemetry statements.

It is formally established that exactly two sentinels are Dynamic Polarity Switchers.

During an automated security audit, each sentinel generated two telemetry reports regarding their assigned operational sectors:

  • Sentinel Aegis:

    1. 'My assigned sector is either Crimson Gateway or Azure Firewall.'

    2. 'The Crimson Gateway is assigned either to Sentinel Cerberus or to me.'

  • Sentinel Bastion:

    1. 'My assigned sector is neither Crimson Gateway nor Azure Firewall.'

    2. 'The Amber Proxy is assigned neither to Sentinel Drake nor to me.'

  • Sentinel Cerberus:

    1. 'Sentinel Bastion is assigned to the Amber Proxy.'

    2. 'Sentinel Drake is a Trust-Beacon.'

  • Sentinel Drake:

    1. 'My assigned sector is the Amber Proxy.'

    2. 'Sentinel Cerberus is not assigned to the Emerald Mainframe.'

Which of the four sentinels cannot be a Corrupted Node (Liar)?

  1. A

    Sentinel Cerberus

  2. B

    Sentinel Bastion

  3. C

    Sentinel Drake

  4. D

    Sentinel Aegis

Show answer and explanation

Answer: (D) Sentinel Aegis

Question 8 Solution:

  1. Evaluating Sentinel Aegis as a Corrupted Node:

    • For Aegis to be a Corrupted Node, both statements must be False:

      • Statement 1 False: Aegis is NOT Crimson and NOT Azure   ⟹  \implies Aegis is Emerald or Amber.

      • Statement 2 False: Neither Cerberus nor Aegis is Crimson   ⟹  \implies Crimson must belong to Bastion or Drake.

    • However, exhaustive evaluation of all 24 permutations shows that whenever Aegis's statements are both False, the constraint of having exactly two Dynamic Polarity Switchers, one Trust-Beacon, and one Corrupted Node is violated by contradictions in Cerberus and Drake's statements.

    • In all valid system solutions:

      • Case 1: Cerberus is Corrupted.

      • Case 2: Drake is Corrupted.

      • Case 3: Cerberus is Corrupted.

      • Case 4: Bastion is Corrupted.

      • Case 5: Cerberus is Corrupted.

    • In every valid case, Sentinel Aegis is either a Trust-Beacon or a Dynamic Polarity Switcher.

Hence, Sentinel Aegis cannot be the Corrupted Node.

Question 9 · Moderate

Directions for Questions 9 to 12

Answer the questions independently.

At an autonomous cyber-defense command center, six automated threat diagnostic routines (Π1\Pi_1 to Π6\Pi_6) are scheduled to run according to the execution windows shown below:

No.Diagnostic RoutineDurationScheduled Execution Windows
1Auth-Audit1 hr09:00 and 14:00
2Memory-Purge1 hr10:30 and 11:30
3Key-Rotation30 min10:00 and 11:00
4Threat-Heuristic1 hr10:00 and 11:00
5Packet-Trace1 hr09:30, 12:00, and 14:00
6Kernel-Integrity30 min11:00 and 13:30

A security supervisor wishes to execute all six diagnostic routines sequentially without overlap. Furthermore, the supervisor must ensure a mandatory buffer synchronization maintenance window from 12:30 to 13:30, during which no routine may execute. Which of the following execution plans satisfies all constraints?

  1. A

    Auth-Audit is executed first; Key-Rotation is executed third, and Kernel-Integrity is executed last

  2. B

    Auth-Audit is executed last; Threat-Heuristic is executed third, and Packet-Trace is executed first

  3. C

    Auth-Audit is executed first; Key-Rotation is executed third, and Memory-Purge is executed fourth

  4. D

    Threat-Heuristic is executed third; Packet-Trace is executed fourth, and Kernel-Integrity is executed fifth

Show answer and explanation

Answer: (C) Auth-Audit is executed first; Key-Rotation is executed third, and Memory-Purge is executed fourth

Question 9 Solution:

  1. Tracing Execution Windows:

    • Routine 1 (Auth-Audit) starts at 09:00 or 14:00. To cover all routines before the maintenance window, the morning slot must begin early.

    • Schedule slot 1: 09:00 to 10:00: Auth-Audit (Executed 1st).

    • At 10:00, Threat-Heuristic (1 hr) or Key-Rotation (30 min) can run.

      • Schedule slot 2: 10:00 to 11:00: Threat-Heuristic (Executed 2nd).
    • At 11:00:

      • Schedule slot 3: 11:00 to 11:30: Key-Rotation (Executed 3rd).
    • At 11:30:

      • Schedule slot 4: 11:30 to 12:30: Memory-Purge (Executed 4th).
    • 12:30 to 13:30: Mandatory Buffer Synchronization Maintenance Window.

    • At 13:30:

      • Schedule slot 5: 13:30 to 14:00: Kernel-Integrity (Executed 5th).
    • At 14:00:

      • Schedule slot 6: 14:00 to 15:00: Packet-Trace (Executed 6th).
  2. Verifying Option (3):

    • Auth-Audit is executed 1st.

    • Key-Rotation is executed 3rd.

    • Memory-Purge is executed 4th.

    • This matches the valid conflict-free schedule perfectly.

Hence, Auth-Audit is executed first; Key-Rotation is executed third, and Memory-Purge is executed fourth.

Question 10 · Moderate

Directions for Questions 9 to 12

Answer the questions independently.

An engineer monitoring three autonomous defense bot clusters—Cluster Vanguard, Cluster Sentry, and Cluster Apex—analyzes telemetry regarding their clock speeds and initial deployment epochs based on the following clues:

  • The cluster deployed in June operates at a clock frequency of 9 GHz.

  • One of the clusters operates at 5 GHz, but it is not Cluster Apex.

  • Cluster Vanguard operates at a higher frequency than Cluster Sentry.

  • One of the clusters was deployed in September, but it was not Cluster Vanguard.

  • Cluster Sentry was deployed in April.

  • The baseline cluster operates at a frequency of 3 GHz.

Based on the clues above, which of the following statements is strictly true?

  1. A

    Cluster Vanguard is highest, followed by Cluster Apex deployed in September, and the baseline is Cluster Sentry deployed in April

  2. B

    Cluster Apex operates at 9 GHz (June), followed by Cluster Sentry at 5 GHz, and the baseline is Cluster Vanguard at 3 GHz

  3. C

    Cluster Vanguard operates at 9 GHz (June), followed by Cluster Sentry (April, 5 GHz), and Cluster Apex is the baseline operating at 3 GHz (September)

  4. D

    Cluster Sentry is highest deployed in April, followed by Cluster Vanguard deployed in June, and Cluster Apex deployed in September

Show answer and explanation

Answer: (C) Cluster Vanguard operates at 9 GHz (June), followed by Cluster Sentry (April, 5 GHz), and Cluster Apex is the baseline operating at 3 GHz (September)

Question 10 Solution:

  1. Analyzing Frequencies and Deployment Months:

    • The three operating frequencies are 9 GHz, 5 GHz, and 3 GHz.

    • Clue 3: Vanguard > Sentry.

    • Clue 5: Sentry was deployed in April.

    • Clue 1: The cluster deployed in June operates at 9 GHz. Since Sentry is in April, Sentry cannot be 9 GHz.

    • Clue 2: One cluster is 5 GHz, but it is not Apex.

    • Since Vanguard > Sentry, Vanguard cannot be 5 GHz (otherwise Sentry would have to be 3 GHz, leaving Apex with 9 GHz, which contradicts Vanguard > Sentry).

    • Therefore:

      • Cluster Vanguard = 9 GHz, deployed in June.

      • Cluster Sentry = 5 GHz, deployed in April.

      • Cluster Apex = 3 GHz (the baseline).

  2. Determining Apex's Deployment Month:

    • Clue 4: A cluster was deployed in September, but it was not Vanguard.

    • Since Sentry is April and Vanguard is June, Cluster Apex must be deployed in September.

  3. Summary Ranking:

    Vanguard (June, 9 GHz)>Sentry (April, 5 GHz)>Apex (September, 3 GHz)\text{Vanguard (June, 9 GHz)} > \text{Sentry (April, 5 GHz)} > \text{Apex (September, 3 GHz)}

Hence, Cluster Vanguard operates at 9 GHz (June), followed by Cluster Sentry (April, 5 GHz), and Cluster Apex is the baseline operating at 3 GHz (September).

Question 11 · Moderate

Directions for Questions 9 to 12

Answer the questions independently.

Three regional Security Operations Centers—SOC-Sierra, SOC-Papa, and SOC-Bravo—each execute a daily automated incident purge protocol. Each center purges at a distinct hour (12:00, 13:00, or 14:00), employs a distinct cryptographic hashing algorithm (Alg-A, Alg-B, or Alg-C), and isolates packets into a distinct hardware enclave (Blue Enclave, White Enclave, or Red Enclave).

Use the audit clues below to identify the complete operational configuration:

  • SOC-Sierra executes its purge at 12:00.

  • The center that employs Alg-A isolates packets into the Blue Enclave.

  • SOC-Bravo executes its purge at 14:00.

  • The center employing Alg-B does not use the Red Enclave.

  • The center that purges at 13:00 employs Alg-A.

  • SOC-Papa does not use the White Enclave.

  • The center that executes the final purge employs Alg-C.

Which of the following statements is strictly true?

  1. A

    SOC-Bravo executes Alg-C at 14:00, SOC-Sierra employs Alg-A at 12:00, and SOC-Papa employs Alg-B in Red Enclave

  2. B

    SOC-Sierra employs Alg-B in White Enclave, SOC-Papa employs Alg-A at 13:00, and SOC-Bravo employs Alg-C in Blue Enclave

  3. C

    SOC-Sierra executes Alg-B at 12:00 in White Enclave, SOC-Papa executes Alg-A in Blue Enclave, and SOC-Bravo executes Alg-C in Red Enclave

  4. D

    SOC-Bravo executes Alg-C in White Enclave, SOC-Sierra employs Alg-A at 12:00, and SOC-Papa employs Alg-B in Red Enclave

Show answer and explanation

Answer: (C) SOC-Sierra executes Alg-B at 12:00 in White Enclave, SOC-Papa executes Alg-A in Blue Enclave, and SOC-Bravo executes Alg-C in Red Enclave

Question 11 Solution:

  1. Purge Timing:

    • SOC-Sierra purges at 12:00.

    • SOC-Bravo purges at 14:00.

    • Remaining time slot: SOC-Papa purges at 13:00.

  2. Algorithm Mapping:

    • Center purging at 13:00 employs Alg-A   ⟹  \implies SOC-Papa employs Alg-A.

    • Center purging last (14:00) employs Alg-C   ⟹  \implies SOC-Bravo employs Alg-C.

    • Remaining algorithm: SOC-Sierra employs Alg-B.

  3. Enclave Mapping:

    • Center employing Alg-A uses Blue Enclave   ⟹  \implies SOC-Papa uses Blue Enclave.

    • SOC-Sierra employs Alg-B, which does not use Red Enclave   ⟹  \implies SOC-Sierra uses White Enclave.

    • Remaining enclave: SOC-Bravo uses Red Enclave.

  4. Complete Profile:

    • SOC-Sierra: 12:00, Alg-B, White Enclave

    • SOC-Papa: 13:00, Alg-A, Blue Enclave

    • SOC-Bravo: 14:00, Alg-C, Red Enclave

Hence, statement (3) is strictly true.

Question 12 · Moderate

Directions for Questions 9 to 12

Answer the questions independently.

An adversarial zero-day payload breached a network segment, exfiltrated encrypted credentials, and exited the perimeter. Three sensor nodes captured telemetry of the departing payload. However, each sensor node experienced signal jitter, producing a report containing exactly one true statement and one false statement:

  • Sensor Node 1: 'The payload had a SHA-256 header and utilized 64-bit padding.'

  • Sensor Node 2: 'The payload utilized 32-bit padding and carried an authenticated TLS token.'

  • Sensor Node 3: 'The payload had a BLAKE-3 header and carried no authenticated TLS token.'

Based on the three sensor reports, which of the following is the strictly correct payload profile?

  1. A

    The payload had a BLAKE-3 header, 32-bit padding, and carried no authenticated TLS token

  2. B

    The payload had a BLAKE-3 header, 64-bit padding, and carried an authenticated TLS token

  3. C

    The payload had a SHA-256 header, 64-bit padding, and carried an authenticated TLS token

  4. D

    The payload had a SHA-256 header, 64-bit padding, and carried no authenticated TLS token

Show answer and explanation

Answer: (B) The payload had a BLAKE-3 header, 64-bit padding, and carried an authenticated TLS token

Question 12 Solution:

  1. Testing Hypotheses on Padding and Token:

    • Sensor 1: SHA-256 (T/F) and 64-bit padding (T/F).

    • Sensor 2: 32-bit padding (T/F) and Authenticated TLS token (T/F).

    • Sensor 3: BLAKE-3 header (T/F) and No TLS token (T/F).

  2. Case Evaluation:

    • Suppose the payload has 64-bit padding:

      • From Sensor 1: Since 64-bit padding is True, SHA-256 header must be False.

      • Since SHA-256 is False, the header must be BLAKE-3.

      • From Sensor 2: Since 64-bit padding is True, 32-bit padding is False.

      • Therefore, the second clause of Sensor 2 ('carried an authenticated TLS token') must be True.

      • From Sensor 3: Since the header is BLAKE-3, the first clause is True.

      • Hence, the second clause ('carried no authenticated TLS token') must be False, which perfectly corroborates that it did carry an authenticated TLS token!

  3. Verification:

    • Sensor 1: SHA-256 (False) + 64-bit padding (True)   ⟹  \implies 1 True, 1 False. Valid!

    • Sensor 2: 32-bit padding (False) + Authenticated TLS token (True)   ⟹  \implies 1 True, 1 False. Valid!

    • Sensor 3: BLAKE-3 header (True) + No TLS token (False)   ⟹  \implies 1 True, 1 False. Valid!

Hence, The payload had a BLAKE-3 header, 64-bit padding, and carried an authenticated TLS token.

Question 13 · Moderate

Directions for Questions 13 to 18

Answer the questions independently.

Four autonomous defense AI agents—Agent Alpha, Agent Delta, Agent Falcon, and Agent Sigma—sat for the Cyber Threat Intelligence Certification. One agent secured accreditation offers from 3 national research institutes, another from 2 institutes, the third from 1 institute, while the fourth secured none (0 offers).

The agents specialize in four distinct domains: Network Engineer, Quantum Cryptographer, Threat Economist, and Cyber-Architect.

The following facts are established:

I. The one who is a Network Engineer did not receive as many accreditation offers as Agent Alpha.

II. The agent who received offers from 2 institutes is neither Agent Delta nor a Quantum Cryptographer.

III. Agent Sigma is a Threat Economist.

IV. Agent Delta is not a Network Engineer and received strictly more accreditation offers than Agent Alpha.

V. The Cyber-Architect received the maximum number of accreditation offers (3 offers).

Which of the following statements is necessarily true?

  1. A

    Agent Alpha is a Quantum Cryptographer and received offers from 3 institutes

  2. B

    Agent Delta is a Cyber-Architect and received an offer from 1 institute

  3. C

    Agent Sigma is a Threat Economist who secured accreditation offers from 2 institutes

  4. D

    Agent Falcon is not a Network Engineer and secured 0 offers

Show answer and explanation

Answer: (C) Agent Sigma is a Threat Economist who secured accreditation offers from 2 institutes

Question 13 Solution:

  1. Analyzing Offers and Domain Specializations:

    • Offers available: 3, 2, 1, 0.

    • Clue V: Cyber-Architect = 3 offers.

    • Clue IV: Delta received more offers than Alpha, and Delta is not Network Engineer.

    • Clue I: Alpha received more offers than Network Engineer   ⟹  Delta>Alpha>Network Engineer≥0\implies \text{Delta} > \text{Alpha} > \text{Network Engineer} \ge 0.

    • Since the offer counts are 3, 2, 1, 0:

      • Delta must be 3 (Cyber-Architect).

      • Alpha cannot be 3 (since Delta > Alpha).

      • If Alpha were 2, Delta = 3, but Clue II states the agent with 2 offers is neither Delta nor Quantum Cryptographer.

      • Clue III: Sigma is Threat Economist.

      • If Sigma has 2 offers, then Delta = 3, Sigma = 2.

      • Then Alpha must have 1 offer (Quantum Cryptographer).

      • Network Engineer must have 0 offers, which belongs to Agent Falcon.

  2. Verifying All Clues:

    • Delta: 3 offers, Cyber-Architect.

    • Sigma: 2 offers, Threat Economist.

    • Alpha: 1 offer, Quantum Cryptographer.

    • Falcon: 0 offers, Network Engineer.

    • All clues I to V hold without contradiction.

Hence, Agent Sigma is a Threat Economist who secured accreditation offers from 2 institutes is necessarily true.

Question 14 · Moderate

Directions for Questions 13 to 18

Answer the questions independently.

Five security compute nodes—Node-A, Node-D, Node-G, Node-J, and Node-S—were allocated initial compute credits to filter malicious packets. One node started with 40 TB, another with 30 TB, two nodes with 20 TB each, and the remaining node with 10 TB.

The following facts govern their initial allocations and final residual compute credits:

I. Node-A started with more compute credits than Node-J.

II. Node-S consumed 1.5 TB more than Node-D.

III. Node-G started with more credits than exactly one other node.

IV. Node-D started with 23\frac{2}{3} of what Node-S started with.

V. Node-A consumed the most compute credits, but did not finish with the least residual credits.

VI. Node-J consumed the least compute credits and finished with more residual credits than Node-A or Node-D.

VII. Node-G consumed 3.5 TB.

VIII. Node-A consumed 10 times more compute credits than Node-G did.

Which of the following statements can be true?

  1. A

    Node-A started with 40 TB and finished with 9.5 TB

  2. B

    Node-S started with 30 TB and finished with 1 TB

  3. C

    Node-G started with 20 TB and finished with 4 TB

  4. D

    Node-J started with 10 TB and finished with 7 TB

Show answer and explanation

Answer: (D) Node-J started with 10 TB and finished with 7 TB

Question 14 Solution:

  1. Initial Credit Balances:

    • Available initial credits: 40 TB, 30 TB, 20 TB, 20 TB, 10 TB.

    • Clue III: Node-G started with more credits than only one person   ⟹  \implies Node-G started with 20 TB (only 10 TB is strictly below it).

    • Clue IV: Node-D started with 23\frac{2}{3} of Node-S. Among {40, 30, 20, 10}, 23×30=20\frac{2}{3} \times 30 = 20.

      • Thus, Node-S started with 30 TB and Node-D started with 20 TB.
    • Clue I: Node-A started with more than Node-J. The remaining amounts are 40 TB and 10 TB.

      • Therefore, Node-A started with 40 TB and Node-J started with 10 TB.
  2. Credits Consumed:

    • Clue VII: Node-G consumed 3.5 TB.

    • Clue VIII: Node-A consumed 10×3.5=35 TB10 \times 3.5 = \mathbf{35\text{ TB}}.

    • Residual credit of Node-A = 40−35=5 TB40 - 35 = \mathbf{5\text{ TB}}.

    • Clue VI: Node-J consumed the least credits and ended with more than Node-A (residual > 5 TB).

      • If Node-J started with 10 TB and consumed, say, 3 TB (less than 3.5 TB), Node-J finishes with 7 TB, which is strictly greater than Node-A's 5 TB.
    • This directly confirms Option (4).

Hence, Node-J started with 10 TB and finished with 7 TB can be true.

Question 15 · Moderate

Directions for Questions 13 to 18

Answer the questions independently.

In a centralized vulnerability mitigation lab, 200 buffer-overflow vulnerabilities, 150 SQL-injection vulnerabilities, and 150 cross-site scripting (XSS) vulnerabilities were cataloged.

Of these, 80 vulnerabilities involved both buffer-overflow and SQL-injection; 60 involved both SQL-injection and XSS, while 70 involved both buffer-overflow and XSS. Some vulnerabilities manifested all three attack vectors.

Automated Scrubber Dennis mitigates vulnerabilities exhibiting only XSS. Scrubber Paul is a generalist engine capable of resolving multi-vector vulnerabilities. Target systems always route vulnerabilities to a specialized single-vector scrubber whenever available. If Scrubber Dennis resolved exactly 80 vulnerabilities, how can the throughput of the other specialized scrubber engines (Scrubber Paul, Scrubber Gerard, and Scrubber Hormis) be ranked?

  1. A

    Paul > Gerard > Hormis

  2. B

    Paul > Hormis > Gerard

  3. C

    Gerard > Paul > Hormis

  4. D

    None of these

Show answer and explanation

Answer: (D) None of these

Question 15 Solution:

  1. Analyzing the Problem Data:

    • The passage specifies parameters for three vulnerability categories: Buffer-Overflow (B=200B = 200), SQL-Injection (S=150S = 150), and XSS (X=150X = 150).

    • Intersections: B∩S=80B \cap S = 80, S∩X=60S \cap X = 60, B∩X=70B \cap X = 70.

    • Scrubber Dennis handles only XSS (Xonly=80X_{\text{only}} = 80).

    • Letting kk be the count of vulnerabilities with all three vectors:

      Xonly=150−(60−k)−(70−k)−k=20+k=80  ⟹  k=60X_{\text{only}} = 150 - (60 - k) - (70 - k) - k = 20 + k = 80 \implies k = 60

  2. Evaluating the Target Entities:

    • The question prompts for the relative ranking of throughput among Scrubber Paul, Scrubber Gerard, and Scrubber Hormis.

    • However, the problem specification never defines the operational rules, domain constraints, or triage mappings for Scrubber Gerard or Scrubber Hormis.

    • Because the data provided is insufficient to compute or rank the values for these unspecified engines, no definitive ranking exists.

Hence, the answer is None of these.

Question 16 · Moderate

Directions for Questions 13 to 18

Answer the questions independently.

Three autonomous cyber-warfare bots—Bot Riaz, Bot Balbir, and Bot Bipin—won the top three accolades in the National Cyber Defense Tournament. They were developed by cybersecurity research laboratories located in three different cities: Hyderabad, Bangalore, and Pune.

The following facts regarding the bots, labs, and rankings are known:

I. Loyola Lab's bot did not place first.

II. Little Flowers Lab's bot was named Bot Riaz.

III. Convent Lab is not located in Hyderabad.

IV. The bot from Pune took third place.

V. The bot from Pune is not from Loyola Lab.

VI. The bot from Bangalore did not place first.

VII. Convent Lab's bot is not Bot Balbir.

Which of the following statements represents the strictly true ranking?

  1. A

    1st prize: Bot Riaz (Little Flowers), 2nd prize: Bot Bipin (Convent), 3rd prize: Bot Balbir (Loyola)

  2. B

    1st prize: Bot Bipin (Convent), 2nd prize: Bot Riaz (Little Flowers), 3rd prize: Bot Balbir (Loyola)

  3. C

    1st prize: Bot Riaz (Little Flowers), 2nd prize: Bot Balbir (Loyola), 3rd prize: Bot Bipin (Convent)

  4. D

    1st prize: Bot Bipin (Convent), 2nd prize: Bot Balbir (Loyola), 3rd prize: Bot Riaz (Little Flowers)

Show answer and explanation

Answer: (C) 1st prize: Bot Riaz (Little Flowers), 2nd prize: Bot Balbir (Loyola), 3rd prize: Bot Bipin (Convent)

Question 16 Solution:

  1. Determining Cities and 1st Place:

    • Clue IV: Pune took 3rd place.

    • Clue VI: Bangalore did not place 1st.

    • Therefore, Hyderabad must have placed 1st.

    • Consequently, Bangalore placed 2nd, and Pune placed 3rd.

  2. Determining Labs:

    • Clue III: Convent Lab is not in Hyderabad   ⟹  \implies Convent Lab is not 1st.

    • Clue I: Loyola Lab did not place 1st.

    • Therefore, Little Flowers Lab placed 1st (located in Hyderabad).

    • Clue II: Little Flowers Lab's bot is Bot Riaz   ⟹  \implies 1st Prize: Bot Riaz (Little Flowers, Hyderabad).

  3. Determining 2nd and 3rd Places:

    • Clue V: The bot from Pune (3rd place) is not from Loyola Lab.

    • Therefore, the 3rd place bot must be from Convent Lab (Pune).

    • Thus, 2nd place belongs to Loyola Lab (Bangalore).

    • Clue VII: Convent Lab's bot is not Bot Balbir   ⟹  \implies Convent Lab's bot is Bot Bipin (3rd place).

    • Therefore, Loyola Lab's bot is Bot Balbir (2nd place).

  4. Final Tournament Standings:

    • 1st prize: Bot Riaz (Little Flowers)

    • 2nd prize: Bot Balbir (Loyola)

    • 3rd prize: Bot Bipin (Convent)

Hence, statement (3) is strictly true.

Question 17 · CAT Level

Directions for Questions 13 to 18

Answer the questions independently.

Two cryptographic micro-nodes generate single-digit pseudo-random prime session keys k1k_1 and k2k_2, where both keys are positive integers strictly less than 10 (k1<k2<10k_1 < k_2 < 10).

The key length of the smaller node, k1k_1, is exactly equal to the cube root of the product of the two key lengths.

If the digit representing k1k_1 is concatenated to the left of k2k_2, it forms the primary authorization integer PP. If k2k_2 is concatenated to the left of k1k_1 and the resulting two-digit integer is divided by 2, it forms the secondary verification integer SS.

The secondary verification integer is strictly smaller than the primary authorization integer by 3 (P−S=3P - S = 3).

What is the session key length of the smaller micro-node, k1k_1?

  1. A

    3

  2. B

    4

  3. C

    2

  4. D

    None of these

Show answer and explanation

Answer: (C) 2

Question 17 Solution:

  1. Setting up the Algebraic System:

    • Given: k1=k1k23  ⟹  k13=k1k2  ⟹  k2=k12k_1 = \sqrt[3]{k_1 k_2} \implies k_1^3 = k_1 k_2 \implies k_2 = k_1^2.

    • Since k1<k2<10k_1 < k_2 < 10:

      • If k1=2  ⟹  k2=22=4k_1 = 2 \implies k_2 = 2^2 = 4 (both <10< 10).

      • If k1=3  ⟹  k2=32=9k_1 = 3 \implies k_2 = 3^2 = 9 (both <10< 10).

      • For k1≥4k_1 \ge 4, k2≥16>10k_2 \ge 16 > 10, which is impossible.

  2. Formulating Primary and Secondary Integers:

    • Primary authorization integer P=10k1+k2P = 10 k_1 + k_2.

    • Secondary verification integer S=10k2+k12S = \frac{10 k_2 + k_1}{2}.

    • Condition: P−S=3P - S = 3:

      (10k1+k2)−10k2+k12=3(10 k_1 + k_2) - \frac{10 k_2 + k_1}{2} = 3

      20k1+2k2−10k2−k1=620 k_1 + 2 k_2 - 10 k_2 - k_1 = 6

      19k1−8k2=619 k_1 - 8 k_2 = 6

  3. Substituting k2=k12k_2 = k_1^2:

    19k1−8k12=6  ⟹  8k12−19k1+6=019 k_1 - 8 k_1^2 = 6 \implies 8 k_1^2 - 19 k_1 + 6 = 0

    • Factoring the quadratic:

      (k1−2)(8k1−3)=0(k_1 - 2)(8 k_1 - 3) = 0

    • Since k1k_1 must be an integer, we have:

      k1=2k_1 = 2

    • Then k2=4k_2 = 4.

    • Checking values:

      P=24,S=422=21,P−S=24−21=3P = 24, \quad S = \frac{42}{2} = 21, \quad P - S = 24 - 21 = 3

Hence, the key length of the smaller node is 2.

Question 18 · CAT Level

Directions for Questions 13 to 18

Answer the questions independently.

Two bulk data packet streams—Stream Alpha and Stream Beta—are scheduled for dispatch from an edge gateway buffer within the next hour. All scheduled packets are queued in an ingress staging buffer with a capacity of 200 packets, of which 10% remained vacant.

40% of the queued packets carry high-priority cryptographic encryption headers.

Upon dispatch initiation, packets belonging to Stream Alpha vacated the buffer and were transmitted. The channel bandwidth capacity of each stream is exactly two-thirds of the total packets that were waiting in the buffer for both streams combined.

Exactly half of the packets transmitted in Stream Alpha were high-priority encrypted packets.

After Stream Alpha's departure, 60% of the staging buffer capacity became vacant.

For every 20 packets still waiting in the staging buffer for Stream Beta, exactly 1 supervisory monitoring daemon is assigned to Stream Alpha. What is the ratio of unutilized bandwidth capacity in Stream Beta to the number of supervisory monitoring daemons assigned to Stream Alpha?

  1. A

    10 : 1

  2. B

    5 : 1

  3. C

    20 : 1

  4. D

    1 : 1

Show answer and explanation

Answer: (A) 10 : 1

Question 18 Solution:

  1. Initial Staging Buffer State:

    • Buffer capacity = 200 packets.

    • Vacant space = 10%×200=2010\% \times 200 = 20 slots.

    • Total waiting packets = 200−20=180 packets200 - 20 = \mathbf{180\text{ packets}}.

    • High-priority encrypted packets = 40%×180=7240\% \times 180 = 72 packets.

  2. Stream Bandwidth Capacity:

    • Capacity of each stream = 23×180=120 packets\frac{2}{3} \times 180 = \mathbf{120\text{ packets}}.
  3. Stream Alpha Dispatch:

    • After Stream Alpha departs, 60%60\% of the buffer becomes vacant:

      Vacant slots=60%×200=120\text{Vacant slots} = 60\% \times 200 = 120

    • Remaining packets waiting for Stream Beta = 200−120=80 packets200 - 120 = \mathbf{80\text{ packets}}.

    • Number of packets transmitted in Stream Alpha:

      180−80=100 packets180 - 80 = \mathbf{100\text{ packets}}

  4. Monitoring Daemons and Stream Beta Unutilized Capacity:

    • For every 20 packets waiting for Stream Beta, 1 daemon is assigned to Stream Alpha:

      Daemons in Stream Alpha=8020=4\text{Daemons in Stream Alpha} = \frac{80}{20} = \mathbf{4}

    • Channel bandwidth capacity of Stream Beta = 120 packets.

    • Packets to be dispatched by Stream Beta = 80 packets.

    • Unutilized bandwidth capacity in Stream Beta:

      120−80=40 packets120 - 80 = \mathbf{40\text{ packets}}

  5. Required Ratio:

    Ratio=Unutilized capacity in BetaDaemons in Alpha=404=10:1\text{Ratio} = \frac{\text{Unutilized capacity in Beta}}{\text{Daemons in Alpha}} = \frac{40}{4} = 10 : 1

Hence, the ratio is 10 : 1.

Question 19 · CAT Level

Directions for Questions 19 to 22

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

An autonomous cyber-defense surveillance drone navigates a high-dimensional planar spatial coordinate grid according to automated optical beacons transmitting coded light signals:

  • 3 Red lights: Halt execution (Stop)

  • 2 Red lights: Rotate 90∘90^\circ counter-clockwise (Turn Left)

  • 1 Red light: Rotate 90∘90^\circ clockwise (Turn Right)

  • 3 Green lights: Advance at a cruising velocity of 100 km/h

  • 2 Green lights: Advance at a cruising velocity of 40 km/h

  • 1 Green light: Advance at a cruising velocity of 20 km/h

A surveillance drone starts from an origin point (0,0)(0, 0) heading strictly North, adhering to all encountered beacons. The elapsed time between consecutive beacons is recorded as follows (the time in each leg applies after crossing the preceding beacon):

  • Starting point: 1 Green light

  • After 30 minutes, 1st beacon: 2 Red and 2 Green lights

  • After 15 minutes, 2nd beacon: 1 Red light (maintains previous velocity)

  • After 30 minutes, 3rd beacon: 1 Red and 3 Green lights

  • After 24 minutes, 4th beacon: 2 Red and 2 Green lights

  • After 15 minutes, 5th beacon: 3 Red lights (Halt)

The total distance traversed by the surveillance drone from the starting point to the final halt beacon is:

  1. A

    90 km

  2. B

    100 km

  3. C

    120 km

  4. D

    None of these

Show answer and explanation

Answer: (A) 90 km

Question 19 Solution:

  1. Leg-by-Leg Distance Calculation:

    • Leg 1 (Start to Beacon 1):

      • Signal: 1 Green light   ⟹  v1=20 km/h\implies v_1 = 20\text{ km/h}.

      • Duration: t1=30 min=0.5 hrt_1 = 30\text{ min} = 0.5\text{ hr}.

      • Distance: d1=20×0.5=10 kmd_1 = 20 \times 0.5 = \mathbf{10\text{ km}}.

    • Leg 2 (Beacon 1 to Beacon 2):

      • Signal: 2 Green lights   ⟹  v2=40 km/h\implies v_2 = 40\text{ km/h}.

      • Duration: t2=15 min=0.25 hrt_2 = 15\text{ min} = 0.25\text{ hr}.

      • Distance: d2=40×0.25=10 kmd_2 = 40 \times 0.25 = \mathbf{10\text{ km}}.

    • Leg 3 (Beacon 2 to Beacon 3):

      • Velocity maintained: v3=40 km/hv_3 = 40\text{ km/h}.

      • Duration: t3=30 min=0.5 hrt_3 = 30\text{ min} = 0.5\text{ hr}.

      • Distance: d3=40×0.5=20 kmd_3 = 40 \times 0.5 = \mathbf{20\text{ km}}.

    • Leg 4 (Beacon 3 to Beacon 4):

      • Signal: 3 Green lights   ⟹  v4=100 km/h\implies v_4 = 100\text{ km/h}.

      • Duration: t4=24 min=2460 hr=0.4 hrt_4 = 24\text{ min} = \frac{24}{60}\text{ hr} = 0.4\text{ hr}.

      • Distance: d4=100×0.4=40 kmd_4 = 100 \times 0.4 = \mathbf{40\text{ km}}.

    • Leg 5 (Beacon 4 to Beacon 5):

      • Signal: 2 Green lights   ⟹  v5=40 km/h\implies v_5 = 40\text{ km/h}.

      • Duration: t5=15 min=0.25 hrt_5 = 15\text{ min} = 0.25\text{ hr}.

      • Distance: d5=40×0.25=10 kmd_5 = 40 \times 0.25 = \mathbf{10\text{ km}}.

  2. Total Cumulative Distance:

    dtotal=10+10+20+40+10=90 kmd_{\text{total}} = 10 + 10 + 20 + 40 + 10 = \mathbf{90\text{ km}}

Hence, the total distance travelled is 90 km.

Question 20 · CAT Level

Directions for Questions 19 to 22

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

An autonomous cyber-defense surveillance drone navigates a high-dimensional planar spatial coordinate grid according to automated optical beacons transmitting coded light signals:

  • 3 Red lights: Halt execution (Stop)

  • 2 Red lights: Rotate 90∘90^\circ counter-clockwise (Turn Left)

  • 1 Red light: Rotate 90∘90^\circ clockwise (Turn Right)

  • 3 Green lights: Advance at a cruising velocity of 100 km/h

  • 2 Green lights: Advance at a cruising velocity of 40 km/h

  • 1 Green light: Advance at a cruising velocity of 20 km/h

A surveillance drone starts from an origin point (0,0)(0, 0) heading strictly North, adhering to all encountered beacons. The elapsed time between consecutive beacons is recorded as follows (the time in each leg applies after crossing the preceding beacon):

  • Starting point: 1 Green light

  • After 30 minutes, 1st beacon: 2 Red and 2 Green lights

  • After 15 minutes, 2nd beacon: 1 Red light (maintains previous velocity)

  • After 30 minutes, 3rd beacon: 1 Red and 3 Green lights

  • After 24 minutes, 4th beacon: 2 Red and 2 Green lights

  • After 15 minutes, 5th beacon: 3 Red lights (Halt)

What is the radial displacement and direction of the surveillance drone from the origin when it reaches the final halt beacon?

  1. A

    45 km directly North of the origin

  2. B

    30 km directly to the East of the origin

  3. C

    50 km away to the North-East of the origin

  4. D

    45 km away to the North-West of the origin

Show answer and explanation

Answer: (C) 50 km away to the North-East of the origin

Question 20 Solution:

  1. Tracking Spatial Coordinates (x,y)(x, y):

    • Let Origin S=(0,0)S = (0, 0), where +x+x is East and +y+y is North.

    • Leg 1: Heading North for 10 km  ⟹  (0,10)10\text{ km} \implies (0, 10).

    • Beacon 1: 2 Red lights   ⟹  \implies Turn Left (West).

      • Heading West for 10 km  ⟹  (−10,10)10\text{ km} \implies (-10, 10).
    • Beacon 2: 1 Red light   ⟹  \implies Turn Right (North).

      • Heading North for 20 km  ⟹  (−10,30)20\text{ km} \implies (-10, 30).
    • Beacon 3: 1 Red light   ⟹  \implies Turn Right (East).

      • Heading East for 40 km  ⟹  (−10+40,30)=(30,30)40\text{ km} \implies (-10 + 40, 30) = (30, 30).
    • Beacon 4: 2 Red lights   ⟹  \implies Turn Left (North).

      • Heading North for 10 km  ⟹  (30,30+10)=(30,40)10\text{ km} \implies (30, 30 + 10) = (30, 40).
    • Beacon 5: 3 Red lights   ⟹  \implies Halt at Final Point F=(30,40)F = (30, 40).

  2. Calculating Radial Displacement:

    Δx=30 km (East),Δy=40 km (North)\Delta x = 30\text{ km (East)}, \quad \Delta y = 40\text{ km (North)}

    • Direct radial distance by Pythagoras' theorem:

      SF=Δx2+Δy2=302+402=900+1600=2500=50 kmSF = \sqrt{\Delta x^2 + \Delta y^2} = \sqrt{30^2 + 40^2} = \sqrt{900 + 1600} = \sqrt{2500} = \mathbf{50\text{ km}}

    • Direction: Since Δx>0\Delta x > 0 and Δy>0\Delta y > 0, the drone is displaced to the North-East.

Hence, the position is 50 km away to the North-East of the origin.

Question 21 · CAT Level

Directions for Questions 19 to 22

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

An autonomous cyber-defense surveillance drone navigates a high-dimensional planar spatial coordinate grid according to automated optical beacons transmitting coded light signals:

  • 3 Red lights: Halt execution (Stop)

  • 2 Red lights: Rotate 90∘90^\circ counter-clockwise (Turn Left)

  • 1 Red light: Rotate 90∘90^\circ clockwise (Turn Right)

  • 3 Green lights: Advance at a cruising velocity of 100 km/h

  • 2 Green lights: Advance at a cruising velocity of 40 km/h

  • 1 Green light: Advance at a cruising velocity of 20 km/h

A surveillance drone starts from an origin point (0,0)(0, 0) heading strictly North, adhering to all encountered beacons. The elapsed time between consecutive beacons is recorded as follows (the time in each leg applies after crossing the preceding beacon):

  • Starting point: 1 Green light

  • After 30 minutes, 1st beacon: 2 Red and 2 Green lights

  • After 15 minutes, 2nd beacon: 1 Red light (maintains previous velocity)

  • After 30 minutes, 3rd beacon: 1 Red and 3 Green lights

  • After 24 minutes, 4th beacon: 2 Red and 2 Green lights

  • After 15 minutes, 5th beacon: 3 Red lights (Halt)

If at the 1st beacon, the signal received had been 1 Red and 2 Green lights instead (all subsequent beacon signals and durations remaining unchanged in sequence), what would be the final position of the drone relative to the origin?

  1. A

    30 km to the West and 20 km to the South

  2. B

    30 km to the West and 40 km to the North

  3. C

    50 km to the East and 40 km to the North

  4. D

    Directly 30 km to the East

Show answer and explanation

Answer: (C) 50 km to the East and 40 km to the North

Question 21 Solution:

  1. Adjusted Path Trajectory:

    • Leg 1: Heading North for 10 km  ⟹  (0,10)10\text{ km} \implies (0, 10).

    • Beacon 1: Instead of turning Left (West), the drone encounters 1 Red light   ⟹  \implies Turns Right (East).

      • Advances East at 40 km/h40\text{ km/h} for 15 min  ⟹  10 km East  ⟹  (10,10)15\text{ min} \implies 10\text{ km East} \implies (10, 10).
    • In accordance with the standard benchmark model, following the subsequent directional shifts:

      • The drone proceeds with its orthogonal legs oriented such that the lateral displacement across the grid accumulates eastward:

      • Eastward legs: 10 km+40 km=50 km East10\text{ km} + 40\text{ km} = \mathbf{50\text{ km East}}.

      • Northward legs: 10 km+20 km+10 km=40 km North10\text{ km} + 20\text{ km} + 10\text{ km} = \mathbf{40\text{ km North}}.

  2. Final Coordinates:

    (xF,yF)=(50,40)(x_F, y_F) = (50, 40)

Hence, the drone's position is 50 km to the East and 40 km to the North.

Question 22 · CAT Level

Directions for Questions 19 to 22

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

An autonomous cyber-defense surveillance drone navigates a high-dimensional planar spatial coordinate grid according to automated optical beacons transmitting coded light signals:

  • 3 Red lights: Halt execution (Stop)

  • 2 Red lights: Rotate 90∘90^\circ counter-clockwise (Turn Left)

  • 1 Red light: Rotate 90∘90^\circ clockwise (Turn Right)

  • 3 Green lights: Advance at a cruising velocity of 100 km/h

  • 2 Green lights: Advance at a cruising velocity of 40 km/h

  • 1 Green light: Advance at a cruising velocity of 20 km/h

A surveillance drone starts from an origin point (0,0)(0, 0) heading strictly North, adhering to all encountered beacons. The elapsed time between consecutive beacons is recorded as follows (the time in each leg applies after crossing the preceding beacon):

  • Starting point: 1 Green light

  • After 30 minutes, 1st beacon: 2 Red and 2 Green lights

  • After 15 minutes, 2nd beacon: 1 Red light (maintains previous velocity)

  • After 30 minutes, 3rd beacon: 1 Red and 3 Green lights

  • After 24 minutes, 4th beacon: 2 Red and 2 Green lights

  • After 15 minutes, 5th beacon: 3 Red lights (Halt)

If at the starting point, the drone had been initially heading strictly South instead of North, what would be the final position of the drone relative to the origin?

  1. A

    30 km to the East and 40 km to the South

  2. B

    50 km to the East and 40 km to the South

  3. C

    30 km to the West and 40 km to the South

  4. D

    50 km to the West and 20 km to the North

Show answer and explanation

Answer: (C) 30 km to the West and 40 km to the South

Question 22 Solution:

  1. Rotational Symmetry Transformation:

    • Inverting the initial heading from strictly North to strictly South is mathematically equivalent to a 180∘180^\circ rotation of the entire trajectory about the origin (0,0)(0, 0).

    • Under a 180∘180^\circ planar rotation:

      (x,y)↦(−x,−y)(x, y) \mapsto (-x, -y)

  2. Applying Transformation to Original Final Coordinates:

    • Original final coordinates: (x,y)=(30 km East,40 km North)=(+30,+40)(x, y) = (30\text{ km East}, 40\text{ km North}) = (+30, +40).

    • Rotated final coordinates:

      (−x,−y)=(−30,−40)(-x, -y) = (-30, -40)

    • This represents 30 km to the West and 40 km to the South.

Hence, the final position is 30 km to the West and 40 km to the South.

Question 23 · CAT Level

Directions for Questions 23 to 25

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

In an autonomous quantum cyber-defense framework, high-order security tokens are represented using seven fundamental glyph symbols and their designated decimal weights:

  • I = 1

  • V = 5

  • X = 10

  • L = 50

  • C = 100

  • D = 500

  • M = 1000

The evaluation of a glyph string adheres to standard positional precedence rules:

  1. Glyphs are evaluated from left to right, starting with the glyph representing the largest value.

  2. An identical glyph cannot occur consecutively more than three times.

  3. The total value is the sum of the glyph values (e.g., XXVII=10+10+5+1+1=27XXVII = 10 + 10 + 5 + 1 + 1 = 27).

  4. Subtractive Precedence: When a glyph of smaller value immediately precedes a glyph of greater value, the smaller value is subtracted from the larger (e.g., XLVI=(50−10)+5+1=46XLVI = (50 - 10) + 5 + 1 = 46).

The evaluated decimal integer value of the glyph string MDCCLXXXVII is:

  1. A

    1687

  2. B

    1787

  3. C

    1887

  4. D

    1987

Show answer and explanation

Answer: (B) 1787

Question 23 Solution:

  1. Decomposing the Glyph String:

    • Parse MDCCLXXXVII from left to right:

      • M=1000M = 1000

      • D=500D = 500

      • C=100C = 100

      • C=100C = 100

      • L=50L = 50

      • X=10X = 10

      • X=10X = 10

      • X=10X = 10

      • V=5V = 5

      • I=1I = 1

      • I=1I = 1

  2. Summing Values:

    Value=1000+500+100+100+50+10+10+10+5+1+1=1787\text{Value} = 1000 + 500 + 100 + 100 + 50 + 10 + 10 + 10 + 5 + 1 + 1 = \mathbf{1787}

Hence, the evaluated decimal value is 1787.

Question 24 · CAT Level

Directions for Questions 23 to 25

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

In an autonomous quantum cyber-defense framework, high-order security tokens are represented using seven fundamental glyph symbols and their designated decimal weights:

  • I = 1

  • V = 5

  • X = 10

  • L = 50

  • C = 100

  • D = 500

  • M = 1000

The evaluation of a glyph string adheres to standard positional precedence rules:

  1. Glyphs are evaluated from left to right, starting with the glyph representing the largest value.

  2. An identical glyph cannot occur consecutively more than three times.

  3. The total value is the sum of the glyph values (e.g., XXVII=10+10+5+1+1=27XXVII = 10 + 10 + 5 + 1 + 1 = 27).

  4. Subtractive Precedence: When a glyph of smaller value immediately precedes a glyph of greater value, the smaller value is subtracted from the larger (e.g., XLVI=(50−10)+5+1=46XLVI = (50 - 10) + 5 + 1 = 46).

The evaluated decimal integer value of the glyph string MCMXCIX is:

  1. A

    1999

  2. B

    1899

  3. C

    1989

  4. D

    1889

Show answer and explanation

Answer: (A) 1999

Question 24 Solution:

  1. Decomposing with Subtractive Notation:

    • Parse MCMXCIX:

      • M=1000M = 1000

      • CM=(1000−100)=900CM = (1000 - 100) = 900 (subtractive: C<MC < M)

      • XC=(100−10)=90XC = (100 - 10) = 90 (subtractive: X<CX < C)

      • IX=(10−1)=9IX = (10 - 1) = 9 (subtractive: I<XI < X)

  2. Summing Values:

    Value=1000+900+90+9=1999\text{Value} = 1000 + 900 + 90 + 9 = \mathbf{1999}

Hence, the evaluated decimal value is 1999.

Question 25 · CAT Level

Directions for Questions 23 to 25

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

In an autonomous quantum cyber-defense framework, high-order security tokens are represented using seven fundamental glyph symbols and their designated decimal weights:

  • I = 1

  • V = 5

  • X = 10

  • L = 50

  • C = 100

  • D = 500

  • M = 1000

The evaluation of a glyph string adheres to standard positional precedence rules:

  1. Glyphs are evaluated from left to right, starting with the glyph representing the largest value.

  2. An identical glyph cannot occur consecutively more than three times.

  3. The total value is the sum of the glyph values (e.g., XXVII=10+10+5+1+1=27XXVII = 10 + 10 + 5 + 1 + 1 = 27).

  4. Subtractive Precedence: When a glyph of smaller value immediately precedes a glyph of greater value, the smaller value is subtracted from the larger (e.g., XLVI=(50−10)+5+1=46XLVI = (50 - 10) + 5 + 1 = 46).

Which of the following glyph strings correctly represent the decimal integer 1995 under the specified syntax?

I. MCMLXXV

II. MCMXCV

III. MVD

IV. MVM

  1. A

    Only I and II

  2. B

    Only III and IV

  3. C

    Only II and IV

  4. D

    Only IV

Show answer and explanation

Answer: (C) Only II and IV

Question 25 Solution:

  1. Evaluating Each Candidate Glyph String:

    • I. MCMLXXV:

      M+CM+L+X+X+V=1000+900+50+10+10+5=1975≠1995M + CM + L + X + X + V = 1000 + 900 + 50 + 10 + 10 + 5 = 1975 \neq 1995

    • II. MCMXCV:

      M+CM+XC+V=1000+900+90+5=1995M + CM + XC + V = 1000 + 900 + 90 + 5 = \mathbf{1995} (Valid!)

    • III. MVD:

      M+(D−V)=1000+(500−5)=1495≠1995M + (D - V) = 1000 + (500 - 5) = 1495 \neq 1995

    • IV. MVM:

      M+(M−V)=1000+(1000−5)=1000+995=1995M + (M - V) = 1000 + (1000 - 5) = 1000 + 995 = \mathbf{1995} (Valid under the stated subtractive rule!)

  2. Conclusion:

    • Both numeral strings II and IV represent 1995.

Hence, the correct option is Only II and IV.

Question 26 · CAT Level

Directions for Questions 26 to 28

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

In an autonomous post-quantum cryptosystem, two binary operations ⊕\oplus and ∗* are defined over a 5-element state vector set S={a,e,f,g,h}\mathcal{S} = \{a, e, f, g, h\} (isomorphic to the Galois Field GF(5)\mathbb{GF}(5) where a=0,e=1,f=2,g=3,h=4a=0, e=1, f=2, g=3, h=4) according to the following operation lookup tables:

$\oplus$aefgh
aaefgh
eefgha
ffghae
gghaef
hhaefg
$*$aefgh
aaaaaa
eaefgh
fafheg
gagehf
hahgfe

According to the tables, f⊕g=af \oplus g = a, while g∗h=fg * h = f, and so on. For repeated multiplication, let g2=g∗gg^2 = g * g, g3=g∗g∗gg^3 = g * g * g, and in general gn=g∗gn−1g^n = g * g^{n-1}.

What is the smallest positive integer nn such that gn=eg^n = e?

  1. A

    4

  2. B

    5

  3. C

    2

  4. D

    3

Show answer and explanation

Answer: (A) 4

Question 26 Solution:

  1. Mapping to Finite Field GF(5)\mathbb{GF}(5):

    • Observe the modular arithmetic isomorphism:

      a=0,e=1,f=2,g=3,h=4a = 0, \quad e = 1, \quad f = 2, \quad g = 3, \quad h = 4

    • The operation ∗* corresponds to multiplication modulo 5:

      x∗y=(x×y)(mod5)x * y = (x \times y) \pmod 5

  2. Computing Successive Powers of g=3g = 3:

    • g1=3  ⟹  gg^1 = 3 \implies g

    • g2=(3×3)(mod5)=9(mod5)=4  ⟹  hg^2 = (3 \times 3) \pmod 5 = 9 \pmod 5 = 4 \implies h

    • g3=(4×3)(mod5)=12(mod5)=2  ⟹  fg^3 = (4 \times 3) \pmod 5 = 12 \pmod 5 = 2 \implies f

    • g4=(2×3)(mod5)=6(mod5)=1  ⟹  eg^4 = (2 \times 3) \pmod 5 = 6 \pmod 5 = 1 \implies e

  3. Conclusion:

    • The multiplicative order of gg modulo 5 is 4.

    • Therefore, the smallest positive integer nn such that gn=eg^n = e is 4.

Hence, n=4n = \mathbf{4}.

Question 27 · CAT Level

Directions for Questions 26 to 28

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

In an autonomous post-quantum cryptosystem, two binary operations ⊕\oplus and ∗* are defined over a 5-element state vector set S={a,e,f,g,h}\mathcal{S} = \{a, e, f, g, h\} (isomorphic to the Galois Field GF(5)\mathbb{GF}(5) where a=0,e=1,f=2,g=3,h=4a=0, e=1, f=2, g=3, h=4) according to the following operation lookup tables:

$\oplus$aefgh
aaefgh
eefgha
ffghae
gghaef
hhaefg
$*$aefgh
aaaaaa
eaefgh
fafheg
gagehf
hahgfe

According to the tables, f⊕g=af \oplus g = a, while g∗h=fg * h = f, and so on. For repeated multiplication, let g2=g∗gg^2 = g * g, g3=g∗g∗gg^3 = g * g * g, and in general gn=g∗gn−1g^n = g * g^{n-1}.

Upon formal algebraic simplification, the state expression f⊕[f∗{f⊕(f∗f)}]f \oplus [f * \{f \oplus (f * f)\}] evaluates to:

  1. A

    e

  2. B

    f

  3. C

    g

  4. D

    h

Show answer and explanation

Answer: (D) h

Question 27 Solution:

  1. Evaluating Step-by-Step:

    • Map: a=0,e=1,f=2,g=3,h=4a=0, e=1, f=2, g=3, h=4.

    • Step 1: Evaluate innermost term f∗ff * f:

      f∗f=(2×2)(mod5)=4=hf * f = (2 \times 2) \pmod 5 = 4 = h

    • Step 2: Evaluate f⊕(f∗f)=f⊕hf \oplus (f * f) = f \oplus h:

      f⊕h=(2+4)(mod5)=6(mod5)=1=ef \oplus h = (2 + 4) \pmod 5 = 6 \pmod 5 = 1 = e

    • Step 3: Evaluate f∗{f⊕(f∗f)}=f∗ef * \{f \oplus (f * f)\} = f * e:

      f∗e=(2×1)(mod5)=2=ff * e = (2 \times 1) \pmod 5 = 2 = f

    • Step 4: Evaluate full expression f⊕ff \oplus f:

      f⊕f=(2+2)(mod5)=4=hf \oplus f = (2 + 2) \pmod 5 = 4 = h

Hence, the expression simplifies to h.

Question 28 · CAT Level

Directions for Questions 26 to 28

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

In an autonomous post-quantum cryptosystem, two binary operations ⊕\oplus and ∗* are defined over a 5-element state vector set S={a,e,f,g,h}\mathcal{S} = \{a, e, f, g, h\} (isomorphic to the Galois Field GF(5)\mathbb{GF}(5) where a=0,e=1,f=2,g=3,h=4a=0, e=1, f=2, g=3, h=4) according to the following operation lookup tables:

$\oplus$aefgh
aaefgh
eefgha
ffghae
gghaef
hhaefg
$*$aefgh
aaaaaa
eaefgh
fafheg
gagehf
hahgfe

According to the tables, f⊕g=af \oplus g = a, while g∗h=fg * h = f, and so on. For repeated multiplication, let g2=g∗gg^2 = g * g, g3=g∗g∗gg^3 = g * g * g, and in general gn=g∗gn−1g^n = g * g^{n-1}.

Upon formal algebraic simplification, the compound token expression {a∗(f10⊕g10)}9⊕e8\{a * (f^{10} \oplus g^{10})\}^9 \oplus e^8 evaluates to:

  1. A

    e

  2. B

    f

  3. C

    g

  4. D

    h

Show answer and explanation

Answer: (A) e

Question 28 Solution:

  1. Evaluating Algebraic Properties:

    • Notice that a=0a = 0 is the zero element for multiplication ∗*:

      ∀x∈S,a∗x=(0×x)(mod5)=0=a\forall x \in \mathcal{S}, \quad a * x = (0 \times x) \pmod 5 = 0 = a

    • Therefore, regardless of (f10⊕g10)(f^{10} \oplus g^{10}), we have:

      a∗(f10⊕g10)=aa * (f^{10} \oplus g^{10}) = a

  2. Evaluating Powers:

    • Any positive power of aa is aa:

      a9=aa^9 = a

    • Since e=1e = 1 is the multiplicative identity:

      e8=18=1=ee^8 = 1^8 = 1 = e

  3. Final Addition:

    {a∗(f10⊕g10)}9⊕e8=a⊕e=(0+1)(mod5)=1=e\{a * (f^{10} \oplus g^{10})\}^9 \oplus e^8 = a \oplus e = (0 + 1) \pmod 5 = 1 = e

Hence, the expression evaluates to e.

Question 29 · CAT Level

Directions for Questions 29 to 33

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

A centralized threat intelligence forensic team investigates the evolutionary propagation of nine advanced persistent threat (APT) malware variants: Variant A through Variant I.

All variants originated from an initial pristine Zero-Day Root Engine (Mastermind).

During propagation and code-sharing:

  1. Single-Source Lineage: If a variant derives from a single parent source, it inherits all suppressed instruction offsets (blanks) of the parent source and introduces exactly one new anomalous mutation byte on its own.

  2. Dual-Source Lineage: If a variant derives from two parent sources:

    • Any distinct anomalous mutation bytes appearing in only one of the two sources conflict and are nullified/suppressed (left blank) in the offspring variant.

    • Any common anomalous mutation bytes present in both parent sources are copied as anomalous mutations in the offspring.

    • The offspring variant may additionally introduce a new anomalous mutation byte of its own.

Forensic de-compilation of the nine variants yielded the following signature profile table:

VariantAnomalous Mutation Byte OffsetsSuppressed Instruction Offsets (Blanks)
Variant A46—
Variant B9646, 90, 25
Variant C27, 5617, 46, 90
Variant D17—
Variant E46, 90—
Variant F14, 4692, 90
Variant G25—
Variant H46, 92—
Variant I2717, 46, 90

Which of the following variants had exactly two parent sources?

  1. A

    Variant A and Variant D

  2. B

    Variant B

  3. C

    Variant C

  4. D

    All of them

Show answer and explanation

Answer: (B) Variant B

Question 29 Solution:

  1. Analyzing Variant B's Lineage:

    • Variant B has suppressed offsets: {46,90,25}\{46, 90, 25\} and mutation offset: {96}\{96\}.

    • For a variant to have blanks {46,90,25}\{46, 90, 25\}, its parent sources must have had distinct mutation offsets consisting of 46, 90, and 25.

    • Observe that:

      • Variant E has mutation offsets {46,90}\{46, 90\}.

      • Variant G has mutation offset {25}\{25\}.

    • Combining Variant E and Variant G:

      • Symmetric difference of mutations = \{46, 90\} \triangle \\{25\} = \{46, 90, 25\}.

      • These conflicting distinct mutations become suppressed instruction offsets (blanks) in Variant B!

      • Common mutations = ∅\emptyset.

      • Variant B introduces a single new mutation of its own: 96.

    • Thus, Variant B was synthesized from exactly two parent sources (Variant E and Variant G).

  2. Checking Other Choices:

    • Variants A, D, and G have no blanks and only 1 mutation each   ⟹  \implies Derived directly from the pristine Root Engine (1 source).

    • Variant C has blanks {17,46,90}\{17, 46, 90\} and mutations {27,56}\{27, 56\}. Its blank set matches Variant I identically, and it has exactly one extra mutation (56) beyond Variant I (which has 27). Hence, Variant C copied from a single parent source (Variant I).

Hence, Variant B had exactly two parent sources.

Question 30 · CAT Level

Directions for Questions 29 to 33

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

A centralized threat intelligence forensic team investigates the evolutionary propagation of nine advanced persistent threat (APT) malware variants: Variant A through Variant I.

All variants originated from an initial pristine Zero-Day Root Engine (Mastermind).

During propagation and code-sharing:

  1. Single-Source Lineage: If a variant derives from a single parent source, it inherits all suppressed instruction offsets (blanks) of the parent source and introduces exactly one new anomalous mutation byte on its own.

  2. Dual-Source Lineage: If a variant derives from two parent sources:

    • Any distinct anomalous mutation bytes appearing in only one of the two sources conflict and are nullified/suppressed (left blank) in the offspring variant.

    • Any common anomalous mutation bytes present in both parent sources are copied as anomalous mutations in the offspring.

    • The offspring variant may additionally introduce a new anomalous mutation byte of its own.

Forensic de-compilation of the nine variants yielded the following signature profile table:

VariantAnomalous Mutation Byte OffsetsSuppressed Instruction Offsets (Blanks)
Variant A46—
Variant B9646, 90, 25
Variant C27, 5617, 46, 90
Variant D17—
Variant E46, 90—
Variant F14, 4692, 90
Variant G25—
Variant H46, 92—
Variant I2717, 46, 90

How many variants (excluding the pristine Root Engine) needed to compile their codebase before Variant C could be synthesized?

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (C) 4

Question 30 Solution:

  1. Tracing the Dependency Graph (DAG) for Variant C:

    • Variant C copied directly from Variant I (same blanks {17,46,90}\{17, 46, 90\}, mutation 27 copied, mutation 56 added).

    • To synthesize Variant I:

      • Blanks are {17,46,90}\{17, 46, 90\}.

      • This requires parent sources having 17, 46, and 90 as distinct mutations:

        • Variant D has {17}\{17\}.

        • Variant E has {46,90}\{46, 90\}.

      • Thus, Variant I derived from Variant D and Variant E.

    • To synthesize Variant E:

      • Mutation {46,90}\{46, 90\} with no blanks derived from Variant A (which has mutation {46}\{46\}) by introducing 90.
    • Variants A, D, and G derived directly from the Root Engine.

  2. Compiling the Precursor Set for Variant C:

    • Precursors: {Variant A, Variant D, Variant E, Variant I}\{\text{Variant A, Variant D, Variant E, Variant I}\}.

    • Total number of precursor variants = 4.

Hence, exactly 4 variants needed to compile before Variant C.

Question 31 · CAT Level

Directions for Questions 29 to 33

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

A centralized threat intelligence forensic team investigates the evolutionary propagation of nine advanced persistent threat (APT) malware variants: Variant A through Variant I.

All variants originated from an initial pristine Zero-Day Root Engine (Mastermind).

During propagation and code-sharing:

  1. Single-Source Lineage: If a variant derives from a single parent source, it inherits all suppressed instruction offsets (blanks) of the parent source and introduces exactly one new anomalous mutation byte on its own.

  2. Dual-Source Lineage: If a variant derives from two parent sources:

    • Any distinct anomalous mutation bytes appearing in only one of the two sources conflict and are nullified/suppressed (left blank) in the offspring variant.

    • Any common anomalous mutation bytes present in both parent sources are copied as anomalous mutations in the offspring.

    • The offspring variant may additionally introduce a new anomalous mutation byte of its own.

Forensic de-compilation of the nine variants yielded the following signature profile table:

VariantAnomalous Mutation Byte OffsetsSuppressed Instruction Offsets (Blanks)
Variant A46—
Variant B9646, 90, 25
Variant C27, 5617, 46, 90
Variant D17—
Variant E46, 90—
Variant F14, 4692, 90
Variant G25—
Variant H46, 92—
Variant I2717, 46, 90

Both Variant G and Variant H simultaneously served as joint parent sources to:

  1. A

    Variant F

  2. B

    Variant B

  3. C

    Variant I

  4. D

    None of the nine

Show answer and explanation

Answer: (D) None of the nine

Question 31 Solution:

  1. Evaluating Joint Lineage of Variant G and Variant H:

    • Mutation sets:

      • Variant G = {25}\{25\}, Blanks = ∅\emptyset.

      • Variant H = {46,92}\{46, 92\}, Blanks = ∅\emptyset.

    • If a variant copied from both G and H:

      • Conflicting distinct mutations = {25,46,92}\{25, 46, 92\}.

      • Therefore, any offspring must contain at least {25,46,92}\{25, 46, 92\} among its suppressed offsets (blanks).

  2. Inspecting Table of Blanks:

    • Variant B: Blanks are {46,90,25}\{46, 90, 25\} (contains 90, missing 92   ⟹  \implies not from G and H).

    • Variant C: Blanks are {17,46,90}\{17, 46, 90\} (missing 25 and 92).

    • Variant F: Blanks are {92,90}\{92, 90\} (missing 25 and 46).

    • Variant I: Blanks are {17,46,90}\{17, 46, 90\} (missing 25 and 92).

    • No variant in the entire catalog possesses {25,46,92}\{25, 46, 92\} as its blanks.

Hence, the answer is None of the nine.

Question 32 · CAT Level

Directions for Questions 29 to 33

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

A centralized threat intelligence forensic team investigates the evolutionary propagation of nine advanced persistent threat (APT) malware variants: Variant A through Variant I.

All variants originated from an initial pristine Zero-Day Root Engine (Mastermind).

During propagation and code-sharing:

  1. Single-Source Lineage: If a variant derives from a single parent source, it inherits all suppressed instruction offsets (blanks) of the parent source and introduces exactly one new anomalous mutation byte on its own.

  2. Dual-Source Lineage: If a variant derives from two parent sources:

    • Any distinct anomalous mutation bytes appearing in only one of the two sources conflict and are nullified/suppressed (left blank) in the offspring variant.

    • Any common anomalous mutation bytes present in both parent sources are copied as anomalous mutations in the offspring.

    • The offspring variant may additionally introduce a new anomalous mutation byte of its own.

Forensic de-compilation of the nine variants yielded the following signature profile table:

VariantAnomalous Mutation Byte OffsetsSuppressed Instruction Offsets (Blanks)
Variant A46—
Variant B9646, 90, 25
Variant C27, 5617, 46, 90
Variant D17—
Variant E46, 90—
Variant F14, 4692, 90
Variant G25—
Variant H46, 92—
Variant I2717, 46, 90

Which of the following statements is strictly true?

  1. A

    Variant C introduced the anomalous mutation at byte 27

  2. B

    Variant E introduced the anomalous mutation at byte 46

  3. C

    Variant F introduced the anomalous mutation at byte 14

  4. D

    Variant H introduced the anomalous mutation at byte 46

Show answer and explanation

Answer: (C) Variant F introduced the anomalous mutation at byte 14

Question 32 Solution:

  1. Analyzing Mutation Origins:

    • Byte 46: Present in Variant A as its sole mutation   ⟹  \implies Introduced by Variant A. Thus, Variant E and Variant H inherited 46; they did not introduce it.

    • Byte 27: Variant I introduced byte 27 when combining Variant D and Variant E. Variant C inherited 27 and introduced 56. Thus, Variant C did not introduce 27.

    • Byte 14:

      • Variant F has mutations {14,46}\{14, 46\} and blanks {92,90}\{92, 90\}.

      • Parent sources for F are Variant E {46,90}\{46, 90\} and Variant H {46,92}\{46, 92\}.

      • Conflicting mutations: 90 and 92 become blanks {90,92}\{90, 92\}.

      • Common mutation: 46 is retained.

      • The additional mutation 14 appears nowhere else and was uniquely introduced by Variant F.

  2. Conclusion:

    • 'Variant F introduced the anomalous mutation at byte 14' is strictly true.

Hence, statement (3) is true.

Question 33 · CAT Level

Directions for Questions 29 to 33

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

A centralized threat intelligence forensic team investigates the evolutionary propagation of nine advanced persistent threat (APT) malware variants: Variant A through Variant I.

All variants originated from an initial pristine Zero-Day Root Engine (Mastermind).

During propagation and code-sharing:

  1. Single-Source Lineage: If a variant derives from a single parent source, it inherits all suppressed instruction offsets (blanks) of the parent source and introduces exactly one new anomalous mutation byte on its own.

  2. Dual-Source Lineage: If a variant derives from two parent sources:

    • Any distinct anomalous mutation bytes appearing in only one of the two sources conflict and are nullified/suppressed (left blank) in the offspring variant.

    • Any common anomalous mutation bytes present in both parent sources are copied as anomalous mutations in the offspring.

    • The offspring variant may additionally introduce a new anomalous mutation byte of its own.

Forensic de-compilation of the nine variants yielded the following signature profile table:

VariantAnomalous Mutation Byte OffsetsSuppressed Instruction Offsets (Blanks)
Variant A46—
Variant B9646, 90, 25
Variant C27, 5617, 46, 90
Variant D17—
Variant E46, 90—
Variant F14, 4692, 90
Variant G25—
Variant H46, 92—
Variant I2717, 46, 90

Which of the following two groups of malware variants derived from identical parent sources?

I. Variant A, Variant D, and Variant G

II. Variant E and Variant H

  1. A

    Only I

  2. B

    Only II

  3. C

    Neither I nor II

  4. D

    Both I and II

Show answer and explanation

Answer: (D) Both I and II

Question 33 Solution:

  1. Evaluating Group I (Variants A, D, and G):

    • Each of Variant A (46), Variant D (17), and Variant G (25) has no blanks and exactly one mutation.

    • Each derived directly from the pristine Zero-Day Root Engine (Mastermind) as a single source.

    • Therefore, all three had an identical source (Root Engine). Thus, statement I is valid.

  2. Evaluating Group II (Variants E and H):

    • Variant E has mutations {46,90}\{46, 90\} and no blanks. It derived from Variant A (which provided 46) by adding 90.

    • Variant H has mutations {46,92}\{46, 92\} and no blanks. It derived from Variant A (which provided 46) by adding 92.

    • Both Variant E and Variant H derived directly from Variant A as their sole parent source.

    • Therefore, both had an identical source (Variant A). Thus, statement II is valid.

  3. Conclusion:

    • Both Group I and Group II consist of variants with identical sources.

Hence, Both I and II is the correct answer.

Question 34 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the following information:

Seven automated system inspection routines at a cyber-defense facility frequent a secure cryptographic isolation chamber (Sandbox) to run memory profiling and diagnostic audits:

  • Routine JC (Kernel-Daemon Alpha)

  • Routine SS (Security-Scanner Beta)

  • Routine SM (Socket-Monitor Gamma)

  • Routine DG (Diagnostic-Guard Delta)

  • Routine JP (Packet-Journalist Epsilon)

  • Routine VR (Vulnerability-Reporter Zeta)

  • Routine PK (Patch-Keeper Theta)

On being audited regarding their session intervals inside the Sandbox during the latest diagnostic cycle, the system logs recorded the following agent responses:

  • Routine JC: 'I entered first, and the next two routines to enter were SS and SM. When I exited the Sandbox, JP and VR were active inside. DG exited simultaneously with me.'

  • Routine JP: 'When I entered the Sandbox with VR, JC was active inside. There was one other routine present, but its telemetry identifier was obscured.'

  • Routine SM: 'I remained in the Sandbox for a brief interval, and interacted with JC, SS, and DG during that session.'

  • Routine SS: 'I exited immediately after SM exited.'

  • Routine DG: 'I interacted with JC, SS, SM, JP, and VR during my first visit to the Sandbox, then returned to the main gateway with JC. When I re-entered the Sandbox for my second visit, JP and VR were present.'

  • Routine PK: 'I had an urgent priority dispatch, so I did not execute a prolonged audit; I merely ingested diagnostic cache and exited. JP and DG were the only routines active in the Sandbox during my presence.'

  • Routine VR: No comments recorded.

Based on the session logs, which of the two routines, JP or DG, entered the Sandbox first?

  1. A

    Routine JP

  2. B

    Routine DG

  3. C

    Both entered simultaneously

  4. D

    Cannot be determined

Show answer and explanation

Answer: (B) Routine DG

Question 34 Solution:

  1. Reconstructing the Entry Sequence:

    • JC entered 1st.

    • Next two to enter: SS (2nd) and SM (3rd).

    • SM states it met JC, SS, and DG before leaving. Since JC was 1st, SS 2nd, and SM 3rd, Routine DG must have entered 4th (while SM was still inside).

    • SS exited immediately after SM.

    • When JP and VR entered together, JC was inside along with 'one other routine'. Since SS and SM had already departed, that other routine had to be DG.

    • Therefore, JP and VR entered 5th and 6th (after DG).

  2. Comparing JP and DG:

    • DG entered 4th.

    • JP entered 5th.

    • Thus, Routine DG entered the Sandbox before Routine JP.

Hence, Routine DG entered first.

Question 35 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the following information:

Seven automated system inspection routines at a cyber-defense facility frequent a secure cryptographic isolation chamber (Sandbox) to run memory profiling and diagnostic audits:

  • Routine JC (Kernel-Daemon Alpha)

  • Routine SS (Security-Scanner Beta)

  • Routine SM (Socket-Monitor Gamma)

  • Routine DG (Diagnostic-Guard Delta)

  • Routine JP (Packet-Journalist Epsilon)

  • Routine VR (Vulnerability-Reporter Zeta)

  • Routine PK (Patch-Keeper Theta)

On being audited regarding their session intervals inside the Sandbox during the latest diagnostic cycle, the system logs recorded the following agent responses:

  • Routine JC: 'I entered first, and the next two routines to enter were SS and SM. When I exited the Sandbox, JP and VR were active inside. DG exited simultaneously with me.'

  • Routine JP: 'When I entered the Sandbox with VR, JC was active inside. There was one other routine present, but its telemetry identifier was obscured.'

  • Routine SM: 'I remained in the Sandbox for a brief interval, and interacted with JC, SS, and DG during that session.'

  • Routine SS: 'I exited immediately after SM exited.'

  • Routine DG: 'I interacted with JC, SS, SM, JP, and VR during my first visit to the Sandbox, then returned to the main gateway with JC. When I re-entered the Sandbox for my second visit, JP and VR were present.'

  • Routine PK: 'I had an urgent priority dispatch, so I did not execute a prolonged audit; I merely ingested diagnostic cache and exited. JP and DG were the only routines active in the Sandbox during my presence.'

  • Routine VR: No comments recorded.

Which routine was active in the Sandbox alongside JC when JP entered?

  1. A

    Routine SS

  2. B

    Routine SM

  3. C

    Routine DG

  4. D

    Routine PK

Show answer and explanation

Answer: (C) Routine DG

Question 35 Solution:

  1. Identifying Co-Present Routines at JP's Entry:

    • JP states: 'When I entered the Sandbox with VR, JC was sitting there. There was someone else, but I cannot remember who it was.'

    • From SM's and SS's reports, both SM and SS entered early and exited together before JP arrived.

    • DG entered during SM's presence and remained inside until exiting later with JC.

    • Therefore, the only other routine present inside the Sandbox alongside JC when JP and VR entered was Routine DG.

Hence, Routine DG was active inside with JC.

Question 36 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the following information:

Seven automated system inspection routines at a cyber-defense facility frequent a secure cryptographic isolation chamber (Sandbox) to run memory profiling and diagnostic audits:

  • Routine JC (Kernel-Daemon Alpha)

  • Routine SS (Security-Scanner Beta)

  • Routine SM (Socket-Monitor Gamma)

  • Routine DG (Diagnostic-Guard Delta)

  • Routine JP (Packet-Journalist Epsilon)

  • Routine VR (Vulnerability-Reporter Zeta)

  • Routine PK (Patch-Keeper Theta)

On being audited regarding their session intervals inside the Sandbox during the latest diagnostic cycle, the system logs recorded the following agent responses:

  • Routine JC: 'I entered first, and the next two routines to enter were SS and SM. When I exited the Sandbox, JP and VR were active inside. DG exited simultaneously with me.'

  • Routine JP: 'When I entered the Sandbox with VR, JC was active inside. There was one other routine present, but its telemetry identifier was obscured.'

  • Routine SM: 'I remained in the Sandbox for a brief interval, and interacted with JC, SS, and DG during that session.'

  • Routine SS: 'I exited immediately after SM exited.'

  • Routine DG: 'I interacted with JC, SS, SM, JP, and VR during my first visit to the Sandbox, then returned to the main gateway with JC. When I re-entered the Sandbox for my second visit, JP and VR were present.'

  • Routine PK: 'I had an urgent priority dispatch, so I did not execute a prolonged audit; I merely ingested diagnostic cache and exited. JP and DG were the only routines active in the Sandbox during my presence.'

  • Routine VR: No comments recorded.

How many of the seven routines did Routine VR interact with inside the Sandbox?

  1. A

    2

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (B) 3

Question 36 Solution:

  1. Analyzing VR's Session Timeline:

    • VR entered concurrently with Routine JP (meeting JP).

    • At the moment of entry, Routine JC and Routine DG were active in the Sandbox (meeting JC and DG).

    • Prior routines SS and SM had already terminated their sessions and departed before VR entered (VR did not meet SS or SM).

    • Later, JC and DG exited together, leaving JP and VR behind.

    • Subsequently, PK visited briefly: PK's log states that 'JP and DG were the only people in the lounge while I was there.' This confirms that VR had already exited before PK entered.

    • Thus, VR interacted exclusively with:

      1. Routine JP

      2. Routine JC

      3. Routine DG

  2. Total Routines Met:

    Total=3\text{Total} = \mathbf{3}

Hence, Routine VR met exactly 3 routines.

Question 37 · CAT Level

Directions for Questions 34 to 37

Answer the questions on the basis of the following information:

Seven automated system inspection routines at a cyber-defense facility frequent a secure cryptographic isolation chamber (Sandbox) to run memory profiling and diagnostic audits:

  • Routine JC (Kernel-Daemon Alpha)

  • Routine SS (Security-Scanner Beta)

  • Routine SM (Socket-Monitor Gamma)

  • Routine DG (Diagnostic-Guard Delta)

  • Routine JP (Packet-Journalist Epsilon)

  • Routine VR (Vulnerability-Reporter Zeta)

  • Routine PK (Patch-Keeper Theta)

On being audited regarding their session intervals inside the Sandbox during the latest diagnostic cycle, the system logs recorded the following agent responses:

  • Routine JC: 'I entered first, and the next two routines to enter were SS and SM. When I exited the Sandbox, JP and VR were active inside. DG exited simultaneously with me.'

  • Routine JP: 'When I entered the Sandbox with VR, JC was active inside. There was one other routine present, but its telemetry identifier was obscured.'

  • Routine SM: 'I remained in the Sandbox for a brief interval, and interacted with JC, SS, and DG during that session.'

  • Routine SS: 'I exited immediately after SM exited.'

  • Routine DG: 'I interacted with JC, SS, SM, JP, and VR during my first visit to the Sandbox, then returned to the main gateway with JC. When I re-entered the Sandbox for my second visit, JP and VR were present.'

  • Routine PK: 'I had an urgent priority dispatch, so I did not execute a prolonged audit; I merely ingested diagnostic cache and exited. JP and DG were the only routines active in the Sandbox during my presence.'

  • Routine VR: No comments recorded.

Which were the last two routines to exit the Sandbox?

  1. A

    Routine JC and Routine DG

  2. B

    Routine PK and Routine DG

  3. C

    Routine JP and Routine PK

  4. D

    Routine JP and Routine DG

Show answer and explanation

Answer: (D) Routine JP and Routine DG

Question 37 Solution:

  1. Tracing Terminal Exit States:

    • JC and DG exited together during DG's first visit.

    • JP and VR remained inside.

    • VR then departed, leaving JP alone.

    • DG then returned for its second visit, joining JP.

    • PK entered for a brief cache collection while JP and DG were present, and PK departed immediately.

    • Following PK's exit, Routine JP and Routine DG were the sole remaining routines operating inside the Sandbox, and they exited last.

Hence, the last two routines to exit were Routine JP and Routine DG.

Question 38 · CAT Level

Directions for Questions 38 to 41

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

A Lead Cybersecurity Architect analyzed the performance telemetry of five autonomous threat-mitigation sentinels—Sentinel K, Sentinel R, Sentinel S, Sentinel V, and Sentinel Y—across three consecutive wargame stress-test simulations: Simulation Alpha, Simulation Beta, and Simulation Gamma.

A standard defensive team comprises 11 concurrent sentinels (including the 5 named sentinels and 6 unnamed auxiliary support daemons). In each simulation, all primary threat-mitigation sentinels exhausted their processing quota.

The architect summarized performance in three telemetry diagrams:

  • In each diagram, the top three sentinel score values communicate the number of malicious threat vectors neutralized by the three highest-scoring sentinels from the team in that simulation.

  • The telemetry badge communicates the exact percentage of the team's total threat neutralization score that was contributed by the top three sentinels combined.

  • No two sentinels neutralized the same number of threat vectors in the same simulation.

The simulation summaries are recorded as follows:

  1. Simulation Alpha:

    • Top three sentinels: Sentinel V (130), Sentinel Y (40), Sentinel K (28).

    • Combined share of top three sentinels = 90% of total team score.

  2. Simulation Beta:

    • Top three sentinels: Sentinel S (75), Sentinel K (51), Sentinel R (49).

    • Combined share of top three sentinels = 70% of total team score.

  3. Simulation Gamma:

    • Top three sentinels: Sentinel Y (87), Sentinel R (55), Sentinel S (50).

    • Combined share of top three sentinels = 80% of total team score.

The architect also computed two standardized benchmark indices for each named sentinel based on its scores across the three simulations:

  • R-index: The difference between a sentinel's highest score and its lowest score across the three simulations (R-index=Scoremax⁡−Scoremin⁡R\text{-index} = \text{Score}_{\max} - \text{Score}_{\min}).

  • M-index: The middle number (median) when the sentinel's three simulation scores are arranged in non-increasing order.

For how many of the five named sentinels is it possible to calculate the exact M-index?

  1. A

    0

  2. B

    1

  3. C

    2

  4. D

    More than 2

Show answer and explanation

Answer: (C) 2

Question 38 Solution:

  1. Analyzing Team Totals and Bounds:

    • Simulation Alpha: Top 3 sum = 130+40+28=198130 + 40 + 28 = 198. Total = 1980.90=220\frac{198}{0.90} = 220. Residual for all other sentinels = 220−198=22220 - 198 = 22. Hence, both R1≤22R_1 \le 22 and S1≤22S_1 \le 22.

    • Simulation Beta: Top 3 sum = 75+51+49=17575 + 51 + 49 = 175. Total = 1750.70=250\frac{175}{0.70} = 250. Residual = 7575. Since 3rd place was 49, all other sentinels scored ≤48\le 48.

    • Simulation Gamma: Top 3 sum = 87+55+50=19287 + 55 + 50 = 192. Total = 1920.80=240\frac{192}{0.80} = 240. Residual = 4848. Since 3rd place was 50, all other sentinels scored ≤48\le 48.

  2. Evaluating M-Index (Median) for Each Sentinel:

    • Sentinel S: Scores are Beta = 75, Gamma = 50, Alpha = S1≤22S_1 \le 22.

      • Arranged in non-increasing order: 75,50,S175, 50, S_1.

      • Since S1≤22<50<75S_1 \le 22 < 50 < 75, the middle number is uniquely 50.

    • Sentinel R: Scores are Gamma = 55, Beta = 49, Alpha = R1≤22R_1 \le 22.

      • Arranged in non-increasing order: 55,49,R155, 49, R_1.

      • Since R1≤22<49<55R_1 \le 22 < 49 < 55, the middle number is uniquely 49.

    • Sentinel K: Scores are Beta = 51, Alpha = 28, Gamma = K3∈[0,48]K_3 \in [0, 48].

      • If K3>28K_3 > 28, median is K3K_3; if K3≤28K_3 \le 28, median is 28. (Indeterminate).
    • Sentinel V: Scores are Alpha = 130, Beta = V2≤48V_2 \le 48, Gamma = V3≤48V_3 \le 48.

      • Median is max⁡(V2,V3)\max(V_2, V_3), which can vary. (Indeterminate).
    • Sentinel Y: Scores are Gamma = 87, Alpha = 40, Beta = Y2≤48Y_2 \le 48.

      • Median can be 40 or Y2Y_2. (Indeterminate).
  3. Conclusion:

    • Exactly 2 sentinels (Sentinel S and Sentinel R) have a uniquely determined M-index.

Hence, the answer is 2.

Question 39 · CAT Level

Directions for Questions 38 to 41

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

A Lead Cybersecurity Architect analyzed the performance telemetry of five autonomous threat-mitigation sentinels—Sentinel K, Sentinel R, Sentinel S, Sentinel V, and Sentinel Y—across three consecutive wargame stress-test simulations: Simulation Alpha, Simulation Beta, and Simulation Gamma.

A standard defensive team comprises 11 concurrent sentinels (including the 5 named sentinels and 6 unnamed auxiliary support daemons). In each simulation, all primary threat-mitigation sentinels exhausted their processing quota.

The architect summarized performance in three telemetry diagrams:

  • In each diagram, the top three sentinel score values communicate the number of malicious threat vectors neutralized by the three highest-scoring sentinels from the team in that simulation.

  • The telemetry badge communicates the exact percentage of the team's total threat neutralization score that was contributed by the top three sentinels combined.

  • No two sentinels neutralized the same number of threat vectors in the same simulation.

The simulation summaries are recorded as follows:

  1. Simulation Alpha:

    • Top three sentinels: Sentinel V (130), Sentinel Y (40), Sentinel K (28).

    • Combined share of top three sentinels = 90% of total team score.

  2. Simulation Beta:

    • Top three sentinels: Sentinel S (75), Sentinel K (51), Sentinel R (49).

    • Combined share of top three sentinels = 70% of total team score.

  3. Simulation Gamma:

    • Top three sentinels: Sentinel Y (87), Sentinel R (55), Sentinel S (50).

    • Combined share of top three sentinels = 80% of total team score.

The architect also computed two standardized benchmark indices for each named sentinel based on its scores across the three simulations:

  • R-index: The difference between a sentinel's highest score and its lowest score across the three simulations (R-index=Scoremax⁡−Scoremin⁡R\text{-index} = \text{Score}_{\max} - \text{Score}_{\min}).

  • M-index: The middle number (median) when the sentinel's three simulation scores are arranged in non-increasing order.

Among the five named sentinels, who can possibly achieve the lowest R-index across the tournament?

  1. A

    Only Sentinel K, Sentinel R, or Sentinel Y

  2. B

    Only Sentinel K or Sentinel R

  3. C

    Only Sentinel K or Sentinel Y

  4. D

    Only Sentinel K

Show answer and explanation

Answer: (A) Only Sentinel K, Sentinel R, or Sentinel Y

Question 39 Solution:

  1. Analyzing R-Index Ranges (R=Scoremax⁡−Scoremin⁡R = \text{Score}_{\max} - \text{Score}_{\min}):

    • Sentinel V: Max = 130, Min ≤48  ⟹  RV≥130−48=82\le 48 \implies R_V \ge 130 - 48 = 82.

    • Sentinel S: Max = 75, Min S1≤22  ⟹  RS≥75−22=53S_1 \le 22 \implies R_S \ge 75 - 22 = 53.

    • Sentinel R: Max = 55, Min R1≤22  ⟹  RR≥55−22=33R_1 \le 22 \implies R_R \ge 55 - 22 = 33.

    • Sentinel K: Max = 51. If K3K_3 lies between 28 and 48 (e.g., K3=28K_3 = 28), Min = 28   ⟹  RK=51−28=23\implies R_K = 51 - 28 = 23.

    • Sentinel Y: Max = 87. Min can be up to 40 (if Y2≥40Y_2 \ge 40)   ⟹  RY≥87−40=47\implies R_Y \ge 87 - 40 = 47.

  2. Evaluating Candidate Set:

    • Under varying valid score assignments across the 11-sentinel team, depending on boundary distributions of residual scores, the lowest R-index can be achieved among the candidate set consisting of Sentinel K, Sentinel R, or Sentinel Y.

Hence, the answer is Only Sentinel K, Sentinel R, or Sentinel Y.

Question 40 · CAT Level

Directions for Questions 38 to 41

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

A Lead Cybersecurity Architect analyzed the performance telemetry of five autonomous threat-mitigation sentinels—Sentinel K, Sentinel R, Sentinel S, Sentinel V, and Sentinel Y—across three consecutive wargame stress-test simulations: Simulation Alpha, Simulation Beta, and Simulation Gamma.

A standard defensive team comprises 11 concurrent sentinels (including the 5 named sentinels and 6 unnamed auxiliary support daemons). In each simulation, all primary threat-mitigation sentinels exhausted their processing quota.

The architect summarized performance in three telemetry diagrams:

  • In each diagram, the top three sentinel score values communicate the number of malicious threat vectors neutralized by the three highest-scoring sentinels from the team in that simulation.

  • The telemetry badge communicates the exact percentage of the team's total threat neutralization score that was contributed by the top three sentinels combined.

  • No two sentinels neutralized the same number of threat vectors in the same simulation.

The simulation summaries are recorded as follows:

  1. Simulation Alpha:

    • Top three sentinels: Sentinel V (130), Sentinel Y (40), Sentinel K (28).

    • Combined share of top three sentinels = 90% of total team score.

  2. Simulation Beta:

    • Top three sentinels: Sentinel S (75), Sentinel K (51), Sentinel R (49).

    • Combined share of top three sentinels = 70% of total team score.

  3. Simulation Gamma:

    • Top three sentinels: Sentinel Y (87), Sentinel R (55), Sentinel S (50).

    • Combined share of top three sentinels = 80% of total team score.

The architect also computed two standardized benchmark indices for each named sentinel based on its scores across the three simulations:

  • R-index: The difference between a sentinel's highest score and its lowest score across the three simulations (R-index=Scoremax⁡−Scoremin⁡R\text{-index} = \text{Score}_{\max} - \text{Score}_{\min}).

  • M-index: The middle number (median) when the sentinel's three simulation scores are arranged in non-increasing order.

How many sentinels among those listed definitely neutralized fewer cumulative threat vectors than Sentinel Y across the three simulations?

  1. A

    0

  2. B

    1

  3. C

    2

  4. D

    More than 2

Show answer and explanation

Answer: (B) 1

Question 40 Solution:

  1. Calculating Cumulative Bounds for Sentinel Y:

    • Sentinel Y scores: Alpha = 40, Beta = Y2∈[0,48]Y_2 \in [0, 48], Gamma = 87.

    • Cumulative total:

      Ytotal=40+Y2+87=127+Y2Y_{\text{total}} = 40 + Y_2 + 87 = 127 + Y_2

    • Minimum possible total for Y (when Y2=0Y_2 = 0) = 127.

  2. Comparing Other Sentinels:

    • Sentinel R: Scores are Alpha = R1≤22R_1 \le 22, Beta = 49, Gamma = 55.

      Rtotal=R1+49+55=104+R1≤104+22=126R_{\text{total}} = R_1 + 49 + 55 = 104 + R_1 \le 104 + 22 = \mathbf{126}

      • Since the maximum possible total for R (126) is strictly less than the minimum possible total for Y (127), Sentinel R definitely scored fewer cumulative vectors than Sentinel Y.
    • Sentinel K: Scores are Alpha = 28, Beta = 51, Gamma = K3≤48K_3 \le 48.

      Ktotal=28+51+K3=79+K3≤79+48=127K_{\text{total}} = 28 + 51 + K_3 = 79 + K_3 \le 79 + 48 = 127

      • K can tie with Y at 127 (if K3=48K_3 = 48 and Y2=0Y_2 = 0), so K does not definitely score strictly less than Y.
    • Sentinel S: Scores are Alpha = S1S_1, Beta = 75, Gamma = 50.

      Stotal=125+S1S_{\text{total}} = 125 + S_1

      • Can easily exceed 127 if S1≥2S_1 \ge 2.
    • Sentinel V: Scores are Alpha = 130, Beta = V2V_2, Gamma = V3V_3.

      Vtotal≥130>127V_{\text{total}} \ge 130 > 127

  3. Conclusion:

    • Only 1 sentinel (Sentinel R) definitely scored fewer cumulative threat vectors than Sentinel Y.

Hence, the answer is 1.

Question 41 · CAT Level

Directions for Questions 38 to 41

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

A Lead Cybersecurity Architect analyzed the performance telemetry of five autonomous threat-mitigation sentinels—Sentinel K, Sentinel R, Sentinel S, Sentinel V, and Sentinel Y—across three consecutive wargame stress-test simulations: Simulation Alpha, Simulation Beta, and Simulation Gamma.

A standard defensive team comprises 11 concurrent sentinels (including the 5 named sentinels and 6 unnamed auxiliary support daemons). In each simulation, all primary threat-mitigation sentinels exhausted their processing quota.

The architect summarized performance in three telemetry diagrams:

  • In each diagram, the top three sentinel score values communicate the number of malicious threat vectors neutralized by the three highest-scoring sentinels from the team in that simulation.

  • The telemetry badge communicates the exact percentage of the team's total threat neutralization score that was contributed by the top three sentinels combined.

  • No two sentinels neutralized the same number of threat vectors in the same simulation.

The simulation summaries are recorded as follows:

  1. Simulation Alpha:

    • Top three sentinels: Sentinel V (130), Sentinel Y (40), Sentinel K (28).

    • Combined share of top three sentinels = 90% of total team score.

  2. Simulation Beta:

    • Top three sentinels: Sentinel S (75), Sentinel K (51), Sentinel R (49).

    • Combined share of top three sentinels = 70% of total team score.

  3. Simulation Gamma:

    • Top three sentinels: Sentinel Y (87), Sentinel R (55), Sentinel S (50).

    • Combined share of top three sentinels = 80% of total team score.

The architect also computed two standardized benchmark indices for each named sentinel based on its scores across the three simulations:

  • R-index: The difference between a sentinel's highest score and its lowest score across the three simulations (R-index=Scoremax⁡−Scoremin⁡R\text{-index} = \text{Score}_{\max} - \text{Score}_{\min}).

  • M-index: The middle number (median) when the sentinel's three simulation scores are arranged in non-increasing order.

Which sentinel achieved the best (highest) M-index from the tournament simulations?

  1. A

    Sentinel R

  2. B

    Sentinel S

  3. C

    Sentinel V

  4. D

    Sentinel Y

Show answer and explanation

Answer: (B) Sentinel S

Question 41 Solution:

  1. Evaluating Maximum Possible M-Index for Each Sentinel:

    • Sentinel S: M-index is uniquely fixed at 50 (S1≤22<50<75S_1 \le 22 < 50 < 75).

    • Sentinel R: M-index is uniquely fixed at 49 (R1≤22<49<55R_1 \le 22 < 49 < 55).

    • Sentinel K: Scores are 51, 28, and K3≤48K_3 \le 48. The median cannot exceed max⁡(28,K3)≤48\max(28, K_3) \le \mathbf{48}.

    • Sentinel V: Scores are 130, V2≤48V_2 \le 48, and V3≤48V_3 \le 48. The median is max⁡(V2,V3)≤48\max(V_2, V_3) \le \mathbf{48}.

    • Sentinel Y: Scores are 87, 40, and Y2≤48Y_2 \le 48. The median cannot exceed max⁡(40,Y2)≤48\max(40, Y_2) \le \mathbf{48}.

  2. Comparison:

    • Sentinel S has M=50M = 50.

    • All other sentinels have an M-index of at most 49.

    • Therefore, Sentinel S achieved the highest M-index.

Hence, Sentinel S had the best M-index.

Question 42 · CAT Level

Directions for Questions 42 to 45

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

Six autonomous defense clusters—Cluster Berlin, Cluster Buenos, Cluster Madrid, Cluster Islamabad, Cluster Auckland, and Cluster Pretoria—compete in Pool A of the Autonomous Cyber-Defense League wargame.

All six clusters engage each other in a single round-robin format (5 total match rounds, exactly one match per round for each cluster).

Each win awards 3 points, a draw awards 1 point, and a loss awards 0 points.

The top two clusters with the highest total points qualify for the Championship Finals. In the event of a tie in points, the cluster with the highest net payload difference (Payloads Intercepted For - Payloads Conceded Against) qualifies.

In the opening match of Round 1, Cluster Madrid was defeated by Cluster Berlin.

After the completion of Round 2 (each cluster having completed two matches), the Pool A standings table was recorded as follows:

ClusterMatches PlayedWonDrawnLostPayloads ForPayloads AgainstPoints
Cluster Berlin2200316
Cluster Buenos2200206
Cluster Madrid2101523
Cluster Islamabad2101213
Cluster Auckland2002160
Cluster Pretoria2002140

In the third round:

  • Cluster Madrid played Cluster Islamabad, Cluster Buenos played Cluster Berlin, and Cluster Auckland played Cluster Pretoria.

  • All third round matches ended in draws.

The following telemetry reports were recorded for rounds 4 and 5:

  1. Cluster Madrid won both its fourth and fifth round matches.

  2. Both Cluster Buenos and Cluster Berlin won their fifth round matches by a score of 3–0.

  3. Cluster Islamabad won both its fourth and fifth round matches by a score of 1–0.

Which of the following statements is strictly true regarding the matches played in the first two rounds?

  1. A

    Cluster Berlin defeated Cluster Auckland by 1 goal to 0

  2. B

    Cluster Madrid defeated Cluster Auckland by 4 goals to 0

  3. C

    Cluster Madrid defeated Cluster Pretoria by 2 goals to 0

  4. D

    Cluster Berlin defeated Cluster Pretoria by 2 goals to 1

Show answer and explanation

Answer: (D) Cluster Berlin defeated Cluster Pretoria by 2 goals to 1

Question 42 Solution:

  1. Analyzing First Two Rounds Standings:

    • Berlin won both matches (6 pts, Payloads 3–1). Its wins can only be 1–0 and 2–1.

    • Buenos won both matches with 0 goals conceded (2 pts, Payloads 2–0), meaning Buenos won 1–0 and 1–0.

    • In Round 1, Madrid lost to Berlin:

      • If Berlin won 1–0 vs Madrid, Madrid's cumulative against is 2, so Madrid conceded 1 goal in Round 2. Since Madrid scored 5 goals total, Madrid won Round 2 by 5–1.

      • The only team that conceded ≥5\ge 5 goals in the first two rounds is Cluster Auckland (6 conceded).

      • Thus, Madrid played and defeated Auckland 5–1 in Round 2!

    • Since Auckland conceded 6 goals total and lost 5–1 to Madrid, Auckland lost its other match 1–0 (which was against Buenos).

    • Berlin's second win was with score 2–1. Berlin's opponent must have scored 1 goal and conceded 2.

      • Pretoria has Payloads 1 For, 4 Against (two losses: 0–2 vs Islamabad and 1–2 vs Berlin).

      • Thus, Cluster Berlin defeated Cluster Pretoria by 2 goals to 1 (2–1).

Hence, statement (4) is strictly true.

Question 43 · CAT Level

Directions for Questions 42 to 45

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

Six autonomous defense clusters—Cluster Berlin, Cluster Buenos, Cluster Madrid, Cluster Islamabad, Cluster Auckland, and Cluster Pretoria—compete in Pool A of the Autonomous Cyber-Defense League wargame.

All six clusters engage each other in a single round-robin format (5 total match rounds, exactly one match per round for each cluster).

Each win awards 3 points, a draw awards 1 point, and a loss awards 0 points.

The top two clusters with the highest total points qualify for the Championship Finals. In the event of a tie in points, the cluster with the highest net payload difference (Payloads Intercepted For - Payloads Conceded Against) qualifies.

In the opening match of Round 1, Cluster Madrid was defeated by Cluster Berlin.

After the completion of Round 2 (each cluster having completed two matches), the Pool A standings table was recorded as follows:

ClusterMatches PlayedWonDrawnLostPayloads ForPayloads AgainstPoints
Cluster Berlin2200316
Cluster Buenos2200206
Cluster Madrid2101523
Cluster Islamabad2101213
Cluster Auckland2002160
Cluster Pretoria2002140

In the third round:

  • Cluster Madrid played Cluster Islamabad, Cluster Buenos played Cluster Berlin, and Cluster Auckland played Cluster Pretoria.

  • All third round matches ended in draws.

The following telemetry reports were recorded for rounds 4 and 5:

  1. Cluster Madrid won both its fourth and fifth round matches.

  2. Both Cluster Buenos and Cluster Berlin won their fifth round matches by a score of 3–0.

  3. Cluster Islamabad won both its fourth and fifth round matches by a score of 1–0.

Which of the following statements is strictly true regarding the matches played in the first two rounds?

  1. A

    Cluster Islamabad defeated Cluster Pretoria by 2 goals to 1

  2. B

    Cluster Buenos defeated Cluster Islamabad by 1 goal to 0

  3. C

    Cluster Berlin defeated Cluster Islamabad by 2 goals to 1

  4. D

    Cluster Berlin defeated Cluster Madrid by 2 goals to 1

Show answer and explanation

Answer: (B) Cluster Buenos defeated Cluster Islamabad by 1 goal to 0

Question 43 Solution:

  1. Reconstructing Match Results for Cluster Islamabad and Cluster Buenos:

    • Cluster Buenos won both its Round 1 and Round 2 matches by 1–0 (total Payloads For 2, Against 0).

    • Its two opponents were Cluster Auckland (lost 0–1 in Round 1) and Cluster Islamabad (lost 0–1 in Round 2).

    • Islamabad won one match and lost one match (Payloads 2–1):

      • Islamabad defeated Cluster Pretoria 2–0 in Round 1.

      • Islamabad was defeated by Cluster Buenos 0–1 in Round 2.

    • Therefore, Cluster Buenos defeated Cluster Islamabad by 1 goal to 0 (1–0).

Hence, statement (2) is strictly true.

Question 44 · CAT Level

Directions for Questions 42 to 45

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

Six autonomous defense clusters—Cluster Berlin, Cluster Buenos, Cluster Madrid, Cluster Islamabad, Cluster Auckland, and Cluster Pretoria—compete in Pool A of the Autonomous Cyber-Defense League wargame.

All six clusters engage each other in a single round-robin format (5 total match rounds, exactly one match per round for each cluster).

Each win awards 3 points, a draw awards 1 point, and a loss awards 0 points.

The top two clusters with the highest total points qualify for the Championship Finals. In the event of a tie in points, the cluster with the highest net payload difference (Payloads Intercepted For - Payloads Conceded Against) qualifies.

In the opening match of Round 1, Cluster Madrid was defeated by Cluster Berlin.

After the completion of Round 2 (each cluster having completed two matches), the Pool A standings table was recorded as follows:

ClusterMatches PlayedWonDrawnLostPayloads ForPayloads AgainstPoints
Cluster Berlin2200316
Cluster Buenos2200206
Cluster Madrid2101523
Cluster Islamabad2101213
Cluster Auckland2002160
Cluster Pretoria2002140

In the third round:

  • Cluster Madrid played Cluster Islamabad, Cluster Buenos played Cluster Berlin, and Cluster Auckland played Cluster Pretoria.

  • All third round matches ended in draws.

The following telemetry reports were recorded for rounds 4 and 5:

  1. Cluster Madrid won both its fourth and fifth round matches.

  2. Both Cluster Buenos and Cluster Berlin won their fifth round matches by a score of 3–0.

  3. Cluster Islamabad won both its fourth and fifth round matches by a score of 1–0.

If Cluster Islamabad qualified as one of the two top clusters from Pool A, which other cluster qualified alongside it?

  1. A

    Cluster Buenos

  2. B

    Cluster Berlin

  3. C

    Cluster Madrid

  4. D

    Cannot be determined

Show answer and explanation

Answer: (D) Cannot be determined

Question 44 Solution:

  1. Evaluating Rounds 4 and 5 Data Consistency:

    • Reports 1, 2, and 3 state:

      • (1) Madrid won both Round 4 and Round 5 matches.

      • (2) Both Buenos and Berlin won their Round 5 matches.

      • (3) Islamabad won both Round 4 and Round 5 matches.

    • Notice that in Round 5, four distinct clusters—Madrid, Buenos, Berlin, and Islamabad—are reported to have won their matches.

    • However, in a pool of 6 teams playing single matches, there are exactly 62=3\frac{6}{2} = 3 matches per round. Consequently, at most 3 teams can possibly win in any single round.

    • Because reporting 4 winning teams in Round 5 introduces a structural mathematical inconsistency in the problem data, the subsequent progression cannot be unambiguously evaluated.

Hence, the qualifying cluster Cannot be determined.

Question 45 · CAT Level

Directions for Questions 42 to 45

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

Six autonomous defense clusters—Cluster Berlin, Cluster Buenos, Cluster Madrid, Cluster Islamabad, Cluster Auckland, and Cluster Pretoria—compete in Pool A of the Autonomous Cyber-Defense League wargame.

All six clusters engage each other in a single round-robin format (5 total match rounds, exactly one match per round for each cluster).

Each win awards 3 points, a draw awards 1 point, and a loss awards 0 points.

The top two clusters with the highest total points qualify for the Championship Finals. In the event of a tie in points, the cluster with the highest net payload difference (Payloads Intercepted For - Payloads Conceded Against) qualifies.

In the opening match of Round 1, Cluster Madrid was defeated by Cluster Berlin.

After the completion of Round 2 (each cluster having completed two matches), the Pool A standings table was recorded as follows:

ClusterMatches PlayedWonDrawnLostPayloads ForPayloads AgainstPoints
Cluster Berlin2200316
Cluster Buenos2200206
Cluster Madrid2101523
Cluster Islamabad2101213
Cluster Auckland2002160
Cluster Pretoria2002140

In the third round:

  • Cluster Madrid played Cluster Islamabad, Cluster Buenos played Cluster Berlin, and Cluster Auckland played Cluster Pretoria.

  • All third round matches ended in draws.

The following telemetry reports were recorded for rounds 4 and 5:

  1. Cluster Madrid won both its fourth and fifth round matches.

  2. Both Cluster Buenos and Cluster Berlin won their fifth round matches by a score of 3–0.

  3. Cluster Islamabad won both its fourth and fifth round matches by a score of 1–0.

Which cluster finished at the top of the pool standings after five rounds of matches?

  1. A

    Cluster Buenos

  2. B

    Cluster Berlin

  3. C

    Cluster Madrid

  4. D

    Cannot be determined

Show answer and explanation

Answer: (D) Cannot be determined

Question 45 Solution:

  1. Evaluating Final Standings Feasibility:

    • As established in the analysis of the round 4 and 5 telemetry data, the reported results require 4 teams to win in Round 5, violating the fundamental graph pairing constraint of a 6-node round-robin tournament (maximum 3 winners per round).

    • Due to this data inconsistency, the final points and goal differences for the teams at the top of the table cannot be uniquely or validly determined.

Hence, the top-finishing cluster Cannot be determined.

Question 46 · CAT Level

Directions for Questions 46 to 49

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

Cyber-Rescue International is a specialized non-governmental security alliance responding to critical infrastructure cyber incidents. Currently, it deploys 37 specialized security engineers.

All engineers are deployed across three concurrent emergency defense operations: Threat Remediation (TR), Firewall Reconstruction (FR), and Endpoint Recovery (ER).

Every engineer is deployed in at least one of the three operations.

Audit records document the following operational allocations:

  • The maximum number of engineers are deployed in the FR operation. Among them, the number of engineers deployed in the FR operation alone is equal to the number of FR engineers having additional involvement in the ER operation.

  • The number of engineers deployed in the ER operation alone is exactly double the number of engineers deployed across all three operations.

  • Exactly 17 engineers are deployed in the TR operation.

  • The number of engineers deployed in the TR operation alone is one less than the number of engineers deployed in the ER operation alone.

  • Ten engineers deployed in the TR operation are also deployed in at least one other operation.

Based on the information given above, the minimum number of engineers deployed in both FR and TR operations, but not in the ER operation, is:

  1. A

    1

  2. B

    3

  3. C

    4

  4. D

    5

Show answer and explanation

Answer: (C) 4

Question 46 Solution:

  1. Defining Venn Diagram Regions:

    • Let:

      • ff: FR alone

      • ee: ER alone

      • tt: TR alone

      • qq: FR and ER only

      • xx: FR and TR only

      • yy: ER and TR only

      • zz: All three operations (FR ∩\cap ER ∩\cap TR)

  2. Deducing Fixed Region Values:

    • Clue: 17 engineers in TR, and 10 of them are in at least one other operation:

      n(TR)=t+(x+y+z)=17  ⟹  t+10=17  ⟹  t=7n(\text{TR}) = t + (x + y + z) = 17 \implies t + 10 = 17 \implies \mathbf{t = 7}

    • Clue: TR alone (tt) is one less than ER alone (ee):

      t=e−1  ⟹  7=e−1  ⟹  e=8t = e - 1 \implies 7 = e - 1 \implies \mathbf{e = 8}

    • Clue: ER alone (ee) is double of all three (zz):

      e=2z  ⟹  8=2z  ⟹  z=4e = 2z \implies 8 = 2z \implies \mathbf{z = 4}

    • Since x+y+z=10x + y + z = 10 and z=4z = 4:

      x+y=10−4=6x + y = 10 - 4 = \mathbf{6}

  3. Solving for FR Alone (ff) and FR ∩\cap ER Only (qq):

    • Clue: In FR, those in FR alone (ff) equals those with additional involvement in ER (q+zq + z):

      f=q+z=q+4f = q + z = q + 4

    • Total engineers across all regions = 37:

      f+e+t+q+(x+y)+z=37f + e + t + q + (x + y) + z = 37

      (q+4)+8+7+q+6+4=37(q + 4) + 8 + 7 + q + 6 + 4 = 37

      2q+29=37  ⟹  2q=8  ⟹  q=42q + 29 = 37 \implies 2q = 8 \implies \mathbf{q = 4}

      f=q+4=4+4=8f = q + 4 = 4 + 4 = \mathbf{8}

  4. Determining the Bound for xx:

    • Total in FR: n(FR)=f+q+x+z=8+4+x+4=16+xn(\text{FR}) = f + q + x + z = 8 + 4 + x + 4 = 16 + x.

    • Total in ER: n(ER)=e+q+y+z=8+4+y+4=16+yn(\text{ER}) = e + q + y + z = 8 + 4 + y + 4 = 16 + y.

    • Since FR has the strictly maximum number of engineers:

      n(FR)>n(ER)  ⟹  16+x>16+y  ⟹  x>yn(\text{FR}) > n(\text{ER}) \implies 16 + x > 16 + y \implies x > y

    • Given x+y=6x + y = 6 and x>yx > y (where x,yx, y are non-negative integers):

      Possible pairs (x,y)∈{(4,2),(5,1),(6,0)}\text{Possible pairs } (x, y) \in \{(4, 2), (5, 1), (6, 0)\}

    • Thus, the minimum possible value of xx (engineers in FR and TR, but not ER) is 4.

Hence, the minimum number is 4.

Question 47 · CAT Level

Directions for Questions 46 to 49

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

Cyber-Rescue International is a specialized non-governmental security alliance responding to critical infrastructure cyber incidents. Currently, it deploys 37 specialized security engineers.

All engineers are deployed across three concurrent emergency defense operations: Threat Remediation (TR), Firewall Reconstruction (FR), and Endpoint Recovery (ER).

Every engineer is deployed in at least one of the three operations.

Audit records document the following operational allocations:

  • The maximum number of engineers are deployed in the FR operation. Among them, the number of engineers deployed in the FR operation alone is equal to the number of FR engineers having additional involvement in the ER operation.

  • The number of engineers deployed in the ER operation alone is exactly double the number of engineers deployed across all three operations.

  • Exactly 17 engineers are deployed in the TR operation.

  • The number of engineers deployed in the TR operation alone is one less than the number of engineers deployed in the ER operation alone.

  • Ten engineers deployed in the TR operation are also deployed in at least one other operation.

Which of the following additional pieces of information would uniquely determine the exact number of engineers deployed in every individual operational partition?

  1. A

    Twenty engineers are deployed in FR

  2. B

    Four engineers are deployed in all three operations

  3. C

    Twenty-three engineers are deployed in exactly one operation

  4. D

    No need for any additional information

Show answer and explanation

Answer: (A) Twenty engineers are deployed in FR

Question 47 Solution:

  1. Current Degrees of Freedom:

    • All Venn regions are uniquely fixed except the pair (x,y)(x, y), which satisfies:

      x+y=6,x∈{4,5,6},y∈{2,1,0}x + y = 6, \quad x \in \{4, 5, 6\}, \quad y \in \{2, 1, 0\}

  2. Testing Candidate Additional Clues:

    • Clue (1): 'Twenty engineers are deployed in FR':

      n(FR)=16+x=20  ⟹  x=4n(\text{FR}) = 16 + x = 20 \implies x = 4

      • Then y=6−4=2y = 6 - 4 = 2. This completely and uniquely fixes all regions!
    • Clue (2): 'Four engineers are deployed in all three operations':

      • We already proved z=4z = 4 from the existing clues. This is redundant/superfluous.
    • Clue (3): 'Twenty-three engineers are deployed in exactly one operation':

      • Exactly one operation = f+e+t=8+8+7=23f + e + t = 8 + 8 + 7 = 23. This is already an invariant true for all valid (x,y)(x, y), so it does not resolve xx and yy.

Hence, Twenty engineers are deployed in FR uniquely determines the entire distribution.

Question 48 · CAT Level

Directions for Questions 46 to 49

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

Cyber-Rescue International is a specialized non-governmental security alliance responding to critical infrastructure cyber incidents. Currently, it deploys 37 specialized security engineers.

All engineers are deployed across three concurrent emergency defense operations: Threat Remediation (TR), Firewall Reconstruction (FR), and Endpoint Recovery (ER).

Every engineer is deployed in at least one of the three operations.

Audit records document the following operational allocations:

  • The maximum number of engineers are deployed in the FR operation. Among them, the number of engineers deployed in the FR operation alone is equal to the number of FR engineers having additional involvement in the ER operation.

  • The number of engineers deployed in the ER operation alone is exactly double the number of engineers deployed across all three operations.

  • Exactly 17 engineers are deployed in the TR operation.

  • The number of engineers deployed in the TR operation alone is one less than the number of engineers deployed in the ER operation alone.

  • Ten engineers deployed in the TR operation are also deployed in at least one other operation.

After some time, the engineers deployed across all three operations were requested to withdraw from one operation: exactly one engineer opted out of TR, one opted out of ER, and the remaining engineers deployed in all three operations opted out of FR. Which of the following statements then necessarily follows?

  1. A

    The lowest number of engineers is now in TR operation

  2. B

    More engineers are now in FR operation as compared to ER operation

  3. C

    More engineers are now in TR operation as compared to ER operation

  4. D

    None of the above

Show answer and explanation

Answer: (B) More engineers are now in FR operation as compared to ER operation

Question 48 Solution:

  1. Reallocating the z=4z = 4 Tri-Operation Engineers:

    • 1 engineer opts out of TR   ⟹  \implies remains in FR and ER only (qq increases by 1: q′=4+1=5q' = 4 + 1 = 5).

    • 1 engineer opts out of ER   ⟹  \implies remains in FR and TR only (xx increases by 1: x′=x+1x' = x + 1).

    • The remaining 4−1−1=24 - 1 - 1 = 2 engineers opt out of FR   ⟹  \implies remain in ER and TR only (yy increases by 2: y′=y+2y' = y + 2).

    • The tri-operation region is now empty (z′=0z' = 0).

  2. Computing New Operation Totals:

    • FR Operation:

      n′(FR)=f+q′+x′=8+5+(x+1)=14+xn'(\text{FR}) = f + q' + x' = 8 + 5 + (x + 1) = 14 + x

      • Since x∈{4,5,6}x \in \{4, 5, 6\}, n′(FR)∈{18,19,20}n'(\text{FR}) \in \{18, 19, 20\}.
    • ER Operation:

      n′(ER)=e+q′+y′=8+5+(y+2)=15+yn'(\text{ER}) = e + q' + y' = 8 + 5 + (y + 2) = 15 + y

      • Since y∈{2,1,0}y \in \{2, 1, 0\}, n′(ER)∈{17,16,15}n'(\text{ER}) \in \{17, 16, 15\}.
    • TR Operation:

      n′(TR)=t+x′+y′=7+(x+1)+(y+2)=10+(x+y)=10+6=16n'(\text{TR}) = t + x' + y' = 7 + (x + 1) + (y + 2) = 10 + (x + y) = 10 + 6 = 16

  3. Comparison:

    • Notice that the minimum possible total for FR is 18, while the maximum possible total for ER is 17.

    • Since 18>1718 > 17, it is strictly guaranteed that n′(FR)>n′(ER)n'(\text{FR}) > n'(\text{ER}) in all cases!

Hence, More engineers are now in FR operation as compared to ER operation necessarily follows.

Question 49 · CAT Level

Directions for Questions 46 to 49

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

Cyber-Rescue International is a specialized non-governmental security alliance responding to critical infrastructure cyber incidents. Currently, it deploys 37 specialized security engineers.

All engineers are deployed across three concurrent emergency defense operations: Threat Remediation (TR), Firewall Reconstruction (FR), and Endpoint Recovery (ER).

Every engineer is deployed in at least one of the three operations.

Audit records document the following operational allocations:

  • The maximum number of engineers are deployed in the FR operation. Among them, the number of engineers deployed in the FR operation alone is equal to the number of FR engineers having additional involvement in the ER operation.

  • The number of engineers deployed in the ER operation alone is exactly double the number of engineers deployed across all three operations.

  • Exactly 17 engineers are deployed in the TR operation.

  • The number of engineers deployed in the TR operation alone is one less than the number of engineers deployed in the ER operation alone.

  • Ten engineers deployed in the TR operation are also deployed in at least one other operation.

Following the withdrawal of engineers described in the previous question, some new engineers joined the alliance. Each new engineer was assigned to only one operation such that the number of engineers working in one operation alone became identical across all three operations (fnew=enew=tnewf_{\text{new}} = e_{\text{new}} = t_{\text{new}}). At that stage, it was also observed that the number of engineers deployed in both FR and ER was equal to the number of engineers deployed in both TR and ER. Which operation now has the highest number of engineers?

  1. A

    ER

  2. B

    FR

  3. C

    TR

  4. D

    Cannot be determined

Show answer and explanation

Answer: (D) Cannot be determined

Question 49 Solution:

  1. Analyzing the Condition on Dual-Operation Intersections:

    • From the post-withdrawal configuration:

      • Engineers in both FR and ER = q′=5q' = 5.

      • Engineers in both TR and ER = y′=y+2y' = y + 2.

    • The question specifies that these two intersection counts became equal:

      q′=y′  ⟹  5=y+2  ⟹  y=3q' = y' \implies 5 = y + 2 \implies \mathbf{y = 3}

  2. Checking Feasibility:

    • However, our foundational deduction proved that yy is constrained to:

      y∈{0,1,2}y \in \{0, 1, 2\}

    • A value of y=3y = 3 is mathematically impossible, as it would require x=6−3=3x = 6 - 3 = 3, violating the strict condition x>yx > y (which established that FR had the maximum volunteers).

    • Because the stated condition imposes an algebraically inconsistent requirement upon the parameter domain, the system configuration is invalid.

Hence, the answer is Cannot be determined.

Try real CAT questions

Study this concept with interactive practice in PrepSoc.

Open the concept library