A.
Fractional binary numbers:
If each binary digit or bit bi ranges between “0” and “1”, then the notation represented by the below equation
Round-to-even rule:
- This rule rounding can be used even when user are not rounding to a entire number. The rounding can be calculated by using whether the least significant digit is even or odd.
- To binary fractional number, the round-to-even can be used by considering least significant value “0” to be even and “1” to be odd.
Example:
The example for round-to-even is shown below:
Consider a binary number is “10.000112” that is fractional
- From the above binary number, the decimal for “10” is “2”.
- Here the rounding the values nearest to 2 bits to the right of the binary point.
- Hence, the result after rounding is “10.002”.
B.
Fractional binary numbers:
If each binary digit or bit bi ranges between “0” and “1”, then the notation represented by the below equation
Round-to-even rule:
- This rule rounding can be used even when user are not rounding to a entire number. The rounding can be calculated by using whether the least significant digit is even or odd.
- To binary fractional number, the round-to-even can be used by considering least significant value “0” to be even and “1” to be odd.
Example:
The example for round-to-even is shown below:
Consider a binary number is “10.000112” that is
- From the above binary number, the decimal for “10” is “2”.
- Here the rounding the values nearest to 2 bits to the right of the binary point.
- Hence, the result after rounding is “10.002”.
C.
Fractional binary numbers:
If each binary digit or bit
Round-to-even rule:
- This rule rounding can be used even when user are not rounding to a entire number. The rounding can be calculated by using whether the least significant digit is even or odd.
- To binary fractional number, the round-to-even can be used by considering least significant value “0” to be even and “1” to be odd.
Example:
The example for round-to-even is shown below:
Consider a binary number is “10.000112” that is
- From the above binary number, the decimal for “10” is “2”.
- Here the rounding the values nearest to 2 bits to the right of the binary point.
- Hence, the result after rounding is “10.002”.
D.
Fractional binary numbers:
If each binary digit or bit bi ranges between “0” and “1”, then the notation represented by the below equation
Round-to-even rule:
- This rule rounding can be used even when user are not rounding to a entire number. The rounding can be calculated by using whether the least significant digit is even or odd.
- To binary fractional number, the round-to-even can be used by considering least significant value “0” to be even and “1” to be odd.
Example:
The example for round-to-even is shown below:
Consider a binary number is “10.000112” that is
- From the above binary number, the decimal for “10” is “2”.
- Here the rounding the values nearest to 2 bits to the right of the binary point.
- Hence, the result after rounding is “10.002”.
Want to see the full answer?
Check out a sample textbook solutionChapter 2 Solutions
Computer Systems: Program... -Access
- Problem 15 (#2.3.30).If f and f◦g are one-to-one, does it follow that g must be one-to-one? Justify your answer.arrow_forward3. Simplify the following Boolean functions, using four-variable Kmaps: (a) F (w, x, y, z) = Σ(1, 4, 5, 6, 12, 14, 15) (b) F (A, B, C, D) = Σ(2, 3, 6, 7, 12, 13, 14) (c) F (w, x, y, z) = Σ(1, 3, 4, 5, 6, 7, 9, 11, 13, 15)arrow_forwardProblem 2. Evaluate the expressions in each of the following triples: (c) 3 (mod4) = 10 (mod4) = 3·10 (mod4) =arrow_forward
- Q.) Do given c and d problem belowarrow_forwardSo I need help solving this particular HW problem.arrow_forward3. The diagram below shows the main land routes for vehicular traffic between points A and G in a city. The figures in the arcs represent the cost of traveling between each pair of nodes. a) Manually apply Dijkstra's algorithm to find the cheapest route between A and G (visited nodes and total distance). b) Formulate a linear programming problem in extended form, to determine the shortest route to travel from A to G. Do not use subscripts, name 14 variables, for example XFE would be the variable that indicates that the arc from F to E is used. c) If there is a fixed cost for visiting each node, modify the formulation of the problem to include said fixed cost in the objective function, and the variables and restrictions that are required. NODE A B C D E F G FIXED COST 25 18 32 20 28 18 34arrow_forward
- Solve the problem and simplify the output function using Quine – Mc Cluskey Method F (A,B,C,D) = Σm (0,2,4,6,8,10,12,14)arrow_forwardA researcher would want a system he can use for his research work. The system should ask for a minimum value, maximum value and interval mode. Such values will be used as the minimum and maximum values of x to solve the given equation: f(x) = x3 – 4x2 + 10x - 4arrow_forward(Practice) a. To convert inches (in) to feet (ft), the number of inches should be multiplied by which of the following conversion factors? i. 12 in/1 ft ii. 1 ft/12 in b. To convert feet (ft) to meters (m), the number of feet should be multiplied by which of the following conversion factors? i. 1 m/3.28 ft ii. 3.28 ft/1 m c. To convert sq.yd to sq.ft, the number of sq.yd should be multiplied by which of the following conversion factors? i. 1 sq.yd/9 sq.ft ii. 9 sq.ft/1 sq.yd d. To convert meters (m) to kilometers (km), the number of meters should be multiplied by which of the following conversion factors? i. 1000 m/1 km ii. 1 km/1000 m e. To convert sq.in to sq.ft, the number of sq.in should be multiplied by which of the following conversion factors? i. 144 sq.in/1 sq.ft ii. 1 sq.ft/144 sq.in f. To convert minutes (min) to seconds (sec), the number of minutes should be multiplied by which of the following conversion factors? i. 60 sec/1 min ii. 1 min/60 sec g. To convert seconds (sec) to minutes (min), the number of seconds should be multiplied by which of the following conversion factors? i. 60 sec/1 min ii. 1 min/60 secarrow_forward
- Please answer Parts D and E of this problemarrow_forward4 We consider the following initial value problem for two functions y(x),z(x): 0=y′′+(y′+6y)cos(z), 5z′=x^2+y^2+z^2, where 0≤x≤2 and y(0)=1.7, y′(0)=−2.7, z(0)=0.5. Approximate the solution of this initial value problem using Euler's method with 100 steps. (use Maple) What approximation value do you obtain for y(2) and z(1)?arrow_forwardSimplify the following formula. 1. F = XY’Z’ + X’Y’Z’ + X’Y’Z + X’YZ 2. F = X’YZ’ + XYZ’ + XYZ + XY’Zarrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr