what is delegate and how works delegate and event.

0 Answers   NIIT,

---

major characteristics of software system

0 Answers  

---

Why COBOL/400 is giving 95 session error when opening a file even though the file is having key and the screen or display file is having IND ARA defined?

1 Answers   Freelance,

---

Binary tree?

1 Answers   Mascot,

---

.net 2005 supports how many languages?

4 Answers  

---

---

Crystal report proffessional 9 to filter the issue date!!

1 Answers  

---

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

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  

---

why you have to became a software developer?

2 Answers  

---

what is the diff bw sql direct and jdbc update can't we do select and updating operation in sql direct

0 Answers   HP,

---

how many logical drive we can form to physical device in our computer?

1 Answers   nvidia,

---

What is a must for multitasking? a) Process preemption b) Paging c) Virtual memory d) None of the above

9 Answers   InterGraph,

---