Problem – Write a program in 8086 microprocessor to multiply two 8-bit numbers, where numbers are stored from offset 500 and store the result into offset 600.
Examples – Inputs and output are given in Hexadecimal representation.
- Load data from offset 500 to register AL (first number)
- Load data from offset 501 to register BL (second number)
- Multiply them (AX=AL*BL)
- Store the result (content of register AX) to offset 600
|400||MOV SI, 500||SI=500|
|403||MOV DI, 600||DI=600|
|406||MOV AL, [SI]||AL<-[SI]|
|409||MOV BL, [SI]||BL<-[SI]|
|40D||MOV [DI], AX||AX->[DI]|
- MOV SI, 500 set 500 to SI
- MOV DI, 600 set 600 to DI
- MOV AL, [SI] load contents of offset SI to register AL
- INC SI increase value of SI by 1
- MOV BL, [SI] load contents of offset SI to register BL
- MUL BL multiply contents of register AL and BL
- MOV [DI], AX store the result (contents of register AX) to offset DI
- HLT End.
- 8086 program to multiply two 16-bit numbers
- 8086 program to determine squares of numbers in an array of n numbers
- 8086 program to determine cubes of numbers in an array of n numbers
- 8086 program to add two 8 bit BCD numbers
- 8086 program to add two 16-bit numbers with or without carry
- 8086 program to subtract two 8 bit BCD numbers
- 8086 program to add two 16 bit BCD numbers with carry
- 8086 program to subtract two 16 bit BCD numbers
- 8085 program to multiply two 8 bit numbers
- 8085 program to multiply two 16-bit numbers
- 8086 program to subtract two 16-bit numbers with or without borrow
- 8086 program to find sum of odd numbers in a given series
- 8086 program to generate G.P. series of n numbers
- 8086 program to find GCD of two numbers and print the GCD
- 8086 program to find sum of Even numbers in a given series
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.