Scribd Logo
Upload

Welcome to Scribd!

  • 14 views

    Experiment - Vii Fibonacci Numbers

    Uploaded by

    Ajay duth
    The document describes an experiment to develop an assembly language program that finds the first n Fibonacci numbers. It presents an algorithm that initializes variables, prints the first two numbers, and then loops to calculate each subsequent number as the sum of the previous two. The source code implements this algorithm on the 8051 microcontroller by using registers, pointers, and loops to store the calculated numbers in memory locations. The output verifies that for input n=10, the first 10 Fibonacci numbers are correctly stored in memory addresses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content

    You might also like

    Experiment - Vii Fibonacci Numbers

    Uploaded by

    Ajay duth
    14 views6 pages
    The document describes an experiment to develop an assembly language program that finds the first n Fibonacci numbers. It presents an algorithm that initializes variables, prints the first two numbers, and then loops to calculate each subsequent number as the sum of the previous two. The source code implements this algorithm on the 8051 microcontroller by using registers, pointers, and loops to store the calculated numbers in memory locations. The output verifies that for input n=10, the first 10 Fibonacci numbers are correctly stored in memory addresses.

    Original Description:

    Original Title

    network

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes an experiment to develop an assembly language program that finds the first n Fibonacci numbers. It presents an algorithm that initializes variables, prints the first two numbers, and then loops to calculate each subsequent number as the sum of the previous two. The source code implements this algorithm on the 8051 microcontroller by using registers, pointers, and loops to store the calculated numbers in memory locations. The output verifies that for input n=10, the first 10 Fibonacci numbers are correctly stored in memory addresses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    14 views6 pages

    Experiment - Vii Fibonacci Numbers

    Uploaded by

    Ajay duth
    The document describes an experiment to develop an assembly language program that finds the first n Fibonacci numbers. It presents an algorithm that initializes variables, prints the first two numbers, and then loops to calculate each subsequent number as the sum of the previous two. The source code implements this algorithm on the 8051 microcontroller by using registers, pointers, and loops to store the calculated numbers in memory locations. The output verifies that for input n=10, the first 10 Fibonacci numbers are correctly stored in memory addresses.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 6

    EXPERIMENT - VII

    FIBONACCI NUMBERS

    May 3, 2020

    ADITHYA D RAJAGOPAL
    ROLL NO : 9
    DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING
    COLLEGE OF ENGINEERING TRIVANDRUM
    TVE17CS009 ADITHYA D RAJAGOPAL

    A IM
    To develop an assembly language program to find first n Fibonacci numbers.

    Page 1 of 5
    TVE17CS009 ADITHYA D RAJAGOPAL

    A LGORITHM

    Algorithm 1 First n Fibonacci numbers


    1: Start
    2: Read n.
    3: a = 0
    4: b = 0
    5: Print a,b.
    6: for i = 1 to n − 2 do
    7: c = a +b
    8: a =b
    9: b=c
    10: Print c.
    11: end for
    12: Stop

    Page 2 of 5
    TVE17CS009 ADITHYA D RAJAGOPAL

    S OURCE C ODE

    MOV DPTR,#0000H
    MOV R7,#0AH
    MOV A,#00H
    MOVX @DPTR, A
    DEC R7
    INC A
    INC DPL
    MOVX @DPTR, A
    DEC R7
    INC DPL
    MOV B,#00H
    LOOP: MOV R0 , A
    ADD A , B
    MOV B , R0
    MOVX @DPTR, A
    INC DPL
    DJNZ R7 ,LOOP
    STOP : SJMP STOP

    Page 3 of 5
    TVE17CS009 ADITHYA D RAJAGOPAL

    O UTPUT
    Here n=0AH.
    The first n Fibonacci numbers are stored from locations 0000H to 0009H.

    Page 4 of 5
    TVE17CS009 ADITHYA D RAJAGOPAL

    R ESULT
    Assembly language program for generating first n Fibonacci numbers has been developed
    and verified using MCU-8051-IDE.

    Page 5 of 5

    You might also like