Question: a . The binary equivalent for the decimal number 5 0 is 0 0 1 1 0 0 1 0 The SHR ( shift right

a. The binary equivalent for the decimal number 50 is 00110010
The SHR (shift right) instruction performs a logical right shift on the destination operand. The highest bit position is filled with a zero. So that shr 2 means it shifts 2 bits logically to the right. Shifting right \( n \) bits divides the operand by \(2^{n}\).
i.) Before shr 2 the register is:
After shr 2 the register is:
ii.) The decimal equivalent after shr 2 is \((00001100)_{2}=(12)_{10}\)
b. The binary equivalent for the decimal number 50 is 00110010
The SHL (shift left) instruction performs a logical left shift on the destination operand, filling the lowest bit with 0 so that shl 2 means it shifts 2 bits logically to the left. Shifting left \( n \) bits multiplies the operand by 2.
i.) Before shl 2 the register is:
After shl 2 the register is:
ii.) The decimal equivalent after shl 2 is (11001000)\(2=(200)10\)
Hope it's clear!!!!!
a . The binary equivalent for the decimal number

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!