📚 Question Bank Q22 — Algorithms
⚙Tags
Home › UGC NET Paper 2: Computer Science 2020 › Algorithms
Algorithms
Q22. Marks: +2.0 UGC NET Paper 2: Computer Science 2020
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 a vertex 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 
1.23
2.99
3.4
4.7 ✓ Correct
📄 All “Algorithms” questions across papers
3 / 7 in this subject • Back to paper
🏷 Change Tag for this Question ▶