a. The use of the table p[j] is to check for compatibility of job j-1 and job j. b. OPT(p[j]) is a recursive call our algorithm makes in order to compute the optimum. c. OPT(p[j]) is guaranteed to be computed before OPT(j). d. All the above
a. The use of the table p[j] is to check for compatibility of job j-1 and job j. b. OPT(p[j]) is a recursive call our algorithm makes in order to compute the optimum. c. OPT(p[j]) is guaranteed to be computed before OPT(j). d. All the above
Related questions
Question
Dynamic Programming : Select the correct option :
![a. The use of the table p[j] is to check for compatibility of job j-1 and job j.
b. OPT(p[j]) is a recursive call our algorithm makes in order to compute the optimum.
c. OPT(p[j]) is guaranteed to be computed before OPT(j).
d. All the above](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F602caea4-3d4d-49a2-a5cf-03841bb038cc%2F2dc2971f-38e1-4b50-acca-29d10ce72600%2Fsnfkzd_processed.png&w=3840&q=75)
Transcribed Image Text:a. The use of the table p[j] is to check for compatibility of job j-1 and job j.
b. OPT(p[j]) is a recursive call our algorithm makes in order to compute the optimum.
c. OPT(p[j]) is guaranteed to be computed before OPT(j).
d. All the above
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps
