0
In order to perform the fibonacci series, that is 1,1,2,3,5,8,13 .....
We initalize SI to 2000 and CX to 0, then we initilaize AX and BX registers. Then we increment SI Register by 1 and we move the contents of AL into SI register. Then we decrement cs by one and move the contents of BL o that of si and decrement CS. Then we add al and the bl registers.
Move al with contents of si +01 and move si with BL, then we increment si by one and repeat until cx=0 and we halt the program
CODE:
MOV SI,2000
MOV CX,0000
MOV CL,[SI]
MOV AX,0000
MOV BX,00
INC SI
MOV [SI], AL
DEC CX
INC SI
MOV [SI],BL
DEC CX
AGAIN ADD AL,BL
MOV [SI+01],AL
MOV BL,[SI]
INC SI
LOOP AGAIN
INT A5
----
code ends
What else can I help you with?
Write a c program Fibonacci series using for loop in java?
Exactly what do you mean by 'C program in Java'
Program to generate Fibonacci series using storage class in c plus plus?
i dn't know. haha
Program to count the number of numbers in an array using 8085 microprocessor?
A program which is used to count the number of numbers in an array using a 8085 microprocessor is known as a assembly language program.
Write a c program to generate Fibonacci series using copy constructor?
#include #include void main(void) { int i,j,k,n; clrscr(); i=0; j=1; printf("%d %d ",i,j); for(n=0;n<=5;n++) { k=i+j; i=j; j=k; printf("%d ",k); } getch(); }
Fibonacci series using for loop in HTML?
HTML has no notion of a loop. This cannot be done.
What is subroutine in 8085?
in 8085 microprocessor a subroutine is a separate program written aside from main program ,this program is basically the program which requires to be executed several times in the main program. the microprocessor can call subroutine any time using CALL instruction . after the subroutine is executed the subbroutine hands over the program to main program using RET instruction.
8086 assembly program to sort a list of integers?
assembly language program for sorting an array using 8086 microprocessor.
What is the first no in Fibonacci series to have 1000 digits?
1.34472 x 1099 (rounded to 6 sig. figures) You can figure this out using simple formulas in a spreadsheet program such as Excel. 1070066266382758936764980584457396885083683896632151665013235203375314520604694040621889147582489792657804694888177591957484336466672569959512996030461262748092482186144069433051234774442750273781753087579391666192149259186759553966422837148943113074699503439547001985432609723067290192870526447243726117715821825548491120525013201478612965931381792235559657452039506137551467837543229119602129934048260706175397706847068202895486902666185435124521900369480641357447470911707619766945691070098024393439617474103736912503231365532164773697023167755051595173518460579954919410967778373229665796581646513903488154256310184224190259846088000110186255550245493937113651657039447629584714548523425950428582425306083544435428212611008992863795048006894330309773217834864543113205765659868456288616808718693835297350643986297640660000723562917905207051164077614812491885830945940566688339109350944456576357666151619317753792891661581327159616877487983821820492520348473874384736771934512787029218636250627816
Write a program using while loop that generates Fabonaci series up to 200?
//to generate Fibonacci series upto a range of 200....(in C).... #include<stdio.h> main() { int a,b,c,i; a=0; b=1; printf("\n FIBONACCI SERIES .....\t"); i=1; while(i<=(200-2)) { c=a+b; printf("\t%d",c); a=b; b=c; i++; } }
Assembly language program for string concatenation using 8086 microprocessor?
write program to concatenating two sting in 8086 assembly language
Fibbomacci series using recursion shell programming?
Here is a good answer for recursion Fibonacci series. #include <stdio.h> #include <conio.h> long Fibonacci(long n); int main() { long r, n,i; printf("Enter the value of n: "); scanf("%ld",&n); for(i=0;i<=n;i++) { printf(" Fibonacci(%ld)= %ld\n", i,Fibonacci(i)); } getch(); return 0; } long Fibonacci(long n) { if(n==0 n==1) return n; else { return (Fibonacci(n-1)+Fibonacci(n-2)); } } for n=5; Output: Fibonacci(0)=0 Fibonacci(1)=1 Fibonacci(2)=1 Fibonacci(3)=2 Fibonacci(4)=3 Fibonacci(5)=5
How do you write Ascending order program using 8086 microprocessor?
One many find this answer on YouTube. One also may find out how to write ascending order programs using an 8086 microprocessor by looking at the owners manual.
