This question was previously asked in

NIELIT Scientific Assistant A Official Paper 2020

- Dynamic Programming
- Greedy Algorithms
- Greedy Algorithms and Dynamic Programming respectively
- Dynamic Programming and Branch and Bound respectively

Option 1 : Dynamic Programming

**The longest common subsequence(LCM)**

LCS problem is the problem of finding the longest subsequence common to all sequences in a set of sequences.

Longest Common Subsequence problems is an example of **Dynamic Programming.**

In LCS:

If there is match, A[i, j] = A[i – 1, j – 1] + 1

If not match: max(A[i – 1, j], A[i, j – 1])

**Assembly line scheduling **

The main goal of assembly line scheduling is to give the best route or can say fastest from all assembly line.

Assembly line schedulingproblems is an example of Dynamic Programming.

Free

Probability and Statistics

2278

20 Questions
20 Marks
30 Mins

India’s **#1 Learning** Platform

Start Complete Exam Preparation

Daily Live MasterClasses

Practice Question Bank

Mock Tests & Quizzes

Trusted by 2,31,48,519+ Students

Testbook Edu Solutions Pvt. Ltd.

1st & 2nd Floor, Zion Building,

Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

[email protected]
Plot No. 273, Sector 10, Kharghar,

Navi Mumbai - 410210

Toll Free:1800 833 0800

Office Hours: 10 AM to 7 PM (all 7 days)