Answer / ashutosh

Server side controls have events on server side and will
fired after postback load event. but HTML/ASP control will
submit the page to server and postback load is fired only.

public static void main(String args[]) describe it

0 Answers  

---

what is the difference between rename and label

0 Answers   Satyam,

---

Number of null pointers in any binary tree

5 Answers   Infosys,

---

please any one pass file aid,xpeditor and endeavor tools

0 Answers  

---

how we can call xml file in java file using Android platform?

2 Answers   TCS,

---

how to data grid use in data bind?

0 Answers   HCL,

---

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

0 Answers   TCS,

---

this question is from sas:what is the difference between FILE and INFILE statements? plz explain in brief?

1 Answers  

---

what is apt_dump_score in datastage where it is useful

0 Answers   Accenture,

---

Write a program to calculate the following i want a Java program for this condition 1+4+9+16+….+100 Like this (1^2+2^2) Hint use function pow(a,b)

4 Answers   HTC,

---

hi friends i am ravi here , i have one problem at starting at the interview that is i have my 3+ it(java) years experiance profile so if i attend the interview interviewer ased me tel me about your profile so i not able to explain because i dont knw where to start and where to end and i dont know what i should tel and what i shouldnot tel .....so can any body please clear m doubts clearly.............please help me friends,i am awaiting for friends reply please.............

2 Answers   TCS,

---

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  

---