Interested to Buy Any Domain ? << Click Here >> for more details...
what is difference between restoring and non restoring
division?
- 2 Answers
- 50801 Views
- Texas, I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / anindya mandal
In restoring method if after subtraction or addition if the
sign of A is changed then we restore the previous value of A
But in contrast with non restoring division if the sign of A
is negative then A, Q will be shifted left so negation bit
will be carry then. In both the cases we pruning the
negative bit
one by restoring method
another by shifting left method which is called non
restoring method.
| Is This Answer Correct ? | 93 Yes | 33 No |
Answer / khawlya maanjar
in restoring method after operation value sign is changes
after it stored previous value
| Is This Answer Correct ? | 14 Yes | 30 No |
A, B and C are 8 bit nos. They are as follows: A 1 1 0 1 1 0 1 1 B 0 1 1 1 1 0 1 0 C 0 1 1 0 1 1 0 1 Find ( (A-B) u C )=? how to solve this need with steps
how to generate dsnless connectivity in j2ee
how can we implement locks in plsql?
what is meant by life cycle of a business
WHAT IS MAIN IMPORTANT THING IN SOFTWARE?
shall we execute our java programmes in jre
How many packages available in java??
How to get the index of the clicked field in reports in ABAP?
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.
1.group by clause explain along with an example
What is the difference between save and create method of activerecord?
what is static objects in java
C 
