The Tribonacci sequence is a sequence of numbers where each term from thefourth term on is a sum of the previous three terms. Different versions ofthe sequence can be computed by changing the first three terms (known asthe seed terms).Compose a function that uses dynamic programming to return the nth valueof the Tribonacci sequence with seed values x, y and z. Seed values shouldbe provided as input parameters.All array indexing must be done using pointer arithmetic.Example (where seed values are x=0, y=1, z=1):n = 048.9.102413244481149

Create a function to find the nth value of the tribonacci series – Take a variable to store the nth…

Answered: The Tribonacci sequence is a sequence…

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter12: Points, Classes, Virtual Functions And Abstract Classes

Section: Chapter Questions

Problem 29SA

See similar textbooks

Similar questions

You are given two integer arrays nums1 and nums2, sorted in non-decreasing order, and two integers m and n, representing the number of elements in nums1 and nums2 respectively. Merge nums1 and nums2 into a single array sorted in non-decreasing order. The final sorted array should not be returned by the function, but instead be stored inside the array nums1. To accommodate this, nums1 has a length of m + n, where the first m elements denote the elements that should be merged, and the last n elements are set to 0 and should be ignored. nums2 has a length of n. Solution should avoid Runtime Error
Write a function: diceSim(D1,D2,trials) that takes as input the number of sides on die 1 (D1) and die2 (D2) and the number of trials. Your function should repeatedly sum pairs of random numbers between 1 and D1 and 1 and D2 and keep track of how many times each sum occurs. The function returns a numpy array with the fraction each sum of rolls occured. Since the numbers are chosen at random, the fractions will differ some from run to run. One run of the function print(p22.diceSim(6,6,10000)) resulted in: [0. 0. 0.0259 0.0615 0.0791 0.1086 0.139 0.1633 0.1385 0.114 0.0833 0.0587 0.0281]
Write a program that uses two identical arrays of eight randomly ordered integers. Itshould display the contents of the first array, then call a function to sort it using anascending order bubble sort, modified to print out the array contents after each pass ofthe sort . Next the program should display the contents of the second array, then call afunction to sort it using an ascending order selection sort, modified to print out thearray contents after each pass of the sort.
Write a function for given main functionint * return_an_array(int n)which takes an integer n and returns a pointer to an array (allocated off of the heap inthe function) containing the digits of n in the appropriate positions. If n = 0 return 0(which is the “null” pointer). Recall an array name is just a pointer to the first element ofthe array. Please use following main to test your function.int main() {int *a = return_an_array(23542); // array of size 5for(int i=0;i<5;i++)cout<<a[i]<<" "; // print 2 3 5 4 2cout<<endl;delete [] a;int *b = return_an_array(12345678); // array of size 8for(int i=0;i<8;i++)cout<<b[i]<<" "; // print 1 2 3 4 5 6 7 8cout<<endl;delete [] b;return 0;}
An array with any number of elements is said to be repeating if any two or more of the elements are appearing in sequential an indexes after each other.Write a C++ function that accepts an integer array and returns 1 or “Repeating” if it is a repeating array, otherwise it returns 0 or “Not Repeating”. For Instance:2, 3, 5, 6, 7, 7, 7, 6, 8, 10 - Repeating2, 3, 4, 6, 4, 6, 4, 7, 8, 9 - Not repeating
(This if for mindtap on cengage, if not possible, use devc++ 5.11 but mindtap is more accurate) Write a C++ function, smallestIndex, that takes as parameters an int array and its size and returns the index of the first occurrence of the smallest element in the array. To test your function, write a main that prompts a user for a list of 15 integers and outputs the index and value of the first occurrence of the smallest value. An example of the program is shown below: (look at picture) You can use the following integer lists to test your code: 56, 34, 67, 54, 56, 87, 66, 92, 15, 32, 55, 54, 88, 92, 30 79, 26, 97, 87, 73, 44, 67, 46, 55, 13, 20, 20, 33, 42, 60 63, 1, 40, 81, 30, 11, 26, 44, 98, 1, 80, 98, 15, 3, 42
Write a maxConsecutiveDiff function which returns the maximum difference between any two consecutive values in the array.Consecutive values are next to each other in an array (+/- 1 index)This function should accept all required data as parameters.ExamplesIf the array is 17 15 16 11 14 the maximum consecutive difference is 5 which is the difference between 16 and 11.If the array is 10 13 11 12 19 the maximum consecutive difference is 7 which is the difference between 12 and 19.
Write a function that determines the index of the second to the last occurrence of a target b in an integer array a. Return -1 if b is not in a or there is only 1 occurrence of b in a.
Suppoce we're given numpy arrays of names and scores, where each row in the scores array lists the midterm and final scores for that respective student. For example, Carol has a 75 on the midterm and 99 on the final. names = np. array([ "Alice" "Bob". "Carol","Derek ","Erin"]) Scores = np.array([ [95, 98], [82, 88], [75, 99], [80, 90], 85, 82 ]]) Write function avgMidtermNoC that takes ve parameters names and score arrays, and returns the average score on the midterm, exduding anyone who's name starta with C.
Write a function that will merge the contents of two sorted (ascending order) arrays of type integer values, storing the result in an array output parameter (still in ascending order). The function should not assume that both its input parameter arrays are the same length but can assume that one array does not contain two copies of the same value. The result array should also contain no duplicate values.The function should receive input arrays as input arguments and output array as an output argument along with any other required arguments.Maintain two position pointers (simple integers) for the 2 input arrays. Compare elements of both arrays and increment appropriate pointer
Write a function to find the maximum sum of a subarray within a given array of integers. The subarray should be contiguous, meaning the elements are adjacent to each other in the array. For example, given the array [-2, 1, -3, 4, -1, 2, 1, -5, 4], the maximum sum of a subarray is 6, which corresponds to the subarray [4, -1, 2, 1]. Write a function named maxSubarraySum that takes an array of integers as input and returns the maximum sum of a subarray. Note: If all the elements in the array are negative, the function should return 0. Example: Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4] Output: 6 Input: [-1, -2, -3, -4] Output: 0 Write the maxSubarraySum function that solves this problem efficiently.
In C++: 1) Write a printRange function which prints all values of an unsorted array (smallest to largest) between A and B inclusive. This function should accept all required data as parameters.ExamplesIf the array is 25 8 13 5 27 6 72 48, A is 20 and B is 40, this function prints 25 27.If the array is 10 1 28 42 18 34 100 125, A is 8 and B is 32, this function prints 10 1 28 18.

SEE MORE QUESTIONS

Recommended textbooks for you

C++ Programming: From Problem Analysis to Program…

Computer Science

ISBN:

9781337102087

Author:

D. S. Malik

Publisher:

Cengage Learning