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
The problem involves a 4x4 grid where cells contain either a cross ('X') or a number. A number indicates the count of its adjacent neighbors (including diagonals) that are *not* crosses. We are given the first three rows and know the last row contains only numbers. The goal is to find the sum of these numbers in the last row.
The provided string '1X43X5543X6X' represents the first three rows of the grid. Let's visualize it:
| C1 | C2 | C3 | C4 | |
| R1 | 1 | X | 4 | 3 |
| R2 | X | 5 | 5 | 4 |
| R3 | 3 | X | 6 | X |
| R4 | N1 | N2 | N3 | N4 |
Here, N1, N2, N3, and N4 are the unknown numbers in the last row (R4).
The core rule is: the number in a cell equals the count of its non-'X' neighbors. Neighbors include cells directly adjacent horizontally, vertically, and diagonally.
We calculate N1, N2, N3, and N4 by checking their neighbors:
The values calculated for the last row are N1=2, N2=4, N3=3, and N4=2.
The sum of these four numbers is calculated as:
Sum = N1 + N2 + N3 + N4
Sum = 2 + 4 + 3 + 2
Sum = 11
| TEAM 1 | TEAM 2 | |
| MATCH 1 | P and X | Q and R |
| MATCH 2 | P and R | X and Y |
| MATCH 3 | R and X | Q and Y |
Students applying for hostel rooms are allotted rooms in order of seniority. Students already staying in a room will move if they get a room in their preferred list. Preferences of lower ranked applicants are ignored during allocation.
Given the data below, which room will Ajit stay in?
| Names | Student seniority | Current room | Room preference list |
| Amar | 1 | P | R, S, Q |
| Akbar | 2 | None | R, S |
| Anthony | 3 | Q | P |
| Ajit | 4 | S | Q, P, R |
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.
