The problem requires determining the minimum number of cuts needed to construct a cube's wire frame from a single $12 \text{ m}$ wire.
A cube has 12 edges. Each edge of the cube measures $1 \text{ m}$.
The total wire length needed to form all edges is calculated as: $12 \text{ edges} \times 1 \text{ m/edge} = 12 \text{ m}$ The provided wire is $12 \text{ m}$ long, exactly matching the total length required.
The goal is to minimize cuts. This can be achieved by bending the wire. A single segment of wire measuring $3 \text{ m}$ can be bent to form three consecutive $1 \text{ m}$ edges of the cube. This requires making bends at the $1 \text{ m}$ and $2 \text{ m}$ points along the $3 \text{ m}$ segment.
To construct the total 12 edges of the cube, using the strategy where each segment forms 3 edges, the number of segments needed is: $\frac{12 \text{ total edges}}{3 \text{ edges per segment}} = 4 \text{ segments}$
To obtain 4 distinct segments from one continuous $12 \text{ m}$ wire, the minimum number of cuts required is: $(\text{Number of segments}) - 1 = 4 - 1 = 3 \text{ cuts}$
Making 3 cuts on the $12 \text{ m}$ wire yields four $3 \text{ m}$ segments. Each $3 \text{ m}$ segment can be bent into three $1 \text{ m}$ edges. Soldering these pieces at the vertices completes the cube frame. Fewer cuts would result in fewer segments, which is insufficient to form all 12 edges.
The diagram below shows a river system consisting of 7 segments, marked P, Q, R, S, T, U, and V. It splits the land into 5 zones, marked Z1, Z2, Z3, Z4, and Z5. We need to connect these zones using the least number of bridges. Out of the following options, which one is correct?
Note: The figure shown is representative.

In the $4 \times 4$ array shown below, each cell of the first three columns has either a cross (X) or a number, as per the given rule.
| 1 | 1 | 2 | |
| 2 | X | 3 | |
| 2 | X | 4 | |
| 1 | 2 | X |
Rule: The number in a cell represents the count of crosses around its immediate neighboring cells (left, right, top, bottom, diagonals).
As per this rule, the maximum number of crosses possible in the empty column is
In the square grid shown on the left, a person standing at P2 position is required to move to P5 position.
The only movement allowed for a step involves, “two moves along one direction followed by one move in a perpendicular direction”. The permissible directions for movement are shown as dotted arrows in the right.
For example, a person at a given position Y can move only to the positions marked X on the right.
Without occupying any of the shaded squares at the end of each step, the minimum number of steps required to go from P2 to P5 is

In the 4 x 4 array shown below, each cell of the first three rows has either a cross (X) or a number.
| 1 | X | 4 | 3 |
| X | 5 | 5 | 4 |
| 3 | X | 6 | X |
The number in a cell represents the count of the immediate neighboring cells (left, right, top, bottom, diagonals) NOT having a cross (X). Given that the last row has no crosses (X), the sum of the four numbers to be filled in the last row is