×
Log in to StudySoup
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.2 - Problem 56e
Join StudySoup for FREE
Get Full Access to Discrete Mathematics And Its Applications - 7 Edition - Chapter 4.2 - Problem 56e

Already have an account? Login here
×
Reset your password

How many bit operations does the comparison algorithm from

Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen ISBN: 9780073383095 37

Solution for problem 56E Chapter 4.2

Discrete Mathematics and Its Applications | 7th Edition

  • Textbook Solutions
  • 2901 Step-by-step solutions solved by professors and subject experts
  • Get 24/7 help from StudySoup virtual teaching assistants
Discrete Mathematics and Its Applications | 7th Edition | ISBN: 9780073383095 | Authors: Kenneth Rosen

Discrete Mathematics and Its Applications | 7th Edition

4 5 1 317 Reviews
24
1
Problem 56E

Problem 56E

How many bit operations does the comparison algorithm from Exercise 55 use when the larger of a and b has n bits in its binary expansion?

Step-by-Step Solution:

Solution

In this question we have to find the number of bit operations used by the comparison algorithm

when the larger of a and b has n bits in its binary expansion?

Step 1

As mentioned in exercise 55

Pseudocode for the algorithm

procedure compare

while

if  then print “a is less than b”

if   then print “a is equal to b”

if   then print “a is greater than b”.

For every j there is one bit comparison since in the worst condition there can be total n bit operations .

Therefore we can say that there will be at most n bit operations.

Thus the Complexity is O(n).

Step 2 of 1

Chapter 4.2, Problem 56E is Solved
Textbook: Discrete Mathematics and Its Applications
Edition: 7
Author: Kenneth Rosen
ISBN: 9780073383095

This full solution covers the following key subjects: Algorithm, Binary, bit, bits, Comparison. This expansive textbook survival guide covers 101 chapters, and 4221 solutions. The full step-by-step solution to problem: 56E from chapter: 4.2 was answered by , our top Math solution expert on 06/21/17, 07:45AM. Discrete Mathematics and Its Applications was written by and is associated to the ISBN: 9780073383095. This textbook survival guide was created for the textbook: Discrete Mathematics and Its Applications, edition: 7. The answer to “How many bit operations does the comparison algorithm from Exercise 55 use when the larger of a and b has n bits in its binary expansion?” is broken down into a number of easy to follow steps, and 26 words. Since the solution to 56E from 4.2 chapter was answered, more than 298 students have viewed the full step-by-step answer.

Other solutions

People also purchased

Related chapters

Unlock Textbook Solution

Enter your email below to unlock your verified solution to:

How many bit operations does the comparison algorithm from