A small robot moves along the edges of a frame built from unit cubes, from the corner to the corner . Each move is one unit in the positive , or direction. How many shortest paths of the robot pass through the point ?
Competency-Based Questions (CBQ) · Question 56 of 80
A small robot moves along the edges of a frame built from unit cubes, from the corner (0, 0, 0) to the corner (3, 2…
Question 561 markMCQHard
Select your answer
(A)
- Correct answer
(B)
(C)
(D)
Option (B) is correct.
Explanation: Call a move in the , and directions E, N and U. A shortest path must make exactly 3 moves E, 2 moves N and 2 moves U, so it is a 7-letter word made of E, E, E, N, N, U, U. All such paths number
Through (1, 1, 1). The path reaches after its first 3 moves exactly when those moves are one E, one N and one U, in any order: ways. The last 4 moves are then E, E, N, U, with the two E's alike:
By the multiplication principle:
Why the other options are wrong
- (A) counts every shortest path and ignores the condition about the point .
- (C) adds the numbers of ways for the two halves. Each first half can be followed by each second half, so they must be multiplied.
- (D) counts the paths that avoid the point , the opposite of what is asked.
