what is best way to create a Thread class & why?

0 Answers  

---

What is the Difference between in memory database and physical database

0 Answers  

---

iam confused among testing ,.net and java. can anybody help me.

0 Answers  

---

What are the other ways to create an object with out calling new keyword in java?

2 Answers   HCL,

---

what is log files in qtp what is use

0 Answers   HSBC,

---

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

0 Answers  

---

What are scrubbing procedures in SAS

1 Answers   IBM,

---

Corillian's product is a "Component Container." Name at least 3 component

1 Answers  

---

can php support multiple inheritence?

2 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  

---

1. Write a program to create a sentence at runtime and count number of vowels in it ? 2. Write a program to get a string and to convert the 1st letter of it to uppercase ?

0 Answers   HTC,

---

What is SOLID Principle in Programming Language?

0 Answers   NA,

---