Explain this Algorithm and Flowchart. Thank you   Manual Solution: Fibonacci series: if you ask the Nth term of Fibonacci series then it would be the sum of (N-1)th and (N-2)th term of Fibonacci series.   Tn= Tn-1  + Tn-2    It is fixed that 1st term of Fibonacci is 0.  2nd term is 1   3rd term is T3= T2 + T1                       T3 = 1 + 0 = 1   4th term = T4 = T3 + T2 = 1 + 1 =  2.   Fibonacci series = 0  1  1   2   3   5   8   13    21  . . .  . .  . . . . . . . . . . . . . .   Algorithm of Fibonacci Series:   Start Declare the variables n, t1,t2, nextTerm  Initialize the variables, t1=0, t2=1, and nextTerm =0 Enter the number of terms of the Fibonacci series Print First two terms of series Use loop for the following steps -> nextTerm =t1+t2 -> t1=t2 -> t2=nextTerm  -> increase the value of n each time by 1 -> print the value of nextTerm  End This is the flowchart below

Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
icon
Related questions
Question

Explain this Algorithm and Flowchart. Thank you

 

Manual Solution:

Fibonacci series: if you ask the Nth term of Fibonacci series then it would be the sum of (N-1)th and (N-2)th term of Fibonacci series.

 

Tn= Tn-1  + Tn-2

 

 It is fixed that 1st term of Fibonacci is 0.  2nd term is 1

 

3rd term is T3= T2 + T1

 

                    T3 = 1 + 0 = 1

 

4th term = T4 = T3 + T2 = 1 + 1 =  2.

 

Fibonacci series = 0  1  1   2   3   5   8   13    21  . . .  . .  . . . . . . . . . . . . . .

 

Algorithm of Fibonacci Series:

 

  • Start
  • Declare the variables n, t1,t2, nextTerm 
  • Initialize the variables, t1=0, t2=1, and nextTerm =0
  • Enter the number of terms of the Fibonacci series
  • Print First two terms of series
  • Use loop for the following steps
    -> nextTerm =t1+t2
    -> t1=t2
    -> t2=nextTerm 
    -> increase the value of n each time by 1
    -> print the value of nextTerm 
  • End

This is the flowchart below

Start
Declare variables n,t1,t2,nextTerm
Initialize tl=0.t2=2.nextTerm =0
Input the number to be printed
The fibonacci series is: tlt2
i=2
nextTerm =tl+t2
i<=n
tl=t2
t2=nextTerm , nt+
Stop
print nextTerm
Transcribed Image Text:Start Declare variables n,t1,t2,nextTerm Initialize tl=0.t2=2.nextTerm =0 Input the number to be printed The fibonacci series is: tlt2 i=2 nextTerm =tl+t2 i<=n tl=t2 t2=nextTerm , nt+ Stop print nextTerm
Expert Solution
steps

Step by step

Solved in 2 steps with 2 images

Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY