what is difference between restoring and non restoring
division?
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 |
Is class is a abstract datatype in java?
Write a pascal program to calculate the sum of the first 100 even number and odd number
WHat is execution in manual testing and when will we start execution and what language we use in execution
Question:Why is mapping required? Computer 'Paging' & 'Segmentation'. Question:Give the disadvantages of Havander's Strategies. Question: What do you mean by Belady's Anomaly. - Describe with example. Question: Discuss the various function of OS. Question: Give a brief discussion on schedulers & Dispatchers with respect to process management.
Why multiple inheritance is removed in java?
difference between list and display command ?
A combination of multiple keys defined in a physical file or logical file is called a _________ key
how do find the user exit for selected feild whatis the process and can u plz explain it
Given an array of size n. It contains numbers in the range 1 to n. Each number is present at least once except for 2 numbers. Find the missing numbers.
hii I inntrested abt scjp certification but i dont knw abt scjp plz send details abt scjp exam and syllabus.
Hi..Am done with my Masters recently..Am planning to learn TIBCO.. could anyone suggest me about how the job market will be and Is there any course necessary to learn prior to Tibco..i mean any prerequisite. I dnt have any knowledge on PL/SQL thats it... Plz suggest me in a best way...
Given an array all of whose elements are positive numbers, find the maximum sum of a subsequence with the constraint that no 2 numbers in the sequence should be adjacent in the array. So 3 2 7 10 should return 13 (sum of 3 and 10) or 3 2 5 10 7 should return 15 (sum of 3, 5 and 7)