How to find long common subsequences.

The Gateway to Computer Science Excellence

First time here? Checkout the FAQ!

x

+4 votes

Given two sequences X and Y:

X=$\langle$ a, b, c, b, d, a, b $\rangle$

Y=$\langle$ b, d, c, a, b, a $\rangle$

The longest common subsequence of X and Y is:

- $\langle$ b, c, a $\rangle$
- $\langle$ c, a, b $\rangle$
- $\langle$ b, c, a, a $\rangle$
- $\langle$ b, c, b, a $\rangle$

- All categories
- General Aptitude 1.8k
- Engineering Mathematics 7.3k
- Digital Logic 2.9k
- Programming and DS 4.9k
- Algorithms 4.4k
- Theory of Computation 6.2k
- Compiler Design 2.1k
- Databases 4.1k
- CO and Architecture 3.4k
- Computer Networks 4.1k
- Non GATE 1.6k
- Others 1.8k
- Admissions 595
- Exam Queries 576
- Tier 1 Placement Questions 23
- Job Queries 72
- Projects 17

50,362 questions

55,786 answers

192,411 comments

90,920 users