For any array, given that at most one element is non-ze - Practice (English)

Loading practice questions

A focused practice platform for competitive-exam MCQs, subject wise, topic wise practice, and current affairs revision.

Practice library for exams, subjects, and daily revision. For learning purposes only.

For any array, given that at most one element is non-ze - Practice (English) | ObjectiveMcq

1,470 views

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.

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.

How many constraints does flow have?
What is the running time of Dinic's blocking flow algorithm?
Who formulated the Maximum flow problem?
What is the running time of an unweighted shortest path algorithm whose augmenting path is the path with the least number of edges?
Dinic's algorithm runs faster than the Ford-Fulkerson algorithm.
In what time can an augmenting path be found?
A simple acyclic path between source and sink which passes through only positive weighted edges is called?
Under what condition can a vertex combine and distribute flow in any manner?