ZuoTi.Pro
Question

3 assume we have the following For 1. X DWORD 0000 00001110|1111|1010|1101|01101100, Complete all cells The additive inverse

engineering   Computer-Science   
0 0
Add a comment Improve this question Transcribed image text
Next > < Previous
Sort answers by oldest

Homework Answers

Answer #1

Answer:
1111 1111 0001 0000 0101 0010 1001 00112
Explanation:
Addiditive inverse means by adding the number to its additive inverse the result must be zero.
In the binary system, additive inverse would be its 1's compliment.

0 0
Add a comment
Know the answer?
Add Answer to:
3 assume we have the following For 1. X DWORD 0000 00001110|1111|1010|1101|01101100, Complete all cells The...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Log In

Sign Up

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions

  • please make sure the answer is clear. 3. Given X (0100 0010 0000 1111 0000 0000...

    please make sure the answer is clear. 3. Given X (0100 0010 0000 1111 0000 0000 0000 0000)2 and Y (0100 0001 1010 0100 0000 0000 0000 0000)2 in single precision IEEE-754 floating point numbers, perform the following operations. Show all of 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...

  • Given A = (1111 0011 1100 0011 1100 0000 0000 0000)2 and assuming A is a...

    Given A = (1111 0011 1100 0011 1100 0000 0000 0000)2 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 * 2Y. Convert (28.4)10 to IEEE-754 single-precision binary. Given X = (0100 0010 0000 1111 0000 0000 0000 0000)2 and Y = (0100 0001 1010 0100 0000 0000 0000 0000)2 in single precision IEEE-754 floating point numbers, perform the following operations. Show all of your...

  • Given X = (0100 0010 0000 1111 0000 0000 0000 0000)2 and Y = (0100 0001...

    Given X = (0100 0010 0000 1111 0000 0000 0000 0000)2 and Y = (0100 0001 1010 0100 0000 0000 0000 0000)2 in single precision IEEE-754 floating point numbers, perform the following operations. Show all of 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. Rubric: Shows X and Y...

  • We have learned a famous shift cipher called Caesar Cipher. Now if we are given a...

    We have learned a famous shift cipher called Caesar Cipher. Now if we are given a plain test: THE ART OF WARAnd key = 3 (a shift by 3 letters), please give the ciphertext Given an 8 bit block P = 10101111 and a key K = 01101011, please give the result of bitwise XOR between P and K Please give the left 2 shift of the 8 bit text 01100101 Use the given a permutation table 23614857 to define...

  • 5. Fill in all cells that have numbers. X WORD Y WORD Z WORD PSEUDO CODE...

    5. Fill in all cells that have numbers. X WORD Y WORD Z WORD PSEUDO CODE X = 9D1016 Y=9E89,6 Z:=X+Y 6. Fill in all cells that have numbers. X BYTE Y BYTE Z BYTE PSEUDO CODE X = 20510 Y:= 225, Z:=X+Y 7. Fill in all cells that have numbers. X DWORD Y DWORD Z DWORD PSEUDO CODE X = 05FFAD10,6 Y:= 7FFEDE89,6 Z:=X-Y TITIL

  • Arduino. DEC HEX BIN(4-bits) Introducing ARDUINO 0 0 0000 1 1 0001 2 2 0010 3...

    Arduino. DEC HEX BIN(4-bits) Introducing ARDUINO 0 0 0000 1 1 0001 2 2 0010 3 3 0011 4 4 0100 5 5 0101 How many 1/0 of Port-D? How many usable 1/0 of Port-D, if Serial-Communication is in-used? What is the Arduino's pin assignment of ATMEL's PC5, PB3, & PD1*? What is the ATMEL's pin assignment of Arduino's D13*, D1, & D19? To complete the table about Number System Conversion (shown your step) 6 6 0110 7 7 0111...

  • DO bit 0 1 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits for...

    DO bit 0 1 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits for segment no and 13 bits for offset. Segment table of the currently running process is given below: a) (5) How many segments can this Segment Present Modify process have at maximum? Length bit Base 0 0 0 0100 0111 0000 0100 0000 1000 0100 b) (15) Convert the following logical 1 1 0100 0100 0001 0010 0010 1100 1000 address to physical (real) address...

  • Evaluate the following problems. a) 1. Evaluate den(Y,0,16) 2. Evaluate hex(Y[0],2) 3. Evaluate HEX(*(Y+4),2) 4. Evaluate...

    Evaluate the following problems. a) 1. Evaluate den(Y,0,16) 2. Evaluate hex(Y[0],2) 3. Evaluate HEX(*(Y+4),2) 4. Evaluate oct(*(Y+4),3) 5. Convert Y into 13-bit binary 6. Evaluate den(Y[4],0,2) 7. What is the octal representation (3 digit) of denary 256? 8) What is the Hex ...... (3 Hex digit) of denary 256? 1530:Y 11111101 1531 01010101 1532 10000 1111 1533 1000 0000 1534 11111111 1535 10001 1101 1536 0010 1010 1537 1000 0011

  • Assume we have the following PDF for the random variable X x 0 1 2 3...

    Assume we have the following PDF for the random variable X x 0 1 2 3 4 f ( x ) .2 .1 .15 .3 .25 If Var ( X ) = 2.11, what is Var(3-2X)

  • Base no bit 0 0 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits...

    Base no bit 0 0 Q-2 (25p): Assume that logical addresses are 16-bit long: 3 bits for segment no and 13 bits for offset. Segment table of the currently running process is given below: a) (5) How many segments can this Segment Present Modify Length process have at maximum? bit 0 00100 0111 0000 0100 0000 1000 0100 b) (15) Convert the following logical 10100 0100 0001 0010 0010 1100 1000 address to physical (real) address. 2 01100 0100 0000...

ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT