Chapter 2: Practice Problems I. Assume we are running code on a 8-bit machine using two's complement arithmetic for signed integers. A "short" integer is encoded using 4 bits. Fill in the empty boxes in the table below. The following definitions are used in the table: short sy = -3; int y = sy; int x = -17; unsigned ux = x Note: You need not fill in entries marked with "_" Only accepted format for binary representation (use 8-bits): 00000000, 11111111 Only accepted format for hexadecimal representation: 4D, EF, FF Expression Binary Zero ux Y X>> 2 Tmax Tmax+Tmin Tmin - 1 Decimal 0 -3 00110010 Hexadecimal

Chapter 2: Practice Problems I. Assume we are running code on a 8-bit machine using two's complement arithmetic for signed integers. A "short" integer is encoded using 4 bits. Fill in the empty boxes in the table below. The following definitions are used in the table: short sy = -3; int y = sy; int x = -17; unsigned ux = x Note: You need not fill in entries marked with "_" Only accepted format for binary representation (use 8-bits): 00000000, 11111111 Only accepted format for hexadecimal representation: 4D, EF, FF Expression Binary Zero ux Y X>> 2 Tmax Tmax+Tmin Tmin - 1 Decimal 0 -3 00110010 Hexadecimal

Microsoft Visual C#

7th Edition

ISBN:9781337102100

Author:Joyce, Farrell.

Publisher:Joyce, Farrell.

Chapter2: Using Data

Section: Chapter Questions

Problem 17RQ: When you perform arithmetic operations with operands of different types, such as adding an int and a...

See similar textbooks

Similar questions

6.use c code to Develop a code that gets two integers from the user and calculates and prints their least common multiplier or LCM. LCM is the smallest number that divides both given integers. Example. lcm (10, 15) = 30, lcm (5,7) = 35 and lcm (12, 24) = 24Hint: we know that lcm(x,y) = xy/gcd(x,y) where gcd is the greatest common divisor (discussed in class). Develop a gcd function in your code, get the two numbers from the user, call your function to calculate their gcd and then use the formula above to calculate and display their lcm GOOD LUCK! Reference This is a list of function prototypes of the C library functions presented in class. You may use any of these functions in your solutions (unless the requirements explicitly indicate otherwise). As you have been provided the function prototypes, you are expected to use the functions correctly in your solutions. double atof(char *string); int atoi(char *string); long atol(char *string); int fclose(FILE *filePointer); char *fgets(char…
6. Find the errors from the following code. a. T=[a,b,c] printlh (T) b. for i in 1 to 100 : print (1) c. i=10 while [ib) print (a): else if (a
Language: JAVA Problem 1: Decimal to Binary Conversion Write a program that takes an integer value as an input and converts that value to its binary representation; for instance, if the user inputs 17, then the output will be 10001. Do not forget to check for valid input, which means if the user inputs a type of data other than an integer re-prompt the user to enter a valid value. The output binary number can be a string. Sample input and output: Enter an integer > a You entered an invalid type. Try again. Enter an integer > 17 10001
*Code in Python A bit shift is a procedure whereby the bits in a bit string are moved to the left or to the right. For example, we can shift the bits in the string 1011 two places to the left to produce the string 1110. Note that the leftmost two bits are wrapped around to the right side of the string in this operation. Define two scripts, shiftLeft.py and shiftRight.py, that expect a bit string as an input. The script shiftLeft shifts the bits in its input one place to the left, wrapping the leftmost bit to the rightmost position. The script shiftRight performs the inverse operation. Each script prints the resulting string. An example of shiftLeft.py input and output is shown below: Enter a string of bits: Hello world! ello world!H An example of shiftRight.py input and output is shown below: Enter a string of bits: Hello world! !Hello world
7. We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different "digits" {0,1,.9). Sometimes though it is useful to write numbers in hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0,1,..,9,A,B,C,D,E,F}. So, for example, a 3 digit hexadecimal number might be 3B8. (a) How many 2-digit hexadecimals are there in which the first digit is E or F? Explain your answer in terms of the additive principle (using either events or sets). (b) Explain why your answer to the previous part is correct in terms of the multiplicative principle (using either events or sets). Why do both the additive and multiplicative principles give you the same answer? (c) How many 3-digit hexadecimals start with a letter (A-F) and end with a numeral (0-9)? Explain. (d) How many 3-digit hexadecimals start with a letter (A-F) or end with a numeral (0-9) (or both)? Explain.
المزيد ... التقويم :what is the value of x according to the calculation .4 x = (4 + 2 * 3) + (16/4 + 1) (3 + 8)/4 * (2 نقطة) Apply rules of precedence and show your work أدخل إجابتك النشار
Question 2 A number in base 2 (binary) is a number such that each of its digits is O or 1. To convert from binary to decimal (base 10), the digits starting from the right are multiplied by powers of 2 (starting at 0) and added. For example, the value in decimal of 10011 is calculated as follows: Write a program that reads from the user a 5-digit integer representing a value in binary and displays its equivalent value in decimal. Note that if the user enters an integer which digits are other than 0 or 1, the program displays a message stating that the number is invalid. Sample Run 1: Enter a 5-digit integer made of Os and 1s: 10011 10011 in decimal is 19 Sample Run 2: Enter a 5-digit integer made of Os and ls: 13001 13001 is not valid
code this:
hexadecimal We usually write numbers in decimal form (or base 10), meaning numbers are composed using 10 different “digits” {0, 1, . . . , 9}. Sometimes though it is useful to write numbers hexadecimal or base 16. Now there are 16 distinct digits that can be used to form numbers: {0,1,...,9,A,B,C,D,E,F}. So for example, a 3 digit hexadecimal number might be 2B8. (d) How many 3-digit hexadecimals start with a letter (A-F) or end with a numeral (0-9) (or both)? Explain (please answer it the way i can make myself understand)
hexadecimalWe usually write numbers in decimal form (or base 10),meaning numbers arecomposed using 10 different “digits” f0; 1; : : : ; 9g.Sometimes though it is useful to write numbers hexadecimal or base16. Now there are 16 distinct digits that can be used to form numbers:f0; 1; : : : ; 9;A; B; C;D; E; Fg. So for example, a 3 digit hexadecimalnumber might be 2B8.(a) How many 2-digit hexadecimals are there in which the first digitis E or F? Explain your answer in terms of the additive principle(using either events or sets).(b) Explain why your answer to the previous part is correct in termsof the multiplicative principle (using either events or sets). Whydo both the additive and multiplicative principles give you thesame answer?(c) How many 3-digit hexadecimals start with a letter (A-F) and endwith a numeral (0-9)? Explain.(d) How many 3-digit hexadecimals start with a letter (A-F) or endwith a numeral (0-9) (or both)? Explain.
a) What is "Approximation Error" in floating-point representation? Approximation Error - Since in floating point representation we can not represent all real numbers so there occurs an error.It is difficult to represent some decimal numbers in binary form. b) Why is it happening? Floating point Approximation error occur because it uses fixed no. of bits to represent decimal numbers. It is difficult to represent real numbers with the help of fixed bits of binary numbers. Also some decimal numbers are difficult to represent in binary form. c) How can we minimize it? We can minimise it by- 1.Changing radix 2.Adding numbers of different magnitude value. 3.overflow 4. underflow 5.Subtracting numbers of same magnitude value. Dont use answers from other websites please! Please type your answer not picture d) How can the character codes be a solution for this?
a. Following pseudocode on slide #30, implement a function to perform binary addition. The function takes two integers as inputs, and returns the binary representation of the sum of the two numbers as a string. Note that the addition has to be performed using the binary representations of the two integers, meaning you can not do '5+8 = 13' then return the binary representation of 13. Use the following pairs to test your code: (24,98), (2387482,1), (25,25) Binary Addition of Integers Algorithms for performing operations with integers using their binary expansions are important as computer chips work with binary numbers. Each digit is called a bit. procedure add(a, b: positive integers) {the binary expansions of a and b are (a-19-2.a) and (b-1b-2²b)₂ respectively} n-2' n-2' C:=0 for j:= 0 to n-1 d:= := [(a₁ + b₁ + c)/2] s, := a₁ +b+c=2d c:= d S := C return(s,S₁,...,s){the binary expansion of the sum is (SS-₁,5)₂} The number of additions of bits used by the algorithm to add two n-bit…