# Data Structure Questions and Answers-Assembly Line Scheduling

## Click on any option to know the CORRECT ANSWERS

 Question 1
Which of the following methods can be used to solve the assembly line scheduling problem?
 A Recursion B Brute force C Dynamic programming D All of the mentioned

Question 1 Explanation:
All of the above mentioned methods can be used to solve the assembly line scheduling problem.

 Question 2
What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?
 A O(1) B O(n) C O(n2) D O(2n)

Question 2 Explanation:
In the brute force algorithm, all the possible ways are calculated which are of the order of 2n.

 Question 3
In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?
 A 0 B 1 C 2 D 3

Question 3 Explanation:
In the dynamic programming implementation of the assembly line scheduling problem, 2 lookup tables are required one for storing the minimum time and the other for storing the assembly line number.

 Question 4
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 starting assembly line?

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

Question 4 Explanation:
For the optimal solution, the starting assembly line is line 2.

 Question 5
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 C All of the mentioned D None of the mentioned