Write a function called max_sum that takes v, a rowvector of numbers, and n, a positive integer as inputs. T isthe largest possible. In other words, if v is [1 2 3 45 43 21] and n is 3, it will find 4 5 and 4 because their suchsequences exist in v, max_sum returns the first one. Thefunction returns summa, the sum as the first consecutiveones as the second output. If the input n is larger than thenumber of elements of v, the function runs:[summa, index] = max_sum([1 2 3 4 5 4 3 2 1],3)%3Dsumma =13index = 4[summa, index] = max_sum([1 2 3 4 5 4 3 2 1],2)summa = 9index = 4[summa, index] = max_sum([1 2 345 4 3 2 1],1)summa5index = 5%3D[summa, index] = max_sum([1 2 3 4 5 4 3 2 1],9)summa = 25index = 1[summa, index] = max_sum([1 2 3 4 5 4 3 2 1],10)summa =index = -1

Write a function called max_sum that takes v, a ro vector of numbers, and n, a positive integer as inp the largest possible. In other words, if v is [1 2 3 4 5 1] and n is 3, it will find 4 5 and 4 because their suc sequences exist in v, max_sum returns the first one

Write a function called max_sum that takes v, a ro vector of numbers, and n, a positive integer as inp the largest possible. In other words, if v is [1 2 3 4 5 1] and n is 3, it will find 4 5 and 4 because their suc sequences exist in v, max_sum returns the first one

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...

See similar textbooks

Similar questions

A function negativeSort takes an integer array A and an integer n (size of A) as inputs. It replaces every positive value in A by its negative value and then performs selection sort in descending order. Ex. A = (1, -4, 2, -3, -5} will result in {-1,-2,-3,-4,-5}. a. Write the function in pseudocode. You need to define all the variables used in the function. b. Write the function in C++ code. You need to define all the variables used in the function.
Create a program which will ask the user to enter a list of names and provide a poker tournament order. It should do the following: Ask the user how many people are playing Ask the user to enter each name Print out a sorted list of names Print out a randomized list of names to determine who sits where To store the players, use a vector of strings, e.g. vector<string> players. Use the builtin sort and random shuffle algorithms. Use range-based for loops to print out your lists.
Develop a function that finds the starting index of the longest subsequence of values that is strictly increasing. For example, given the array {12, 3, 7, 5, 9, 8, 1, 4, 6}, the function would return 6, since the subsequence {1, 4, 6} is the longest that is strictly increasing. Develop a function that takes a string and a single character, then returns a list of the indexes in the string where the character occurs. For example, given the string “bookkeeper” and ‘e’, the function would return {5, 6, 8} since ‘e’ occurs at those positions. Return an empty list if the character does not appear in the string even once. Develop a function that takes two lists of integers and returns a list containing any value that appears in both parameter lists.
Write a function maxSpan(vector) measures the span between the smallest and largest integers in an array. For instance, if the smallest was 3 and the largest was 5, then the span would be 3 (that is the numbers 3,4,5). You cannot use a loop; you must use the algorithms from the STL. #include <vector>#include <algorithm>using namespace std; int maxSpan(const vector<int>& v){ .......... }
Define a function named GetWordFrequency that takes a vector of strings and a search word as parameters. Function GetWordFrequency() then returns the number of occurrences of the search word in the vector parameter (case insensitive). Then, write a main program that reads a list of words into a vector, calls function GetWordFrequency() repeatedly, and outputs the words in the vector with their frequencies. The input begins with an integer indicating the number of words that follow. Ex: If the input is: 5 hey Hi Mark hi mark the output is: hey 1 Hi 2 Mark 2 hi 2 mark 2 Hint: Use tolower() to set the first letter of each word to lowercase before comparing. The program must define and use the following function:int GetWordFrequency(vector<string> wordsList, string currWord)
Given the following piecewise function, f(x): -5 if x 5 Create a function M-file, PieceZig, that accepts one number as input, evaluates the piecewise function at that number & returns this as output. Do not allow the user to enter an array of x values. Examples: PieceZig(10) ans = 5 PieceZig(2) ans = 2
vector, or a matrix in the same way as described for rand function. EXERCISE I8 Generate a random integer between I and 10. Ask user to guess the number. If user's guess is incorrect, ask' to guess again until user gets it right. At this point, tell user that he guessed it correctly and print out the number of attempts it took for the correct guess. Output Samples >> exercisel8 Please guess an integer between 1 and 10: 5 Your guess is incorrect. Please try again: 2 You guessed it correctly in 2 attemptS >> >> exercise16 Please guess an integer between 1 and 10: 2 Your guess is incorrect. Please try again: 3 Your guess is incorrect. Please try again: 6 Your guess is incorrect. Please try again: 5 Your guess is incorrect. Please try again: 8 Your guess is incorrect. Please try again: 9 Your guess is incorrect. Please try again: 10 Your guess is incorrect. Please try again: 1 Your guess is incorrect. Please try again: 4 Your guess is incorrect. Please try again: 7 You guessed it correctly…
Write a function lis_rec(arr) that outputs the length of the longest increasing sequence and the actual longest increasing sequence. This function should use divide and conquer strategy to the solve the problem, by using an auxiliary function that is recursive. For example, one possibility is to define a recursive function, lis_rec(arr, i, prev), that takes the array arr, an index i, and the previous element index prev of LIS (which is part of the array arr before index i), and returns the length of the LIS that can be obtained by considering the subarray arr[i:]. Write a dynamic programming version ofthe function, lis_dp(arr), that outputs the length of the longest increasing sequence and the actual longest increasing sequence by using a table to store the results of subproblems in a bottom-up manner. Test the performance of the two functions on arrays of length n = 100, 500, 1000, 5000, 10000. Compare the running times and memory usage of the two functions.
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 O. 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.
Create a function append(v, a, n) that adds to the end of vector v a copy of all the elements of array a. For example, if v contains 1,2, 3, and a contains 4, 5, 6, then v will end up containing 1, 2, 3, 4, 5,6. The argument n is the size of the array. The argument v is a vector ofintegers and a is an array of integers. Write a test driver.
I need this done in R. Thanks!
Given a budget (type long) and a list of prices represented as entries of a container of type vector<long>, find out how many items on the price_list you can afford at most. This is the return value of the function. Here is its prototype: int get_most_items(std::vector<long>price_list, long budget) To solve this homework, it is a good idea to first sort the price_list in ascending order. For sorting in ascending order, you can use the function std::sort(). It can be called as std::sort(v.begin(), v.end()) .Note that there may be items on the price list whose prices are negative to make the problem a bit more interesting. If the size of price_list is zero, the function returns 0. All necessary libraries have been included. All numbers are expressed in Cents to avoid rounding errors. Here is a simple example:std::vector<long> price_list = { 10, 199, 1}; long budget = 11; int no_items = get_most_items(price_list, budget);The variable no_items will then have the…