Question:medium
Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is:
Let G be a directed graph whose vertex set is the set of numbers from 1 to 100. There is an edge from a vertex i to j if and only if either j = i + 1 or j = 3i. The minimum number of edges in a path in G from vertex 1 to vertex 100 is:
Show Hint
When solving shortest path problems: Use BFS or Dijkstra’s algorithm for directed graphs and Understand the edge conditions carefully.
Updated On: Feb 11, 2026
- 4
- 7
- 23
- 99
Show Solution
The Correct Option is B
Solution and Explanation
Breadth-First Search (BFS) determines the shortest path. The total edges count 7, summing 4 and 3.
Was this answer helpful?
0
Top Questions on Algorithm
- When does the worst case of binary search occur?
- Suppose that insertion sort is applied to the array \([1,2,3,5,7,9,11,x,15,13]\) and it takes exactly 2 swaps to sort the array. Select all possible values of \( x \).
- Which of the following data structures supports binary search in \( O(\log n) \) time complexity?
- Consider the following algorithm:
What will be the output (O/P) of this algorithm? - Want to practice more? Try solving extra ecology questions todayView All Questions