**Problem –** Write a program in 8086 microprocessor to generate G.P (geometric progression) series of n numbers (numbers will be of 8-bit only), where size “n” is stored at offset 500 and the first number(a) is stored at offset 501 and store the common ratio is stored at offset 502 .Store the series into offset 600.

**Example –**

**Algorithm –**

- Store 500 to SI and 600 to DI Load data from offset 500 to register CL and set register CH to 00 (for count).
- Increase the value of SI by 1.
- Load first number(value) from next offset (i.e 501) to register AL.
- Store the value of register AL to memory offset DI.
- Increase DI by 1.
- Decrease the CL by 1.
- Load second number(common ratio) from next offset (i.e 502) to register BL.
- Multiply register AL and BL.
- Store the result (value of register AL ) to memory offset DI.
- Increase the value of SI by 1.
- Loop above 3 till register CX gets 0.

**Program –**

MEMORY ADDRESS | MNEMONICS | COMMENT |
---|---|---|

400 | MOV SI, 500 | SI<-500 |

403 | MOV CL, [SI] | CL<-[SI] |

405 | MOV CH, 00 | CH<-00 |

407 | INC SI | SI<-SI+1 |

408 | MOV AL, [SI] | AL<-[SI] |

40A | INC SI | SI<-SI+1 |

40B | MOV DI, 600 | DI<-600 |

40E | MOV [DI], AL | [DI]<-AL |

410 | INC DI | DI<-DI+1 |

411 | DEC CL | CL<-CL-1 |

412 | MOV BL, [SI] | BL<-[SI] |

414 | MUL BL | AX<-AL*BL |

416 | MOV [DI], AL | [DI]<-AL |

418 | INC DI | DI<-DI+1 |

419 | LOOP 414 | JUMP TO 414 IF CX!=0 and CX=CX-1 |

41B | HLT | end |

**Explanation –**

**MOV SI, 500:**set the value of SI to 500.**MOV CL, [SI]:**load data from offset SI to register CL.**MOV CH, 00:**set value of register CH to 00.**INC SI:**increase value of SI by 1.**MOV AL, [SI]:**load value from offset SI to register AL.**INC SI:**increase value of SI by 1.**MOV DI, 500:**set the value of DI to 600.**MOV [DI], AL:**store value of register AL at offset DI.**INC DI:**increase value of DI by 1.**DEC CL:**decrease value of register CL by 1.**MOV BL, [SI]:**load value from offset SI to register BL.**MUL BL:**multiply value of register AL by BL.**MOV [DI], AL:**store value of register AL at offset DI.**INC DI:**increase value of DI by 1.**LOOP 414:**jump to address 414 if CX not 0 and CX=CX-1.**HLT:**stop

Attention reader! Don’t stop learning now. Get hold of all the important CS Theory concepts for SDE interviews with the CS Theory Course at a student-friendly price and become industry ready.

## Recommended Posts:

- 8086 program to generate AP series of n numbers
- 8086 program to find sum of odd numbers in a given series
- 8086 program to find sum of Even numbers in a given series
- 8086 program to generate Fibonacci Sequence
- 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 subtract two 16-bit numbers with or without borrow
- 8086 program to add two 16-bit numbers with or without carry
- 8086 program to multiply two 16-bit numbers
- 8086 program to determine largest number in an array of n numbers
- 8086 program to add two 8 bit BCD numbers
- 8086 program to add two 16 bit BCD numbers with carry
- 8086 program to find average of n numbers
- 8086 program to multiply two 8 bit numbers
- 8086 program to subtract two 8 bit BCD numbers
- 8086 program to subtract two 16 bit BCD numbers
- 8086 program to find GCD of two numbers and print the GCD
- 8085 program to generate Fibonacci series
- 8086 program to sort an integer array in ascending order
- 8086 program to divide a 16 bit number by an 8 bit number

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. 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.