Starting Out with C++: Early Objects (9th Edition)
Starting Out with C++: Early Objects (9th Edition)
9th Edition
ISBN: 9780134400242
Author: Tony Gaddis, Judy Walters, Godfrey Muganda
Publisher: PEARSON
Question
Book Icon
Chapter 18, Problem 13PC
Program Plan Intro

Stack Based Fibonacci Function

Program Plan:

  • Define the main function.
    • Include required header files.
    • Prompt user to enter a positive integer till which fibonacci series needs to be found.
    • Print the Fibonacci series.
    • Create a fibonacci function that computes the last term of the fibonacci sequence using stack operations.
    • Push the first two terms of the Fibonacci sequence into a stack using the push () operation.
    • Push the rest of the terms from 2 till last term into the stack.
    • Pop last two elements off the stack using the stack pop() operation.
    • The sum of element t1 and t2 is calculated and pushed onto the stack.
    • Return element present at top of the stack.

Blurred answer
Students have asked these similar questions
In Go Lang 4.  Program stack.  For the following code, answer the following questions. Assume we are putting everything for our function calls on the stack. ·       Show what a stack frame/activation record for main() looks like   ·       Show what the stack frame/activation record for the 2nd call to ctTarg look like? (Yes, this means you can skip the other stack frames)   ·       We note that targ does not change value in any recursive call. Why doesn't the compiler just store targ once in one block of memory big enough to store a string?   int ctTarg(string* list, int len, string targ) {     if (len <= 0) return 0;     if (*list == targ)         return 1 + ctTarg(list + 1, len - 1, targ);     return ctTarg(list + 1, len - 1, targ); }   int main() {     string pets[] = {"cat", "dog", "mouse", "cat"};     cout << ctTarg(pets, 4, "cat") << endl; }
Write 2 recursive functions 1. to count number of even values in an array 2. to count number of even values in a simply linked list
A tail recursion is a type of recursion in which the access of the tail pointer of a linked list is recursive   a) true b)false
Knowledge Booster
Background pattern image
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education