**DOWNLOAD FREE PDF** **<<CLICK HERE>>**

## Data Structure Questions and Answers-Assembly Line Scheduling

Congratulations - you have completed *Data Structure Questions and Answers-Assembly Line Scheduling*.

You scored %%SCORE%% out of %%TOTAL%%.

Your performance has been rated as %%RATING%%

Your answers are highlighted below.

Question 1 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

Which of the following methods can be used to solve the assembly line scheduling problem?

Recursion | |

Brute force | |

Dynamic programming | |

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 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

What is the time complexity of the brute force algorithm used to solve the assembly line scheduling problem?

O(1) | |

O(n) | |

O(n ^{2}) | |

O(2 ^{n}) |

Question 2 Explanation:

In the brute force algorithm, all the possible ways are calculated which are of the order of 2

^{n}.

Question 3 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

In the dynamic programming implementation of the assembly line scheduling problem, how many lookup tables are required?

0 | |

1 | |

2 | |

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 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

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?

Line 1 | |

Line 2 | |

All of the mentioned | |

None of the mentioned |

Question 4 Explanation:

For the optimal solution, the starting assembly line is line 2.

Question 5 [CLICK ON ANY CHOICE TO KNOW MCQ multiple objective type questions RIGHT ANSWER] |

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?

Line 1 | |

Line 2 | |

All of the mentioned | |

None of the mentioned |

Question 5 Explanation:

For the optimal solution, the exit assembly line is line 2.

Once you are finished, click the button below. Any items you have not completed will be marked incorrect.

There are 5 questions to complete.