A

Micro-Project Report
On
“Generate Febonnaci Sequence”
Partial Fulfilment of the Requirement for the Diploma in Computer Engineering,

By

1) Uday fand
1) Pathan sofiyan[23612000236]
[1914660014]
2) Swaraj Kambale
2) Pawar omkar [23612000136]
[1914660021]
3) Suraj Gore
3) Attar muskan [23612000174]
[2014660017]
4) Prathamesh GiteShravani
4) Sudrik [23612000151]
[1914660016]

Guided By
Prof. Chabukswr
Prof.Varpe A.SS.R

Shree Samarth Academy’s

Shree Samarth Polytechnic
Mhasane Phata, Ahmednagar
Maharashtra State Board of Technical Education ji
20(24
0-2202-25 021)
 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
Submitted by

1) Uday Fandsofiyan [236120000236]

1) Pathan [1914660016]
2) Swaraj Kambale[23612000136]
2) Omkar pawar [1914660021]
3) Suraj Gore
3) Attar muskan [23612000174]
[2014660017]
4) Prathamesh Gite [23612000151]
4) Sudrik Shravani [2014660016]

In the partial fulfilment of Diploma in Computer Engineering has been

Satisfactory carried out under my guidance as per the requirement of Maharashtra State Board
of Technical Education, Mumbai during the academic year 2020-2021.
Date:
Place: Mhasane Phata, Parner

GUIDE HOD PRINCIPAL

(Prof. Varpe S.M)
Prof.Chabukswar S.R
(Prof.Chaure
Prof . WathoreS.M.)
S.P (Prof.Anarase B.V)
Prof. Desale C.D
 Micro-Project Proposal

1.0 Brief Introduction:

The Fibonacci sequence is one of the most famous number
sequences of them all. We’ve given you the first few numbers here, but
what’s the next one in line? It turns out that the answer is simple. Every
number in the Fibonacci sequence (starting from ) is the sum of the two
numbers preceding it:

and so on. So it’s pretty easy to figure out that the next number in the
sequence above is and (in theory at least) to work out all
numbers that follow from here to infinity.

2.0 Aim of the Micro-Project:

1. To make the most common technical analysis of Febonnacci sequence”

2. To develop pull waves to be smaller in trending direction in Fibonacci
sequence
3. To make sure the impulse waves are greater towards the trending direction
in Fibonacci sequence.
3.0 Action plan:

Sr.no. Details of activity Planned Planned Name of

start Finish Responsible
date date Team
Member
1 Topic Search Uday fand

2 Project Proposal Creation Swaraj Kambale

3 Detailed Information Gathering for All members

Project

4 Developing Project Diagrams All Members

5 Taking overview of Project All Members

6 Mistake ‘removal Uday Fand

7 Project Report Creation Suraj gore

8 Final Presentation Prathamesh Gite

4.0 Resources Required:

Sr.no. Name of Specification Qty. Remarks

resources/Material

1 Operating System Windows 2010 1 -

2 Microsoft Word 2019 1 -

3 Software Visual studio 1 -

************
 Micro-Project Report

“Generate Fibonacci sequence”

1.0 Brief 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
Fibonacci number) is equal to the sum of the preceding two numbers. If the Fibonacci
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 ...

, it is customary to use n = 1. In that case, the first two terms are defined as 1 and
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
Pisano or Fibonacci), an Italian mathematician who lived from 1170 - 1250. Fibonacci
used the arithmetic series to illustrate a problem based on a pair of breeding rabbits:

"How many pairs of rabbits will be produced in a year, beginning with a single pair, 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 important sequence is 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. This means each term

is defined by the previous terms.

and so

The Fibonacci sequence is defined

by

for all , 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
 3.0 Course Outcomes Integrated:

1. The Fibonacci sequence is a series of numbers where a number is found by adding

up the previous 2 numbers, starting with 0 + 1. ..
2. The Fibonacci sequence also relates to the Golden Ratio (PHI) which can be
described as the ratio between any two consecutive numbers in the Fibonacci sequence.

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.0 Resources Required:-

 Sr.no Name of resources Specifications Q.t.y Remarks

1 Operating system Windows 7 1 -

2 Microsoft word 2010 1 -

3 Search engine Google 1 -

4.2 Algorithm for fibonacci series:

 Start
 Initialize Data Segment

 Load DS with the data segment address.

 Store First Two Fibonacci Numbers

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

 Set Loop Counter

 Load CX with n (number of terms).

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

 Set Index Pointer (SI)

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

 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).

 End Loop when CX = 0

 Terminate Program

 Call INT 21H to exit.

 End
4.2 Flowchart:
+--------------------+
| Start |
+--------------------+
|
v
+--------------------+
| Initialize DS |
| Load Data Segment |
+--------------------+
|
v
+--------------------+
| Store F0 = 0 |
| Store F1 = 1 |
+--------------------+
|
v
+--------------------+
| Set CX = n |
| Subtract 2 (CX-2) |
+--------------------+
|
v
+--------------------+
| Set SI = 2 |
| (Index pointer) |
+--------------------+
|
v
+-----------------------------+
| Check if CX = 0? |
+-----------------------------+
| |
No Yes
| v
| +--------------------+
| | Exit the program |
| | INT 21H |
| +--------------------+
| |
| v
v
+-----------------------------+
| Load F(n-1) from fib[SI-1] |
| Load F(n-2) from fib[SI-2] |
+-----------------------------+
|
v
+-----------------------------+
| Add F(n-1) + F(n-2) |
| Store result in fib[SI] |
+-----------------------------+
|
v
+-----------------------------+
| Increment SI (SI = SI + 1) |
| Decrement CX (CX = CX - 1) |
+-----------------------------+
|
v
(Loop Back to Check CX)

5.0 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
  Teacher Evaluation Sheet
Name of Student: …………………………………………………………….

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

Name of

Programmers:………………………………………………………….

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

Course Title: ………………….

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

Title of the Micro-Project: …………………………………….

Course Outcomes Achieved:

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

Sr. Evaluationto
Characteristic asbe
per suggested
PoorRubric forAverage
Assessment of Micro-Project
Good Excellent
No. assessed (Marks 1- (Marks 4-5) (Marks 6-8) (Marks 9-
3) 10)
1 Relevance to the course
2 Literature survey/
Information Collection

3 Project Proposal
4 Completion of the
Target as per project
proposal
5 Analysis of Data &
Representation
6 Quality of
Prototype/Model
7 Report Preparation
 8 Presentation
9 Defense

Micro-Project Evaluation Sheet

Process Assessment Product Assessment Total

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

Note:

Every course teacher is expected to assign marks for group evolution in first 3 columns

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

Comments/suggestions about team work/leadership/inter-personal communication

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

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

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

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

Any Other Comment:

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

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

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

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

Name and designation of the faculty member

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

Signature…………………………………………………………………………………