Log in
HomeStudy Guides420,000AU10,000

1007ICT Study Guide - Final Guide: Scientific Notation, Ieee Floating Point

44 views2 pages
aaryaparya84
8 Nov 2021
School
Griffith University
Department
Computer Science
Course
1007ICT
Professor

For unlimited access to Study Guides, a Grade+ subscription is required.

Document Summary

Do not use a calculator to compute the answers for questions 1 to 3: convert the following decimal values into binary, 203. 125. Answer:11001011. 001: 81. 1 (stop at 13 decimal places) Answer: 1010001. 0001100110011: convert the following binary values into decimal (you may leave the answer as a fraction, 1011010. 01. Answer: 71. 625: rewrite the following decimal values in normalised form scientific notation. Your answer must be in decimal: 9876541. 1891. Or 9. 0007123e-4: given this ieee-754 32 bit floating point value: 110010100 00000000000000000000011 convert it into its decimal representation (use a calculator for the division step) (hint: 223 = 8,388,608) Answer (show working for full mark): the first bit tells that number is negative, the next 8 bits 10010100. Excess 148-127=21: the remaining 23 bits are the normalized mantissa. So mantisa is 1. 00000000000000000000011: convert 23 bits mantissa to decimal. Move binary point 23 places to the right. Numerator / denominator= 8388611 / 8388608: decimal real number= -1. 00000035762786865234375 x 2 21.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers

Related Documents

1007ICT Lecture Notes - Lecture 2: Binary Number
aaryaparya84
1007ICT
Final Exam
Study Guide
1007ICT Study Guide - Final Guide: Data Link Layer, Unicast, Mac Address
aaryaparya84
ACCT 2000 Chapter : Hw3soln 2740 S15
azuremammoth471

Related Questions

29. Consider the Cocktail Sort (code 4) algorithm described in the appendix. What is the fewest number of lines of code that would have to be added, removed, or changed in order for this algorithm to sort from largest to smallest? (A) Everything inside the second for loop. (B) 3 (C) 1 (D) 2 (E) Everything inside both for loops. Binary answers For the following questions you are to use your choices as they were the representation of a binary number. More precisely, A = 24, B = 23, C = 22, D = 21, and E = 20 position in a base 2 number. For example if you wanted to answer the number 23, you would translate it first as base 2 number, which is 10111, you would blacken A, C, D and E.2 Lets look at this process on your answer sheet, we have these 5 circle you can blacken. Normally you only pick one, here you might have to blacken more than one! @ ® © D ® Following the previous example, the answer we want to input is 23, its binary representation is 10111, hence the circle you would blacken are the following:

(e) method (4, 4); 15. You are writing a method called findMax that takes as input three decimal numbers and prints the value of the largest one. What does the method header look like? Just write the header. Do not write the whole method. If you think there is more than one possible correct answer, just answer one of them.

17. Which of the following are examples of compile-time errors? Write the letters corresponding to the correct answers on your answer sheet. (a) Accessing an array at index -1 (b) Dividing an integer by 0 (c) Passing an int value as input to a method that expects a double input argument (d) Accessing a variable outside of its scope. (e) Omitting a semi-colon at the end of a statement. For the next two questions, consider the following block of code: for (int i=0; i<5; i+=2) { for(int j=0; j<=i; j++){ System.out.println("Bubblegum");