1.) Problem: A number in a computer system is represented in a binary system. The binary system uses a computer WORD. In this problem, assume that a computer word is 8 bits in memory. With the 8 bits setup, a number 10 can be represented with the following set of elements: (8,2) which is equivalent to (00001010). Each bit is 2 raise to the power of bit the position. The bit position starts at 0. In this problem, 8 bits is from 0 to 7 bit. Evaluate the following set operations in an 8-bit system: 1.) 20 U 10 = 2.) 10 U 15 - 20 =

1.) Problem: A number in a computer system is represented in a binary system. The binary system uses a computer WORD. In this problem, assume that a computer word is 8 bits in memory. With the 8 bits setup, a number 10 can be represented with the following set of elements: (8,2) which is equivalent to (00001010). Each bit is 2 raise to the power of bit the position. The bit position starts at 0. In this problem, 8 bits is from 0 to 7 bit. Evaluate the following set operations in an 8-bit system: 1.) 20 U 10 = 2.) 10 U 15 - 20 =

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter13: Overloading And Templates

Section: Chapter Questions

Problem 33SA

See similar textbooks

Similar questions

Please answer 3, 4, 5 using binary number please.
Please answer 3, 4 and 5. Thanks
*All parts please* 2. (50 points) Binary Integer Arithmetic (a) (15 points) Given A = 1111 0011 1100 0011 1100 0000 0000 00002 and assuming A is a single precision IEEE-754 floating point number, what decimal value does A represent? Show A in normalized scientific notation: 1.X ∗ 2^Y. (b) (15 points) Convert 28.410 to IEEE-754 single-precision binary. (c) (20 points) Given X = 0100 0001 0110 1110 0000 0000 0000 00002 and Y = 0100 0001 1011 1100 0000 0000 0000 00002 in single precision IEEE-754 floating point numbers, perform the following operations. Show all your work and express the final answer in single precision IEEE 754-floating point representation. 1. X+Y 2. X*Y Hint: show each value in binary normalized scientific notation prior to performing the arithmetic. This should make following the algorithms easier.
Please help me solve this problem with kind explanations :) We are running programs on a machine where values of type int have a 32-bit two's complement representation. Values of type float use the 32-bit IEEE format, and values of type double use the 64-bit IEEE format. We generate arbitrary integer values x, y, and z, and convert them to values of type double as follow: /* Create some arbitrary values */ int x = random(); int y = random(); int z = random(); /* Convert to double */ double dx = (double) x; double dy = (double) y; double dz = (double) z; For each of the following C expressions, you are to indicate whether or not the expression always yields 1. If it always yields 1, describe the underlying mathematical principles. Otherwise, give an example of arguments that make it yield 0. Note that you cannot use an IA32 machine running GCC to test your answers, since it would use the 80-bit extended-precision representation for both float and double. A. (double)(float) x == dx B. dx…
MIPS: Write a program that compare two single precision floating point numbers numA and numB. If numA is greater than numB, Swap the numbers.
In the function malloc(), each byte of allocated space is initialized to zero. a) True b) False
Problem F. 73154. Trailing zeros Input file: Output file: Time limit: Memory limit: standard input standard output 1 second 256 megabytes In this problem, you are given 8-bit number r. Find the number of trailing zeros in its binary representation. Trailing zeros are the ones that we encounter until the first 1-bit if we traverse the binary representation from right to left. For example, the binary representation of the mumber 96 is 01100000. Number of 0-bits until the first 1-bit is 5 (considering that we traverse the binary representation from right to left). Input The first line of input contains a single number z – 8-bit number (1
▼ Part A - The effect of an arithmetic shift on signed numbers Let's look at see what happens to signed numbers during a shift operation. As with most problems with number representations, errors can be intermittent. Sometimes the code will work as expected, and other times it will behave in a manner that seems to be totally arbitrary. Consider the following code fragment that makes use of the fact that shifting a value left by one place multiplies the number by 2. By passing in the number to be multiplied and the power of 2 to multiply it by (for example 4 = 22) the correct answer should be passed back from the function after the results are printed for the user to examine. signed int mult_2_to_n (signed int num, int n) { signed int result; result = num << n; printf("%d multiplied by 2^%d %d\n", num, n, result); return result; } Using a signed number as the manipulated integer may cause an error in some cases. Several approaches may be used to fix the problem. Which solutions below…
1a) Give the values of the following: M[i,i+1] for i=1,...,5 M[i,i+2] for i=1,...,4 M[i,i+3] for i=1,...,3 f M[1,5] and M[2,6] M[1,6]. b) How do you place the parentheses to compute A by this number of scalar multiplications? For multiplication from left to right write ((((A1A2)A3)A4)A5)A6. c) How many ways to place the paratheses to compute A are there that achieve the minimum number of scalar multiplications?
*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
Please answer part D only
1. Construct an eight-digit binary number which has a point. Providing that the eight-digit binary number must have at least four 1’s with two digits after the point. Convert it to denary.