How do I complete the code to get a similar output in the image? Fibonacci Sequence Coding using Memoization C PROGRAM HELP: - Create the mfib() function to calculate Fibonacci using memoization - Also create the initMemo() function to clear out memoization table(s) at the beginning of each mfib() run The output of the program will record the relative amount of time required from the start of each function calculation to the end. Note the speed difference between fib and mfib! Turn in your commented program and a screen shot of the execution run of the program. Do not be alarmed as the non-memoization Fibonacci calls take a long time to calculate, especially the higher values. Be patient. It should finish.   Given Code: #include #include #include #include #include   // max number of inputs #define MAX_FIB 200   // result of call to fib function unsigned long long result;   //loop variable int i;     // ========================== MEMO DEFINITIONS ==========================   unsigned long long memo[MAX_FIB];     // array to hold computed data values bool valid[MAX_FIB];                  // array to hold validity of data   // make all entries in the memoization table invalid void initMemo() {   // ***** ADD YOUR INITIALIZATION CODE HERE *****   // ***** ADD YOUR INITIALIZATION CODE HERE *****   // ***** ADD YOUR INITIALIZATION CODE HERE *****   // ***** ADD YOUR INITIALIZATION CODE HERE *****   // ***** ADD YOUR INITIALIZATION CODE HERE *****     return; } // ===================== TIME DEFINITIONS =============== // timer functions found in time.h // time_t is time type time_t startTime; time_t stopTime; // get current time in seconds from some magic date with // t = time(NULL); // or // time(&t); // where t is of type time_t // // get difference in secs between times (t1-t2) with // d = difftime(t1, t2); // where d is of type double // ========================== NAIVE FIB  ========= unsigned long long fib(int n) {   if (n < 1) {     return 0;   } else if (n == 1) {     return 1;   } else {     return fib(n-2) + fib(n-1);   } }     // ========================== MEMOIZED FIB  ==========================   unsigned long long mfib(int n) {     // ***** ADD YOUR MFIB CODE HERE *****   // ***** ADD YOUR MFIB CODE HERE *****   // ***** ADD YOUR MFIB CODE HERE *****   // ***** ADD YOUR MFIB CODE HERE *****   // ***** ADD YOUR MFIB CODE HERE *****     return 0; // replace this return with real computation   }   // ========================== MAIN PROGRAM  ========================== int main() {     for (i = 0; i < 55; i+=5) {       // get start time     time(&startTime);     // call fib     result = fib(i);     // get stop time     time(&stopTime);       printf("fib of %d = %llu\n", i, result);     printf("time taken (sec) = %lf\n\n", difftime(stopTime, startTime));   }     printf("\n\n\n");   for (i = 0; i < 90; i+=5) {     // get start time     time(&startTime); printf("fib of %d = %llu\n", i, result);     printf("time taken (sec) = %lf\n\n", difftime(stopTime, startTime));   }     printf("\n\n\n");     for (i = 0; i < 90; i+=5) {       // get start time     time(&startTime);     // call mfib     initMemo();     result = mfib(i);     // get stop time     time(&stopTime);       printf("mfib of %d = %llu\n", i, result);     printf("time taken (sec) = %lf\n\n", difftime(stopTime, startTime));   }     return 0; }

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question

How do I complete the code to get a similar output in the image?

Fibonacci Sequence Coding using Memoization C PROGRAM HELP:

- Create the mfib() function to calculate Fibonacci using memoization

- Also create the initMemo() function to clear out memoization table(s) at the beginning of each mfib() run

The output of the program will record the relative amount of time required from the start of each function calculation to the end.

Note the speed difference between fib and mfib!

Turn in your commented program and a screen shot of the execution run of the program.

Do not be alarmed as the non-memoization Fibonacci calls take a long time to calculate, especially the higher values.

Be patient. It should finish.

 

Given Code:

#include <stdio.h>

#include <stdlib.h>

#include <stdbool.h>

#include <string.h>

#include <time.h>

 

// max number of inputs

#define MAX_FIB 200

 

// result of call to fib function

unsigned long long result;

 

//loop variable

int i;

 

 

// ========================== MEMO DEFINITIONS ==========================

 

unsigned long long memo[MAX_FIB];     // array to hold computed data values

bool valid[MAX_FIB];                  // array to hold validity of data

 

// make all entries in the memoization table invalid

void initMemo() {

  // ***** ADD YOUR INITIALIZATION CODE HERE *****

  // ***** ADD YOUR INITIALIZATION CODE HERE *****

  // ***** ADD YOUR INITIALIZATION CODE HERE *****

  // ***** ADD YOUR INITIALIZATION CODE HERE *****

  // ***** ADD YOUR INITIALIZATION CODE HERE *****

 

  return;

}

// ===================== TIME DEFINITIONS ===============

// timer functions found in time.h

// time_t is time type

time_t startTime;

time_t stopTime;

// get current time in seconds from some magic date with

// t = time(NULL);

// or

// time(&t);

// where t is of type time_t

//

// get difference in secs between times (t1-t2) with

// d = difftime(t1, t2);

// where d is of type double

// ========================== NAIVE FIB  =========

unsigned long long fib(int n) {

  if (n < 1) {

    return 0;

  } else if (n == 1) {

    return 1;

  } else {

    return fib(n-2) + fib(n-1);

  }

}

 

 

// ========================== MEMOIZED FIB  ==========================

 

unsigned long long mfib(int n) {

 

  // ***** ADD YOUR MFIB CODE HERE *****

  // ***** ADD YOUR MFIB CODE HERE *****

  // ***** ADD YOUR MFIB CODE HERE *****

  // ***** ADD YOUR MFIB CODE HERE *****

  // ***** ADD YOUR MFIB CODE HERE *****

 

  return 0; // replace this return with real computation

 

}

 

// ========================== MAIN PROGRAM  ==========================

int main() {

 

  for (i = 0; i < 55; i+=5) {

 

    // get start time

    time(&startTime);

    // call fib

    result = fib(i);

    // get stop time

    time(&stopTime);

 

    printf("fib of %d = %llu\n", i, result);

    printf("time taken (sec) = %lf\n\n", difftime(stopTime, startTime));

  }

 

  printf("\n\n\n");

  for (i = 0; i < 90; i+=5) {

    // get start time

    time(&startTime);

printf("fib of %d = %llu\n", i, result);

    printf("time taken (sec) = %lf\n\n", difftime(stopTime, startTime));

  }

 

  printf("\n\n\n");

 

  for (i = 0; i < 90; i+=5) {

 

    // get start time

    time(&startTime);

    // call mfib

    initMemo();

    result = mfib(i);

    // get stop time

    time(&stopTime);

 

    printf("mfib of %d = %llu\n", i, result);

    printf("time taken (sec) = %lf\n\n", difftime(stopTime, startTime));

  }

 

  return 0;

}

fib of 0 = 0
time taken (sec)
0.000000
fib of 5 = 5
time taken (sec) = 0.000000
fib of 10 = 55
time taken (sec) = 0.000000
fib of 15
610
time taken (sec)
= 0.000000
fib of 20
6765
time taken (sec) = 0.000000
fib of 25
75025
time taken (sec) = 0.000000
fib of 30
time taken (sec)
832040
0.000000
fib of 35
9227465
time taken (sec)
1.000000
fib of 40
102334155
time taken (sec) = 1.000000
fib of 45 = 1134903170
time taken (sec) = 10.000000
fib of 50
12586269025
time taken (sec) =
110.000000
mfib of 201 = 17323038258947941269
time taken (sec) = 197.000000
Transcribed Image Text:fib of 0 = 0 time taken (sec) 0.000000 fib of 5 = 5 time taken (sec) = 0.000000 fib of 10 = 55 time taken (sec) = 0.000000 fib of 15 610 time taken (sec) = 0.000000 fib of 20 6765 time taken (sec) = 0.000000 fib of 25 75025 time taken (sec) = 0.000000 fib of 30 time taken (sec) 832040 0.000000 fib of 35 9227465 time taken (sec) 1.000000 fib of 40 102334155 time taken (sec) = 1.000000 fib of 45 = 1134903170 time taken (sec) = 10.000000 fib of 50 12586269025 time taken (sec) = 110.000000 mfib of 201 = 17323038258947941269 time taken (sec) = 197.000000
Expert Solution
steps

Step by step

Solved in 3 steps with 2 images

Blurred answer
Knowledge Booster
Image Element
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education