Interested to Buy Any Domain ? << Click Here >> for more details...
iam confused to choose among testing, .net and java
can anybody help me????????
- 0 Answers
- 2034 Views
- I also Faced
- E-Mail Answers
No Answer is Posted For this Question
Be the First to Post Answer
Binary tree?
what is log files in qtp what is use
How can successful and thorough systems planning, analysis, and design be ruined by poor systems construction and implementation? How can poor systems analysis or design ruin a smooth construction and implementation? For both questions, list some consequences
I m new to the dbms. Recently i came across words clustered indexes & nonclustered indexes but i dont know what is this all about & whats the difference between them.. So please help me!!!!!!!!
define profiler???
1Q) your current CTC (current taking currency)? 2Q) Your take home salary?(Monthly Drawing amount, According to your payslips/bank statement) 3Q) Your Expected CTC? 4Q) Your home take salary?
Data Structure: How many comparisons are necessary to find the largest and smallest of a set of n distinct elements?
You are given some denominations of coins in an array (int denom[])and infinite supply of all of them. Given an amount (int amount), find the minimum number of coins required to get the exact amount. What is the method called?
What are two of your strengths that you will bring to our QA/testing team?
Write a shell program. Enter number of days from keyboard. Find out the number of years, month and days it contains
write algo for cobol program whichuse three flat file to extract some specific information 8 marks mainframe
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.
C 
