Question

Given n is the number of positions in radix-r, how many possibilities are wasted due to...

Given n is the number of positions in radix-r, how many possibilities are wasted due to the sign position in the signed-magnitude numbering system.

Homework Answers

Answer #1

I'm attaching the pic for better understanding:-

As total number possible with n positions = rn (i.e, 0 to rn -1)

But for signed magnitude one bit will be wasted for sign representation. So, it will not be fully utilized.

For signed-magnitude number possible will be = 2 * rn-1 (i.e, -rn-1 to rn-1 -1)

So, the numbers wasted will be-

rn - 2 * rn-1 = rn-1 * (r - 2)

If you have any doubt, feel free to ask in comment section.

If you like the solution, please upvote...

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Show that in 2’s complement binary system, the highest significant position acts like a sign (not...
Show that in 2’s complement binary system, the highest significant position acts like a sign (not the same) as in the signed-magnitude binary system. Is this true for any radix-r number system? Justify your answer.
How many levels will there be in a complete binary tree is it has n number...
How many levels will there be in a complete binary tree is it has n number of nodes? looking for formula
Compute the number of possible raceout comes given the following scenarios: a) How many different ways...
Compute the number of possible raceout comes given the following scenarios: a) How many different ways can a first, second and third place winner occur if there are five runners competing and no ties are allowed? b) Now consider the general scenario that there are n runners in total and m distinct slots for which they are competing with no ties. How many different race outcomes are possible, in terms of n and m? c) Now consider that the m...
Problem 3 Given a BST with N nodes, how many tree shapes are there with height...
Problem 3 Given a BST with N nodes, how many tree shapes are there with height N-1? Explain your reasoning. Problem 4 Given a BST with N nodes, how many tree shapes are there with height N-2? Explain your reasoning . Problem 5 Consider an empty 2-3 tree. Draw the tree after each of the following operations is executed: insert 0, insert 9, insert 2, insert 6, insert 7, insert 3, insert 8, delete 2, delete 6
In how many ways can 3 letters be chosen from M, N, O, P, Q, R,...
In how many ways can 3 letters be chosen from M, N, O, P, Q, R, S, assuming that the order of the choices doesn't matter and that repeats are not allowed?
Using seven different Scrabble blocks with the letters: a,e,o,n,r,s,t written on them: a) How many different...
Using seven different Scrabble blocks with the letters: a,e,o,n,r,s,t written on them: a) How many different seven letter arrangements are possible? b) How many three letter arrangements are possible? c) If I choose three letters, then in how many ways can I do this d) If I select six letters then in how many ways can I do this
Given cost and revenue functions and C(q)=112q+31000 R(q)=−3q2+3000q​, how many items must the company produce and...
Given cost and revenue functions and C(q)=112q+31000 R(q)=−3q2+3000q​, how many items must the company produce and sell to earn a profit of $131,480
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number...
1. Given an n-element array A, Algorithm X executes an O(n)-time computation for each even number in A and an O(log n)-time computation for each odd number in A. What is the best-case running time of Algorithm X? What is the worst-case running time of Algorithm X? 2. Given an array, A, of n integers, give an O(n)-time algorithm that finds the longest subarray of A such that all the numbers in that subarray are in sorted order. Your algorithm...
Consider permutations of the 26-character lowercase alphabet Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}. In how many of these permutations do a,b,c...
Consider permutations of the 26-character lowercase alphabet Σ={a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z}. In how many of these permutations do a,b,c occur consecutively and in that order? In how many of these permutations does a appear before b and b appear before c?
1.) How much heat is trasnferred in a process where a 2.35-mole sample of an ideal...
1.) How much heat is trasnferred in a process where a 2.35-mole sample of an ideal gas maintained at a temperature of 402K is compressed from 1.38 m3 to 0.206 m3, in kilojoules? 2.) What is the magnitude of the magnetic force (in N) on a charged particle (Q = 5.0 ?C) moving with a speed of 80x103 m/s in the positive x-direction at a point where Bx = 5.0 T, By = -4.0 T, and Bz = 3.0 T?...