Crack
GATE
C
G
Topic
Dynamic Programming
Algorithms
0
/ 1 done
Questions per paper
All
MCQ
MSQ
NAT
2015 to 2026. Point at a year to read it.
0
1
2015
2019
2021
2023
2025
2026
Show as a table
Year
All
MCQ
MSQ
NAT
2015
0
0
0
0
2018
0
0
0
0
2019
0
0
0
0
2020
0
0
0
0
2021
0.5
0
0
0.5
2022
0
0
0
0
2023
0
0
0
0
2024
0
0
0
0
2025
0
0
0
0
2026
0
0
0
0
1
CS 2021 Set 2 · 2 marks · NAT · Moderate
In a directed acyclic graph with a source vertex
s
\mathtt{s}
s
, the quality-score of a directed path is defined to be the product of the weights of the edges on the path. Further, for a vertex
v
v
v
other than
s
\mathtt{s}
s
, the quality-score of
v
v
v
is defined to be the maximum among the quality-scores of all the paths from
s
\mathtt{s}
s
to
v
v
v
. The quality-score of
s
\mathtt{s}
s
is assumed to be
1
1
1
.