1.what is the vesition managment.


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

Post New Answer

More Programming Languages AllOther Interview Questions

how to get second highest salary from a employee table and how get a 5th highest salary from a employee table by using proc sql?

0 Answers   ABC,


What are the other ways to create an object with out calling new keyword in java?

2 Answers   HCL,


is it possible to learn sap from book without any tutorial. if yes please mention the beginner,s book of sap and also make your valuable advice for self study of sap .

0 Answers  


How to create a new dataset only duplicate observations in proc sort procedure?

0 Answers   Accenture,


you have an unlimited supply of $3 and $7 poker chips. What is the largest integer value that you cannot make by combining different numbers of chips?

2 Answers  






Fortran cannot have value by reference True or False?

2 Answers   Geometric Software,


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

0 Answers   TCS,


what are the activities you enjoy most and How do you see these Developing in the Future with Reference to in your work life and in your personal life

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 diffrent between Method and and function in c#

0 Answers  


Can we write a method in JSP.If so how?

0 Answers   HCL,


technical interview questions and process

0 Answers   Ariba,


Categories