Following the bit-level floating-point coding rules, implement the function with the following prototype:
/*
* Compute 1(int) If.
* If conversion causes overflow or f is NaN, return 0x80000000
*/
int float_f21(float_bits f);
For floating-point number f, this function computes (int) f. Your function should round toward zero. If f cannot be represented as an integer (e.g., it is out of range, or it is NaN), then the function should return 0x80000000.
Test your function by evaluating it for all 232 values of argument f and comparing the result to what would be obtained using your machine’s floating-point operations.
Want to see the full answer?
Check out a sample textbook solutionChapter 2 Solutions
Computer Systems: A Programmer's Perspective (3rd Edition)
Additional Engineering Textbook Solutions
Artificial Intelligence: A Modern Approach
Java: An Introduction to Problem Solving and Programming (8th Edition)
Differential Equations: Computing and Modeling (5th Edition), Edwards, Penney & Calvis
Computer Science: An Overview (12th Edition)
Introduction to Programming Using Visual Basic (10th Edition)
- Code the function multiplier(). /***** *** //The multiplier function takes 2 integer // parameters n1 and n2 and displays the result // of n1 times n2 //*** *******arrow_forwardGiven a Binary Number B, find its decimal equivalent. Example 1: Input: B = 10001000 Output: 136 Example 2: Input: B = 101100 Output: 44 Your Task: You don't need to read or print anything. Your task is to complete the function binary_to_decimal() which takes the binary number as string input parameter and returns its decimal equivalent. Expected Time Complexity: 0(K* Log(K)) where K is number of bits in binary number. Expected Space Complexity: 0(1)arrow_forwardModify the below program that the input values representingfractions are stored with denominators that are positive integers. You cannot require the user to only enter a positive denominator value; the user should not be inconvenienced by such a restriction. For example, whilst values of 1 / -2 are acceptable inputs for a fraction, the output representation should be -1 / 2. Your solution should check the denominator input; if it is negative, swap the sign of both numerator and denominator instance variables. //Import the essential package import java.util.ArrayList; import java.util.Scanner; //Define the class Fraction class Fraction { private int n, d; public Fraction() { //Initialize the values this.n = this.d = 0; } public Fraction(int n, int d) { //Initialize the variables this.n = n; this.d = d; } //Define the getter function getNum() that returns the numerator public int getNum() {…arrow_forward
- 2. Write a recurrence relation describing the worst case running time of each of the following algorithms and determine the asymptotic complexity of the function defined by the recurrence relation. Justify your solution. You may not use the Master Theorem as justification of your answer. Simplify and express your answer as (nk) or (nk log₂ n) whenever possible. If the algorithm is exponential just give exponential lower bounds. a) function func(A,n) if n ≤ 5 then return A(1) else for i=1 to n for j = i to n-1 A(j) A(j) + A(i) + 3 /* endfor */ /* endfor */ wwwwwwwwww y ← func(A, n-6) return (y)arrow_forward****************************** ********** Q4} For the following function f(x)=Sin(x) - Cos(x)+x. Write the mat lab commands to: 1.Draw the function in [-II, II]. 2.Find the zeros of this function. 3. Find the minimum value of function. 4. Find f(1/2) 5.integration the function.arrow_forwardIn the function malloc(), each byte of allocated space is initialized to zero. a) True b) Falsearrow_forward
- The following function will correctly return true if its argument is an odd integer bool Isodd (int x) { return (x / 2 == 1); } True Falsearrow_forwardthe minimal POS of the following function is (f (A, B,C) = []M(2,6)) : Select one: O A. A.B О в. В + С' О с. В' + С O D. A + B CamScanner+ gub da guaallarrow_forwardF = A +B'C which one of the followings is the representation of function F in terms of SOP form? F(A,B,C)= m0+m2+m3 F(A,B,C)= M0+M2+M3 F(A,B,C) = M1+M4+M5+M6+M7 F(A,B,C) = m1+m4+m5+m6+m7arrow_forward
- (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.arrow_forward(Numerical) Using the srand() and rand() C++ library functions, fill an array of 1000 floating-point numbers with random numbers that have been scaled to the range 1 to 100. Then determine and display the number of random numbers having values between 1 and 50 and the number having values greater than 50. What do you expect the output counts to be?arrow_forwardHAHAAAAAAHN HNM1000 OHNM 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 27 28 30 31 32 section . data .section .text .globl _start start: pushq $4 pushq $3 call function-A addq $16, $rsp movg %rax, %rbx movq $1, rax int $0x80 .type function-A, @function function-A: pushq rbp movq rsp, rbp. subq $8, rsp mova 16 (%rbp), rbx movg 24 (rbp), rcx movg %rbx, -8(%rbp) label-A: #variable y #variable z cmpq $1, $rcx je label-B movq -8 (&rbp), rax imulg %rbx, srax movq rax, -8 (%rbp) decq rcx jmp label-A label-B: movq -8 (Srbp), rax movq rbp, rsp popq &rbp retarrow_forward
- C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr