qtp 9.2 14 days demo version was expired.I uninstalled how to
reinstall this again


No Answer is Posted For this Question
Be the First to Post Answer

Post New Answer

More Programming Languages AllOther Interview Questions

Write a program to read and print a text file on screen

1 Answers   Peerless,


In mainframe SDSF, Can we copy the list of jobs currently executing in SDSF in to a seperate DATASET...?

0 Answers   DST Global Solutions,


What for decision coverage and modified condition decision coverage are used? Wat is the difference between them?

0 Answers  


8.In DSP,Define Signal and System?and various type of signals.

0 Answers  


What is the purpose of <Trigger> element of <updatePanel> in Ajax

0 Answers  






whats the Need for Concurrency control

1 Answers  


How to connect to ms word wit VB ojective is to prepare s/w to generate question paper , selects questions randomly from the ms access , database

0 Answers   Wipro,


HTML is a subset of

8 Answers  


Hi Guys, This is Rama, right now I am working as a Software Test Engineer in Gurgoan and I have over all 3 years of testing expoeriance. Right now I am looking for a change. Can any body help me out to find a job in south india. Thanks in Advance

0 Answers  


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

0 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  


What is the client concept in SAP? What is the meaning of client independent?

3 Answers  


Categories