Vidyalelo
Data Structure · Q58

Dynamic Programming in Data Structures

Programming · Data Structure · question 58

Q58

Consider the following assembly line problem: time_to_reach[2][3] = 17, 2, 7, 19, 4, 9 time_spent[2][4] = 6, 5, 15, 7, 5, 10, 11, 4 entry_time[2] = 8, 10 exit_time[2] = 10, 7 num_of_stations = 4 For the optimal solution, which should be the exit assembly line?

A.
Line 1
B.
Line 2
Answer
C.
All of the mentioned
D.
None of the mentioned

Answer: Option B

Solution

Answer: Option B
No explanation is given for this question Let's Discuss on Board