Матеріали курсу FIT2004 Algorithms and data structures - S2 2026 та відповіді на тести | learning.monash.edu

You find yourself curiously stranded on an n × n mysterious grid (shown below), unsure of how you got there, or how to leave. You denote the rows of the grid from bottom to top as 1, 2, ..., n, and similarly denote the columns from left to right as 1, 2, ..., n. Cell (i, j) refers to row i, column j.

You are currently standing at the bottom-left corner of the grid and wonder to yourself how many different ways there are to walk to the top-right corner of the grid. However, there are certain conditions on the grid's cells.

In the normal cells of the grid (cells with white background below), you feel fatigued and are only able to move to the cell to the immediate right (to the next column). In the special cells of the grid (cells with blue background below), you feel more energised and are able to move either to the cell that is immediately up (to the next row) or immediately right (to the next column).

A 6 by 6 grid, rows numbered 1 to 6 from the bottom and columns 1 to 6 from the left. The special (blue) cells are (1,1), (1,4), (2,2), (2,5), (2,6), (3,5), (3,6), (4,3), (4,6), (5,5) and (5,6); all other cells are normal. A figure stands in cell (1,1).

Which of the following options describe correct dynamic programming recurrences for those cells? Select all correct options.

Where DP[i, j] = {The number of valid paths from cell (1, 1) to cell (i, j)}, the recurrence is given by:

DP[i, j] = DP[i - 1, j] + DP[i, j - 1] if cell (i-1, j) is a special cell
DP[i, j] = DP[i, j - 1] otherwise

Where DP[i, j] = {The number of valid paths from cell (i, j) to cell (n, n)}, the recurrence is given by:

DP[i, j] = DP[i + 1, j] + DP[i, j + 1] if cell (i-1, j) is a special cell
DP[i, j] = DP[i, j + 1] otherwise

❌

Where DP[i, j] = {The number of valid paths from cell (1, 1) to cell (i, j)}, the recurrence is given by:

DP[i, j] = DP[i - 1, j] + DP[i, j - 1] if cell (i+1, j) is a special cell
DP[i, j] = DP[i, j - 1] otherwise

Where DP[i, j] = {The number of valid paths from cell (1, 1) to cell (i, j)}, the recurrence is given by:

DP[i, j] = DP[i - 1, j] + DP[i, j - 1] if cell (i, j) is a special cell
DP[i, j] = DP[i, j - 1] otherwise

Where DP[i, j] = {The number of valid paths from cell (1, 1) to cell (i, j)}, the recurrence is given by:

DP[i, j] = DP[i - 1, j] + DP[i, j - 1]

Where DP[i, j] = {The number of valid paths from cell (i, j) to cell (n, n)}, the recurrence is given by:

DP[i, j] = DP[i + 1, j] + DP[i, j + 1] if cell (i+1, j) is a special cell
DP[i, j] = DP[i, j + 1] otherwise

Where DP[i, j] = {The number of valid paths from cell (i, j) to cell (n, n)}, the recurrence is given by:

DP[i, j] = DP[i + 1, j] + DP[i, j + 1] if cell (i, j) is a special cell
DP[i, j] = DP[i, j + 1] otherwise

Where DP[i, j] = {The number of valid paths from cell (i, j) to cell (n, n)}, the recurrence is given by:

DP[i, j] = DP[i + 1, j] + DP[i, j + 1]

Переглянути це питання

Crowdly

FIT2004 Algorithms and data structures - S2 2026

Хочете миттєвий доступ до всіх перевірених відповідей на learning.monash.edu?