What is Meaning of Windows Application & the use of Windows
Applications? with Description.



What is Meaning of Windows Application & the use of Windows Applications? with Description...

Answer / nithya prem

Windows Application is a template that is used to create the
traditional stand-alone Windows application.

Is This Answer Correct ?    4 Yes 5 No

Post New Answer

More Programming Languages AllOther Interview Questions

What is dialog programming?

0 Answers  


how do u handle table control inbdc explain the process in steps iwant the answer in urgent please forward this even i know how to explain there

0 Answers   Synopsis,


What is the difference between save and create method of activerecord?

0 Answers  


Diff between Proc transpose and Arrays with example?

2 Answers   Accenture,


how do find the user exit for selected feild whatis the process and can u plz explain it

0 Answers  






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

0 Answers  


6.int x=10; float y=20; a=x%2=? b=y%2=?

1 Answers  


EXPLAIN UNARY OPEARATORS

0 Answers  


Write 5 differences between Memory Reference Instruction and Register Reference Instruction.

1 Answers   TCS, TJM,


Explain polymorphism. Provide an example.

0 Answers   Amazon,


2. What do you mean by DHCP?

1 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  


Categories