I want to pass .pdf files as OlE Object to crystal report through VB6. Please any one guid me...

0 Answers  

---

give idea for creating screen in abap

0 Answers  

---

What is Big-O notation?

1 Answers  

---

Delta 5 weight scale not connect with oracle application what i can do?

0 Answers  

---

Binary tree?

1 Answers   Mascot,

---

How to create a new dataset only duplicate observations in proc sort procedure?

0 Answers   Accenture,

---

For a binary tree with n nodes, How many nodes are there which has got both a parent and a child?

0 Answers  

---

suppose we have ten members of a physical file but we want the output of last 5 members only.how to achieve that?

0 Answers   Bank Of America,

---

How many ways we can fill a dataset in .Net

1 Answers   iGate,

---

what are the advantages of sap on other software ?

0 Answers  

---

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  

---

Explain what is OOPS and its concepts?

0 Answers   BirlaSoft,

---