Question 4
In the color-coding algorithm where each of the n nodes in the input graph is assigned one of k colors, the total number of DP table entries (i.e., DP states denoted W(v,X)) is:
2k
nk
n2k
nnk
In the color-coding algorithm where each of the n nodes in the input graph is assigned one of k colors, the total number of DP table entries (i.e., DP states denoted W(v,X)) is:
2k
nk
n2k
nnk
Correct answer
n2k
Question 4 of 6 in the IIT Madras BS Algorithmic Thinking in Bioinformatics (Algorithmic Thinking in Bioinformatics) Quiz 1 paper sat on 26 Feb 2023, in the January 2023 term (IIT M DEGREE AN4 EXAM QPE4 26 Feb 2023). It carries 3 marks.