Minimum Number Of Jumps in Data Structure And Algorithm : Practice MCQ Questions & Answers with Explanations

6 practice sets · Page 1 of 1

Data Structure And AlgorithmMediumDynamic ProgrammingMinimum Number Of Jumps

Which of the following "for" loops can be used instead of the inner for loop so that the output doesn't change?

for(j = 1; j < arr[idx] + len; j++)

for(j = 0; j < arr[idx] - len; j++)

for(j = idx + 1; (j < len && j <= arr[idx] + idx); j++)

No change is required

View Answer

Correct Answer: D — No change is required

Explanation:

None of the above mentioned "for" loops can be used instead of the inner for loop. Note, for(j = idx + 1; (j < len && j <= arr[idx] + idx); j++) covers the same range as the inner for loop but it produces the wrong output because the indexing inside the loops changes as "j" takes different values in the two "for" loops.

Data Structure And AlgorithmMediumDynamic ProgrammingMinimum Number Of Jumps

For any array, given that at most one element is non-zero, it is ALWAYS possible to reach the end of the array using minimum jumps.

True

False

View Answer

Correct Answer: B — False

Explanation:

Consider the array {1,0,2,3,4}.

In this case, only one element is 0 but it is not possible to reach the end of the array.

Data Structure And AlgorithmMediumDynamic ProgrammingMinimum Number Of Jumps

For a given array, there can be multiple ways to reach the end of the array using minimum number of jumps.

True

False

View Answer

Correct Answer: A — True

Explanation:

Consider the array {1,2,3,4,5}. It is possible to reach the end in the following ways: {1 -> 2 -> 3 -> 5} or {1 -> 2 -> 4 -> 5}.

In both the cases the number of jumps is 3, which is minimum. Hence, it is possible to reach the end of the array in multiple ways using minimum number of jumps.

Data Structure And AlgorithmMediumDynamic ProgrammingMinimum Number Of Jumps

Which of these arguments should be passed by the min_jumps function represented by the blanks?

arr, strt + idx, end

arr + idx, strt, end

arr, strt, end

arr, strt, end + idx

View Answer

Correct Answer: A — arr, strt + idx, end

Explanation:

arr, strt + idx, end should be passed as arguments.

Data Structure And AlgorithmMediumDynamic ProgrammingMinimum Number Of Jumps

Consider the following array: {1, 3, 5, 8, 9, 2, 6, 7, 6} What is the minimum number of jumps required to reach the end of the array?

View Answer

Correct Answer: C — 3

Explanation:

The jumps made will be:{1 -> 2 -> 4 -> 9}. So, the number of jumps is three.

Data Structure And AlgorithmMediumDynamic ProgrammingMinimum Number Of Jumps

You are given an array of elements where each array element represents the MAXIMUM number of jumps that can be made in the forward direction from that element. You have to find the minimum number of jumps that are required to reach the end of the array. Which of these methods can be used to solve the problem?

Dynamic Programming

Greedy Algorithm

Recursion

Recursion and Dynamic Programming

View Answer

Correct Answer: D — Recursion and Dynamic Programming

Explanation:

Both recursion and dynamic programming can be used to solve minimum number of jumps problem.