Register

UGC NET CSE | November 2017 | Part 3 | Question: 34

• edited by
647 views
1 votes
1 votes

Consider the following two sequences:

$X=<B,C, D, C, A, B, C>$ and $Y=<C, A, D, B, C, B>$

The length of longest common subsequence of $X$ and $Y$ is

  1. $5$
  2. $3$
  3. $4$
  4. $2$
• edited by
User Avatar

1 Answer

Voting & Accepting an answer helps improve the community
Answer:
← PreviousNext →
← Previous in categoryNext in category →

Related questions

1 votes
1 votes
3 answers
1
Arjun asked Nov 5, 2017
872 views
UGC NET CSE | November 2017 | Part 3 | Question: 74
Which of the following routing technique / techniques is/are used in distributed systems? Fixed Routing Virtual Routing Dynamic Routing (a) only (a) and (b) only (c) only All (a), (b), (c)
Which of the following routing technique / techniques is/are used in distributed systems?Fixed RoutingVirtual RoutingDynamic Routing(a) only(a) and (b) only(c) onlyAll (a...
User Avatar
1 votes
1 votes
2 answers
3
Arjun asked Nov 5, 2017
957 views
UGC NET CSE | November 2017 | Part 3 | Question: 72
The Sigmoid activation function $f(t)$ is defined as $\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$ $t \text{ exp}(-t)$ $\dfrac{1}{1+ \text{exp} (t)}$ $\dfrac{1}{1+ \text{exp} (-t)}$
The Sigmoid activation function $f(t)$ is defined as$\dfrac{1}{\text{exp} (t) + \text{exp} (-t)}$$t \text{ exp}(-t)$$\dfrac{1}{1+ \text{exp} (t)}$$\dfrac{1}{1+ \text{exp...
User Avatar
Link Copied!