Answer / mahendra giri

101001.1010

why we use static with only main()class not with other class

2 Answers   TCS,

---

Define Abstract method & class with Example

3 Answers  

---

how many languages .net is supporting now?

4 Answers  

---

What is the difference between CriteriaQuery and CreateQuery in Hibernate???? Thanks in advance!!!!!!

1 Answers   Accenture,

---

Explain polymorphism. Provide an example.

0 Answers   Amazon,

---

what is adodb??y it is used for connection of V.B and access??what is ado?dao?

0 Answers   TCS,

---

How to find out the user exit for va01.

1 Answers  

---

Is strus threadsafe or not?

1 Answers  

---

what is oops?

5 Answers   Satyam,

---

In Bioinformatics, a DNA sequence is made up of a combination of 4 characters, namely “A,C,G,T”. A subsequence of a given sequence of characters a0, a1, …an- 1, is any subset of the characters taken in order, of the form ai0 , ai1 ,…..aik-1 where 0 &#8804; i0 <i1….< ik-1 &#8804; n-1. For example in the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, we can have subsequences “A,G,T”, “A,C,A,A” and many more. A subsequence is palindromic if it is the same whether read left to right or right to left. For instance, the sequence “A,C,G,T,G,T,C,A,A,A,A,T,C,G”, has many palindromic subsequences, including “A,C,G,C,A” and “A,A,A,A” (on the other hand, the subsequence “A,C,T” is not palindromic). Devise an algorithm (using dynamic programming) that takes a sequence of characters X[0 … n-1] from the alphabet set (A,C,G,T) and returns the (length of the) longest palindromic subsequence. Implement the algorithm in an appropriate language.

1 Answers  

---

Which tag is used to create the frame

1 Answers  

---

Diff between IF and where ?

0 Answers   Accenture,

---