kindly send interview materials
No Answer is Posted For this Question
Be the First to Post Answer
Hi guys... I have one doubt ..Exception is a runtime error then why we have checked exception... Thanks in advance
How to set fixed width in particular <td> in html? if i type more character in this <td> it will not push near <td>. this is my question. can u tell me the answer...
Tag for turning an image into a hyperlink is
5. Which of the following can you do with DB2 Express- C? Query databases with SQL Query databases with XML using XQuery and XPath Use SQL in Xquery and Xquery in SQL All of the above
What is WEB 3.0? What are the features their in WEB3.0
What are the main principles of OOP?
Fortran cannot have value by reference True or False?
Wats the name of the first os
what is throws keyword
Q2. A memory location has physical address D5687h. Compute: a. The offset address if the segment number is D445h. b. The segment number if the offset address is B577h.
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.
5. How do you round the addition or subtraction of two numbers in assembler?