Answer / md akhtar

If you are using Internet Explorer:

Goto-->Tools-->Internet Options-->Security Settngs-->Custom
Level--> Here Select "Disable Active Script" in the Radio
Button List.

Answer / nadeem khokhar

kindly explore your question, what does exactly you mean?

hii I inntrested abt scjp certification but i dont knw abt scjp plz send details abt scjp exam and syllabus.

0 Answers  

---

WAP to print all prime nos between 1 to 100 without using user input...pls reply within few hours...

1 Answers  

---

How to get the index of the clicked field in reports in ABAP?

0 Answers   Deloitte,

---

Please anyone tell me coding to print prime numbers from 1 to 5000 in c#....

2 Answers  

---

how many keywords are present in "c"?

18 Answers   Assurgent, Cynosure Software, IBM,

---

please any one pass file aid,xpeditor and endeavor tools

0 Answers  

---

how to add a new table with variables and thier values into a imported file uisng proc import?

0 Answers  

---

what are the differences between CONS, LIST, and APPEND

0 Answers   Comtech,

---

converting 41.685 to binary

1 Answers   Hughes,

---

hai i like to do some certifications in programming or any other......... am doing my IT third year......... pls guide me...... mail me ur suggestions to ranjithmaharaj@gmail.com...

1 Answers  

---

Number of null pointers in any binary tree

5 Answers   Infosys,

---

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  

---