Interested to Buy Any Domain ? << Click Here >> for more details...
2. What do you mean by DHCP?
- 1 Answers
- 2891 Views
- I also Faced
- E-Mail Answers
DHCP stands for Dynamic Host Configuration Protocol, it is a network protocol, and it enables the server to assign automatically, IP address to a computer.
| Is This Answer Correct ? | 0 Yes | 0 No |
When you?re running a component within ASP.NET, what process is it running within on Windows XP? Windows 2000? Windows 2003?
hi, i'd like to know how do you set lines in a page for Smartforms? thanks in advance
8.In DSP,Define Signal and System?and various type of signals.
when will triggars the at new event in abap and web dybn pro?
what is client server & server? What r types of Joins? explsin it! which types of indexex in sql server? what is triggers?
What is the client concept in SAP? What is the meaning of client independent?
hi friends please tel me how to handle the recovery manager(All i.e PopUp ,Application Crach ,Object state,etc) in QTP
What is the difference between in-proc and out-of-proc?
hi This is radhika.Can anyone help me to know the question papers of NATIONAL INFORMATICS CENTRE for the post of scientific officer/engineer? if anyone know plz tell me question paper pattern
< No Frames > tag is used for
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 ≤ i0 <i1….< ik-1 ≤ 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.
Define Abstract method & class with Example
C 
