The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index, n, as parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.

The Fibonacci sequence begins with 0 and then 1 follows. All subsequent values are the sum of the previous two, for example: 0, 1, 1, 2, 3, 5, 8, 13. Complete the Fibonacci() function, which has an index, n, as parameter and returns the nth value in the sequence. Any negative index values should return -1. Ex: If the input is: 7 the output is: Fibonacci(7) is 13 Note: Use a for loop and DO NOT use recursion.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter5: Control Structures Ii (repetition)

Section: Chapter Questions

Problem 14PE

See similar textbooks

Similar questions

Write a function triple_riffle_repeat(mylist,n) which takes as input a list (again with length a multiple of 3) and outputs the result of doing a 3-way riffle shufffle n times Write a function period(m) which takes as input a number m (which we will always take as a multiple of 3) and outputs the smallest positive integer n so that triple_riffle_repeat(list(range(m)),n) == list(range(m)) Discuss, with evidence, the outputs of your function period for different values of m, writing your answer as a comment.
In this question, we are going to write a Racket functionwordMaxIndex that calculates the maximum index of each word thatappears in an input word list. For example, if the input is’(time is long but life is short)Then one output can be((time 0) (long 2) (but 3) (life 4) (is 5) (short 6))The index of the first word in a word list is 0; the index for the secondword is 1; etc. Therefore, in the previous example, the maximum indexfor word “time” is 0; the maximum index for word “is” is 5, since “is”appears twice, at index 1 and 5. Note that you are not asked to sortthe words in the output. Therefore, the output is correct as long asthe indexes are correct.Do the following steps to implement the word-index program. In ourdiscussion, we call a word with an index a word-index pair, for example,(short 6) and (is 5) are word-index pairs. We call a list of word-index pairs a word-index list.(a) Write a function initialWIList that takes a list ofwords and creates a word-index list. The resulting…
How can the following function be simplified so that it has a time complexity of O(n) or faster?For your information, the specifications of the functions are as follows: Using numbers ranging from 0 to 15 (inclusive), create all possible lists which sum up to K and have a length of N. Duplicated numbers are allowed as long as it fulfills the conditions above (this means [0,0,1], [0,1,0] and [1,0,0] are all correct outputs if K=1 and N=3). When instantiated with the list function, the list size of the function should be the number of all lists. For example, given K=23 and N=2, the expected list size is 8. The function must be able to accept N=10 and be finished before 9 seconds. Do not use itertools or external libraries.
d. Write a function Encode as follows:• // Return M^e mod PQ• int Encode (int M, int e, int PQ); e. Write a function Decode as follows:• //Return C^d mod PQ• int Decode (int C, int d, int PQ); f. Verify that RSA algorithm works, i.e.,• int M;• /* M is an integer that is smaller than PQ */• cout <<"Enter an integer that is smaller than"<< PQ;• cin <<M;•• C=Encode (M, e, PQ);• M1=Decode (C, d, PQ);• assert (M==M1); //Note: include assert.h header file to use this//macro/function. c++
Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
Consider an input string TAM of letters ‘A’, ‘M’, and ‘T’. This string, which is given by the user, ends with ‘#’. It should be stored in a table (or array), called TAMUK. The number of each of these letters is unknown. We have a function, called SWAP(TAM,i,j), which places the ith letter in the jth entry of string TAM and the jth letter in the ith entry of TAM. Note that SWAP(TAM,i,j) is defined for all integers i and j between 0 and length(TAM)–1, where length(TAM) is the number of letters of TAM. 1. Using our algorithmic language, write an algorithm, called Sort_TAM, which sorts the letters in the array TAMUK in a way that all T’s appear first, followed by all A’s, and followed by all M’s. The algorithm Sort_TAM should have one parameter: The array TAMUK. Also, your solution is correct only if the following four constraints are satisfied: - Constraint 1: Each letter (‘A’, ‘M’, or ‘T’) is evaluated only once. - Constraint 2: The function SWAP(TAM,i,j) is used only when it is…
The question is in bold and the rest is there for support , to explain concepts Write a function triple_riffle(mylist) which takes as input a list (which for convenience we will always take with length a multiple of 3) and outputs the result of a 3-way riffle shuffle . For example: an input of range(9) should output [6,3,0,7,4,1,8,5,2]. Write a function triple_riffle_repeat(mylist,n) which takes as input a list (again with length a multiple of 3) and outputs the result of doing a 3-way riffle shuffle n times. A Faro shuffle is when a deck of cards is split exactly in half and then the two halves are interleaved exactly. There are two versions: an out-shuffle where the card in position 1 stays where it is (and likewise the card in the last position stays there), and an in-shuffle where the card in position 1 moves to position 2 (and the card in last position moves up one). The following code prints the result of a Faro out-shuffle on the list [1,2,...,52]. deck = list(range(1,53))…
Using a pseudo random number generation function (e.g., rand() in C or other equivalentfunctions in other languages) that generates uniformly distributed random numbers,write functions that generate the following:(a) uniformly distributed integers between 0 and 99. (b) uniformly distributed floating numbers between 0.25 and 0.5. (c) the number 1 with probability 0.5, the number 2 with probability 0.2, otherwise a floatuniformly distributed between 3 and 4.
Consider the function, f(n), defined by the following code int f(int n) { int r = 0; if ( n % 2 == 0 ) return 1; // when n is even while ( n > 1 ) { n = n – 3; r++; } return r; } From the definitions of big-Theta and little-oh: Prove or disprove that f(n) is Θ ( n ) 2. Prove or disprove that f(n) is o ( n^2 ) ( note: function f(n) as defined by the code, that is, the return value, and is not asking about the runtime of the code.)
Prompt: In python, modify the function below to plot a Gaussian distribution. Code: import matplotlib.pyplot as plt import random import numpy as np from scipy.stats import norm import seaborn as sns def clipped_hist(df, clip_threshold): newData = [x for x in df if x < clip_threshold] return newData np.random.seed(30) data = [random.gauss(0, 1) for i in range(24)] data_len1 = len(data) clip_threshold = 1.0 data = clipped_hist(data, clip_threshold) data_len2 = len(data) title = "The values clipped = " + str(data_len1 - data_len2) + " The value clipping threshold = " + str(clip_threshold) plt.hist(data) plt.title(title) plt.show()