Suppose i have all the implementation code required is written in doGet() but my class has doPost() method. i need code implemented in doGet() how can we do that?

1 Answers  

---

how do you generate source code for the automatic generation for receipt number

1 Answers   Infosys,

---

What is the entry point function of a DLL?

0 Answers   Wipro,

---

What is nocopy in plsql?

1 Answers   IBA Health,

---

How to call dll API sub routine in VB Form.

0 Answers  

---

what are the 3 forms of a prolog term

0 Answers  

---

what is the maximam caption size of lebel

1 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  

---

in a VB application, where the data will be stored after manipulation? what is the syntax for that?

0 Answers   TCS,

---

what is mutex?

4 Answers   Axiom, Blue Star, SQL Star,

---

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

0 Answers  

---

Write a program to implement BFS/ DFS routine in a connected graph

1 Answers  

---