Question

In: Computer Science

Calculate the following 1) a. Give examples of each: A hex dword, a binary word, and...

Calculate the following
1) a. Give examples of each: A hex dword, a binary word, and decimal byte
c. If x is a word, which command(s) are legal ?
movzx eax,x movzx ah,x movzx ax, x
d. How many bits in a word?
e. Put 12345h in DWORD format.

Solutions

Expert Solution

a)

Hex Dword is a number of bit size doubleword(64 bit) in form of a hexadecimal number.

an example of this would be A7B2 5C43 A345 D2D9

This is a hexadecimnal number which has 64 bits in it making it the size of a dword.

Binary word is a number of bit size Words(32 bit) in binary form.

an example of this would be 1000 1101 0101 0101 0110 1110 0111 1000

This is a binary number of bit size 32 which is the size of a word.

Decimal Byte is a number of bit size Byte(8 bit) in Decimal form.

An example of this is 245

This is a decimal number of size of a byte which is 8 bit.

d)

There are 32 bits in a word.

e)

12345h is a hexadecimal number.

in a dword format we have 64 bit. Each digit of hexadecimal number represent 4 bits in order to represent it in dword format we have to add required number of zeros in order to fill in the space of Dword.

Therefore there will be 16 digit in a DWord in hexadecimal format.

Thus 12345h in DWord format will be written as 0000 0000 0001 2345h.


Related Solutions

Convert the following binary values to hexadecimal and decimal (1 pt each) Write Hex Numbers as...
Convert the following binary values to hexadecimal and decimal (1 pt each) Write Hex Numbers as 0x##(ex 0x0A, 0xFF) Binary Hexadecimal Decimal 0001-1011 0x 0000-1000 0000-0100 0000-1001 0001-1111 1001-1001 0111-1010 1100-0010 1110-0101 1000-1010 0011-0100 0001-1001 0100-0011 1111-1111 1110-0111 0001-0010 0100-1000 0100-1110 1001-0001 0110-1100 Name: Convert the following hexadecimal values to binary and decimal Write binary numbers as 0000-0000 Hexadecimal Binary Decimal 0xf1 0xac 0x56 0x6c 0x32 0x30 0x05 0x28 0xf0 0x07 0x42 0xb9 0x6d 0x2f 0x71 0x0e 0x2d 0xfb 0xba...
How to convert binary to hex?
How to convert binary to hex?
Convert the following values into binary numbers for each word and place the binary values in...
Convert the following values into binary numbers for each word and place the binary values in the two-dimensional array in their proper order of words. Value Binary Number Equivalent Word 0 462,91210 Word 1 1142008 Word 2 5420h Word 3 20,992d Word 4 1104208 Word 5 6102008 Word 6 9F88h Word 7 20,49610 Word 8 502416 Word 9 1101018 Word 10 71082h
Convert the following unsigned numbers to the requested form: 01100001 binary to: hex, and also decimal...
Convert the following unsigned numbers to the requested form: 01100001 binary to: hex, and also decimal Hex: Decimal: b) 136 decimal to: hex, and also binary Hex: Binary:
A binary string is a “word” in which each “letter” can only be 0 or 1...
A binary string is a “word” in which each “letter” can only be 0 or 1 Prove that there are 2^n different binary strings of length n. Note: Your goal is to produce a properly constructed proof by induction, but this does not mean you have to follow Mathematical induction, step-by-step.. Write the statement with n replaced by k Write the statement with n replaced by k+1. Identify the connection between the kth statement and the (k+1)th statement. Complete the...
A binary string is a “word” in which each “letter” can only be 0 or 1...
A binary string is a “word” in which each “letter” can only be 0 or 1 Prove that there are 2^n different binary strings of length n. Note: Your goal is to produce a properly constructed proof by induction, but this does not mean you have to follow Mathematical induction, step-by-step.. Write the statement with n replaced by k Write the statement with n replaced by k+1. Identify the connection between the kth statement and the (k+1)th statement. Complete the...
A binary string is a “word” in which each “letter” can only be 0 or 1...
A binary string is a “word” in which each “letter” can only be 0 or 1 Prove that there are 2^n different binary strings of length n. Note: Your goal is to produce a properly constructed proof by induction, but this does not mean you have to follow Mathematical induction, step-by-step.. Write the statement with n replaced by k Write the statement with n replaced by k+1. Identify the connection between the kth statement and the (k+1)th statement. Complete the...
A binary string is a “word” in which each “letter” can only be 0 or 1...
A binary string is a “word” in which each “letter” can only be 0 or 1 Prove that there are 2^n different binary strings of length n. Note: Your goal is to produce a properly constructed proof by induction, but this does not mean you have to follow Mathematical induction, step-by-step.. Write the statement with n replaced by k Write the statement with n replaced by k+1. Identify the connection between the kth statement and the (k+1)th statement. Complete the...
A) Convert the binary (0100011011) to Hex and multiply it by A8H B) Subtract (0011101111010010) your...
A) Convert the binary (0100011011) to Hex and multiply it by A8H B) Subtract (0011101111010010) your answer in A)
How does one find the binary and hex for MIPS instructions. Such as, sub $s1, $t7,...
How does one find the binary and hex for MIPS instructions. Such as, sub $s1, $t7, $t8 or lw $s1, 400($s5) ???
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT