Question

Multiplication can be thought of as repeated addition. Three times four is 4 added to itself 3 times. 1) Create an assembly p

Can someone carefully explain and answer questions 1, 2, 3, 4 and 5 in detail, please!!!

0 0
Add a comment Improve this question Transcribed image text
Answer #1

I have implemented multiplication of two 8 bit numbers in 8051 keil_software using an algorithm involves shifting operations....

1 ORG 0000H 2 MOV B, #08H 3 MOV A, #03H 4 MOV R2 , #08H 5 MOV DPTR, #0000H 6 LOOP2:RRC A 7 MOV R3,A 8 JNC LoOP 9 MOV A, DPH 1

Results : Resulted 16 bit number stored in DPTR register.

Cx00 Cbx08 Cx07 sp Cx07 sp_max dptr Cx0018 PC S 124 states 0.00006 sec 困psw CxD0

we can implement division by division,multiplication by repeated subtraction, addition respectively .(8085 software)

8 BIT DIVISION # ORG 2000H # BEGIN 2000H LHLD 2501 LDA 2503 MOV B,A MVI C,08 LOOP: DAD H MOV A,H SUB B C AHEAD MOV H,A INR L

8 BIT MULTIPLICATION: PRODUCT 16-BIT # ORG 2000H # BEGIN 2000H LHLD 2501 XCHG LDA 2503 LXI H,0000 MVI C,08 LOOP: DAD H RAL JN

Add a comment
Know the answer?
Add Answer to:
Can someone carefully explain and answer questions 1, 2, 3, 4 and 5 in detail, please!!!...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

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
  • Can someone carefully explain and answer questions 1, 2, 3, 4 and 5 in detail, please!!! Multiplication can be thought...

    Can someone carefully explain and answer questions 1, 2, 3, 4 and 5 in detail, please!!! Multiplication can be thought of as repeated addition. Three times four is 4 added to itself 3 times. 1) Create an assembly program that multiplies two 8 bit integers (2's complement) together in your PIC, using the repeated summation technique 2) Add a feature to your program that detects if the answer is too big to hold in 8 bit 2's complement notation 3)...

  • question 1 part 2 and 3 thank you (47) Naruto Notone C Sign In er Sign...

    question 1 part 2 and 3 thank you (47) Naruto Notone C Sign In er Sign Up | Ch ® UFC & MMA × Secure I https://piazza-resourcess3.amazonaws.com/jgopch0cb93d8/j .pdfAWSAccessKeyld-AKAILDNRL/4ALKBWOHA8lexpires-15200435/2&Signature-ol9aXG9 /UAKIHS0QUwMeyBX.. ☆ ミ quations must be properly tyne-set including superscript-s expunents, Always watch the course websile for updates on the assignments. Question 1 (4 points) Show you work I. Convert 2727 into a 32-bit two's complement binary number 2. Convert -5795 into a 16-bit two's complement binary number 3. Add the above...

  • Multiplication and Division using PIC16F PIC16 is a very basic microcontroller with the capability of limited...

    Multiplication and Division using PIC16F PIC16 is a very basic microcontroller with the capability of limited arithmetic and logical operations. It has dedicated arithmetic instructions for addition, subtraction, increment and decrement. If we want to perform a multiplication and division operations then we need to write a program for it. Multiplication is nothing but repeated addition. However, division can be implemented using repeated subtraction. This mini-project presents assembly or C language program for the multiplication and division of two 8-bits...

  • Please, implement these subroutine. Write assembly language subroutines to perform the calculations listed hereunder: Table 1:...

    Please, implement these subroutine. Write assembly language subroutines to perform the calculations listed hereunder: Table 1: List of required subroutines. z= ABS (1) umber z=MAX(x, y) Get absolute value of a x: 16-bit signed z: 16-bit unsigned signed number. integer integer for the Assume signed number are absolute value of x represented in 2's i.e. X complement format. Given the elements x and x, y: 16-bit z: 16-bit unsigned y. Return the element with unsigned integers. integer storing the greater...

  • 5. Perform the division of unsigned integer numbers using the nonrestoring di- osoo vision algorithm. Indicate...

    5. Perform the division of unsigned integer numbers using the nonrestoring di- osoo vision algorithm. Indicate all the steps clearly. Dividend 0001100000 and Divisor = 01011 Algorithm: Step 1: Do n times (n-bit divisor) . If s 0, shift PR left one bit position and subtract divisor from LH of PR If s = 1, shift PR left one bit position and add divisor from LH of PR If s 0, set Q0) 1 If s 1, set Q(00 Step...

  • Please answer all the questions! Thank you. For the following C statement, what would be the corresponding MIPS assembly...

    Please answer all the questions! Thank you. For the following C statement, what would be the corresponding MIPS assembly code? Assume that the variables a, b, c, and d are given and were declared as 32-bit integers a - b - (c + 7)+ d; 1. 2. Show how the value 0xB47CA034 would be arranged in a little-endian and big-endian machine Assume the data is being stored starting with address 0 3. Convert the following base-16 numbers to base-2 a....

  • In Assembly Language Please display results and write assembler code in (gcd.s) The Euclidean algorithm is...

    In Assembly Language Please display results and write assembler code in (gcd.s) The Euclidean algorithm is a way to find the greatest common divisor of two positive integers, a and b. First let me show the computations for a=210 and b=45. Divide 210 by 45, and get the result 4 with remainder 30, so 210=4·45+30. Divide 45 by 30, and get the result 1 with remainder 15, so 45=1·30+15. Divide 30 by 15, and get the result 2 with remainder...

  • If someone can help with 3 3) To multiply 2 n bit binary numbers the straightforward way takes (r) time because each digit of each number multiplies each digit of the other number. (The aditions f...

    If someone can help with 3 3) To multiply 2 n bit binary numbers the straightforward way takes (r) time because each digit of each number multiplies each digit of the other number. (The aditions from carying are lower order terms.) Consider the following divide- and-conquer algorithm, which assumes, for simplicity, that n is a power of 2: Split each number into 2 collections of bits, the high order bits and the low order bits. For convenience, call the two...

  • Can someone please help me with these questions? There is one example given. The solution should...

    Can someone please help me with these questions? There is one example given. The solution should be like that. Necessary lines of codes which can run in dr.Racket. thank you!! Here is an example of using the llisting package to display code. Check the preamble to see where this is imported and set up. After that you will see a sample interaction from the DrRacket console to show how this function could be tested. You should provide similar listings and...

  • 1 to 15 blanks thank you! (1 point) For registers, Integers are encoded in one of...

    1 to 15 blanks thank you! (1 point) For registers, Integers are encoded in one of two basic types 1. and 2. (1 point) The number 201 as a one byte unsigned integer is represented as in binary and in hexadecimal. (1 point) The 2 methods for representing signed integers are 3. and (5 points) What is the 16 bit representation of -125 in 2's complement notation? 4. (5 points) What is the decimal representation of the signed integer 10000001?...

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