PLEASE brother don't copy from others site Write a BC assembly program that computes the power of a number: F(X) = XN Assume that X and N are both unsigned 8-bit integer numbers. Some useful hints: Modify the 8X8 multiplication code explained in the class to make it a subroutine. Then use it to multiply X by itself N times. Remember F(X) = XN = X*X*X* … *X N times Of course, your submission should also have the main program which calls the subroutine. Write enough comments to explain your code. You need to submit only the assembly file which contains the code with the comments I want the code like this question style with the use of necessary ORG 100 LOP, CLE /Clear E LDA Y / Load multiplier CIR / Transfer multiplier bit to E STA Y / Store shifted multiplier SZE / Check if bit is zero BUN ONE / Bit is one; goto ONE BUN ZRO / Bit is zero; goto ZRO ONE, LDA X / Load multiplicand ADD P / Add to partial product STA P / Store partial product CLE / Clear E ZRO, LDA X / Load multiplicand CIL / Shift left STA X / Store shifted multiplicand ISZ CTR / Increment counter BUN LOP / Counter not zero; repeat loop HLT / Counter is zero; halt CTR, DEC -8 / This location serves as a counter X, HEX OOOF / Multiplicand stored here Y, HEX 000B / Multiplier stored nere P, HEX 0 / Product formed here END
PLEASE brother don't copy from others site
- Write a BC assembly program that computes the power of a number:
F(X) = XN
Assume that X and N are both unsigned 8-bit integer numbers.
Some useful hints: Modify the 8X8 multiplication code explained in the class to make it a subroutine. Then use it to multiply X by itself N times. Remember
F(X) = XN = X*X*X* … *X N times
Of course, your submission should also have the main program which calls the subroutine. Write enough comments to explain your code. You need to submit only the assembly file which contains the code with the comments
I want the code like this question style with the use of necessary
ORG 100
LOP, CLE /Clear E
LDA Y / Load multiplier
CIR / Transfer multiplier bit to E
STA Y / Store shifted multiplier
SZE / Check if bit is zero
BUN ONE / Bit is one; goto ONE
BUN ZRO / Bit is zero; goto ZRO
ONE, LDA X / Load multiplicand
ADD P / Add to partial product
STA P / Store partial product
CLE / Clear E
ZRO, LDA X / Load multiplicand
CIL / Shift left
STA X / Store shifted multiplicand
ISZ CTR / Increment counter
BUN LOP / Counter not zero; repeat loop
HLT / Counter is zero; halt
CTR, DEC -8 / This location serves as a counter
X, HEX OOOF / Multiplicand stored here
Y, HEX 000B / Multiplier stored nere
P, HEX 0 / Product formed here
END
![](/static/compass_v2/shared-icons/check-mark.png)
Step by step
Solved in 2 steps
![Blurred answer](/static/compass_v2/solution-images/blurred-answer.jpg)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Computer Networking: A Top-Down Approach (7th Edi…](https://www.bartleby.com/isbn_cover_images/9780133594140/9780133594140_smallCoverImage.gif)
![Computer Organization and Design MIPS Edition, Fi…](https://www.bartleby.com/isbn_cover_images/9780124077263/9780124077263_smallCoverImage.gif)
![Network+ Guide to Networks (MindTap Course List)](https://www.bartleby.com/isbn_cover_images/9781337569330/9781337569330_smallCoverImage.gif)
![Concepts of Database Management](https://www.bartleby.com/isbn_cover_images/9781337093422/9781337093422_smallCoverImage.gif)
![Prelude to Programming](https://www.bartleby.com/isbn_cover_images/9780133750423/9780133750423_smallCoverImage.jpg)
![Sc Business Data Communications and Networking, T…](https://www.bartleby.com/isbn_cover_images/9781119368830/9781119368830_smallCoverImage.gif)