6 practice sets · Page 1 of 1
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
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
For a given array, there can be multiple ways to reach the end of the array using minimum number of jumps.
True
False
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
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?
1
2
3
4
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
