A

Micro-ProjectReport
On
“Generate Fibonnaci Sequence”
Partial Fulfilment of the Requirement forth Diploma in ComputerEngineering,

By

1) Udayfand1)Pathansofiyan [23612000236]
[1914660014]
2)Swaraj Kambale
2)Pawaromkar [23612000136]
[1914660021]
3)SurajGore3)Attarmuskan [24612000174]
[2014660017]
4)SudrikShravani [1914660016]

GuidedBy
Prof. Chabukswar S.K
Prof.VarpeA.S

Shree Samarth Academy’s

Shree Samarth Polytechnic
Mhasane Phata ,Ahmednagar
Maharashtra State Board of Technical Education
2024-2025
 Shree Samarth Academy’s Shree
Samarth Polytechnic
Department of Computer Engineering

CERTIFICATE
This is to certify that the project work entitled

“Generate Febonnacci sequence”

Is
Submittedby

1) Uday Fand
1)Pathansofiyan [23612000236]
[1914660016]
2) Swaraj Kambale [23612000136]
2)Omkarpawar [1914660021]
3) Suraj Gore
3)Attarmuskan [24612000174]
[2014660017]
4)SudrikShravani [2014660016]

In the partial fulfillment of Diploma in Computer Engineeringhas been

Satisfactory carried out under myguidance as per the requirement ofMaharashtra State Board of
Technical Education, Mumbai during the academic year 2024-2025.
Date:
Place:MhasanePhata,Parner

GUIDE HOD PRINCIPAL

(Prof.VarpeS.M)
Prof.ChabukswarS.R
(Prof.ChaureS.M.)
Prof.WathoreS.P (Prof.AnaraseB.V)
Prof.DesaleC.D
 Micro-Project Report

“Generate Fibonacci sequence”

1.0Brief Description:

The Fibonacci sequence is a set of numbers that starts with a one or a zero,
followed by a one, and proceeds based on the rule that each number (called a
Fibonaccinumber)isequaltothesumoftheprecedingtwonumbers.IftheFibonacci
sequence is denoted F (n), where n is the first term in the sequence, the following
equation obtains for n = 0, where the first two terms are defined as 0 and 1 by
convention:

F(0)=0,1, 1,2,3,5,8, 13,21, 34...

,itiscustomarytouse n=1.Inthatcase,thefirsttwotermsaredefinedas1and 1 by
default, and therefore:

F(1)= 1,1,2,3,5, 8,13,21, 34...

The Fibonacci sequence is named for Leonardo Pisano (also known as Leonardo
PisanoorFibonacci),anItalianmathematicianwholivedfrom1170-1250.Fibonacci used
the arithmetic series to illustrate a problem based on a pair of breeding rabbits:

"Howmanypairsofrabbitswillbeproducedinayear,beginningwithasinglepair,if in every
month each pair bears a new pair which becomes productive from the second month
on?" The result can be expressed numerically as: 1, 1, 2, 3, 5, 8, 13,
21,34.
A famous and importants equenceis the Fibonacci sequence , named after the Italian
mathematician known as Leonardo Pisano, whose nickname was Fibonacci, and who lived
from 1170 to 1230. This sequence is:

{1,1,2,3,5,8,13,21,34,55,………}(10.4.1)(10.4.1){1,1,2,3,5,8,13,21,34,55,
………}

This sequence is defined recursively. Thismeanseachterm is

defined by the previous terms.

And so

The Fibonacci sequenceis defined

The Fibonacci sequenceis defined

by

forall ,when

and .
Program :-

.MODEL SMALL ; Define memory model

.STACK 100H ; Define stack size
.DATA ; Data segment starts here

n DB 10 ; Number of Fibonacci terms

fib DB 20 DUP(?) ; Reserve space for Fibonacci numbers

.CODE ; Code segment starts here

MAIN PROC
MOV AX, @DATA ; Load address of data segment into AX
MOV DS, AX ; Initialize DS (Data Segment)

; Initialize first two Fibonacci numbers

MOV AL, 00H ; First Fibonacci number F0 = 0

MOV [fib], AL ; Store in memory

MOV AL, 01H ; Second Fibonacci number F1 = 1

MOV [fib+1], AL ; Store in memory

MOV CX, n ; Loop counter = n

SUB CX, 2 ; We already stored first two numbers
MOV SI, 2 ; SI points to the next index in fib[]

FIB_LOOP:
MOV AL, [fib + SI - 1] ; Load F(n-1)
ADD AL, [fib + SI - 2] ; Add F(n-2) to AL
MOV [fib + SI], AL ; Store F(n) in memory

INC SI ; Move to next index

LOOP FIB_LOOP ; Repeat until CX becomes 0

; Terminate program
MOV AH, 4CH ; DOS exit call
INT 21H

MAIN ENDP
END MAIN
4.0 Explanation of each Segment:

1. Data Segment (.DATA)

 n DB 10 → Defines the number of Fibonacci terms.

 fib DB 20 DUP(?) → Reserves space for Fibonacci numbers.

2. Code Segment (.CODE)

 MOV AX, @DATA → Loads data segment into AX.

 MOV DS, AX → Moves it to the DS register.

3. Initialization of First Two Numbers

 MOV AL, 00H → Sets first Fibonacci number to 0.

 MOV [fib], AL → Stores it in memory.
 MOV AL, 01H → Sets second Fibonacci number to 1.
 MOV [fib+1], AL → Stores it in memory.

4. Loop for Generating Fibonacci Series

 MOV CX, n → CX is the loop counter.

 SUB CX, 2 → Since F0 and F1 are already stored.
 MOV SI, 2 → SI is the index for the next Fibonacci number.
 MOV AL, [fib + SI - 1] → Loads the previous Fibonacci number.
 ADD AL, [fib + SI - 2] → Adds the second previous number.
 MOV [fib + SI], AL → Stores the result in memory.
 INC SI → Moves to the next index.
 LOOP FIB_LOOP → Continues until CX becomes 0.

5. Exit the Program

 MOV AH, 4CH → DOS function to exit.

 INT 21H → Calls interrupt 21H to terminate.
4.2Algorithm for fibonacci series:

Step1:- Start
Step 2:-Initialize Data Segment

 Load DS with the data segment address.

Step3:-Store First Two Fibonacci Numbers

 Store F0 = 0 at fib[0].
 Store F1 = 1 at fib[1].

Step4:-Set Loop Counter

 Load CX with n (number of terms).

 Subtract 2 (CX = CX - 2), since the first two terms are already stored.

Step5:-Set Index Pointer (SI)

 Initialize SI = 2 (points to next position in fib[]).

Step6:-Loop for Generating Fibonacci Numbers

Repeat until CX = 0:

 Load F(n-1) from fib[SI - 1] into AL.

 Add F(n-2) from fib[SI - 2] to AL.
 Store the result (F(n)) at fib[SI].
 Increment SI (move to the next index).
 Decrease CX (reduce loop counter).

Step8:-End Loop when CX = 0

Step9:-Terminate Program

 Call INT 21H to exit.

Step10:-End
4.2 Flowchart:

Start
|
v

Input N (terms)
|
v

Initialize: a = 0, b = 1
Print a, b
|
v

Count = 2
|
v

Is Count < N?

| |
V v
Yes No
| |
v v

c=a+b
Print c a = b, b = c
Count = Count + 1

End
Output:-
Reference:

- https://www.geeksforgeeks.org/8086-program-generate-fibonacci-
series/

- https://www.youtube./8086-program-generate-fibonacci-series/

- https://chatgpt.com/c/67c562a4-84cc-8013-a0bf-aaa6c47b97e7
 TeacherEvaluationSheet

Name of

Student:…………………………………………………………….

Enrollment No:…………………………

Name of

Programmers:……………………………………………………

……. Semester:……………………………….

CourseTitle: ………………….

Code:…………………………………………………….

Title of the Micro-

Project:……………………………………. Course

Outcomes Achieved:

…………………………………………………………………………………………………
…………………………………………………………………………………………………
…………………………………………………………………………………………………
…………………………………………………………………………………………………
…………………………………………………………………………………………………
…………………………………………………………………………………………………
 Micro-ProjectEvaluationSheet

ProcessAssessment ProductAssessment Total

Part A- Project PartB-Project Individual Marks
Project Methodology Report/Working Presentation/Viva 10
Proposal (2 mark) Model (4 mark)
(2 marks) (2 marks)

Note:

Every courset each erisex pected to assignmarks for groupe volution in first 3columns

& individual evaluation in 4th columns for each group of students as per rubrics.

Comments/suggestion sabout team work/leadership/inter-personal communication

………………………………………………………………………………………………………………………

………………………………………………………………………………………………………………………

………………………………………………………………………………………………………………………

………………………………………………………………………………………………………………………

AnyOtherComment:

………………………………………………………………………………………………………………………

………………………………………………………………………………………………………………………

………………………………………………………………………………………………………………………

………………………………………………………………………………………………………………………

Name and designation of the faculty member

……………………………………………………………………

Signature…………………………………………………………………………………
THANK YOU