Use the Design Recipe to write a function weighted_total(number_list,weights) that consumes a list of numbers and a list of weights and returns the weighted total of the numbers. If the numbers are [1,2,3] and the weights are [0.1,0.5,0.4] then the weighted total should be 1 * 0.1 + 2 * 0.5 + 3 * 0.4 = 2.3 Think about what needs to happen before using a loop, during the loop, and after the loop finishes. In this question you are required to use a for loop, and not allowed to use the sum function.

Use the Design Recipe to write a function weighted_total(number_list,weights) that consumes a list of numbers and a list of weights and returns the weighted total of the numbers. If the numbers are [1,2,3] and the weights are [0.1,0.5,0.4] then the weighted total should be 1 * 0.1 + 2 * 0.5 + 3 * 0.4 = 2.3 Think about what needs to happen before using a loop, during the loop, and after the loop finishes. In this question you are required to use a for loop, and not allowed to use the sum function.

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter6: Modularity Using Functions

Section6.4: A Case Study: Rectangular To Polar Coordinate Conversion

Problem 9E: (Numerical) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

You are given a list of integers. Write a function in Python to find the maximum sum that can be obtained by summing non-adjacent elements from the list. The function should return the maximum sum. Example: Input: [2, 4, 6, 8, 5] Output: 13 Explanation: The maximum sum can be obtained by selecting elements 2, 6, and 5 (non-adjacent) and summing them: 2 + 6 + 5 = 13. Input: [5, 1, 1, 5] Output: 10 Explanation: The maximum sum can be obtained by selecting elements 5 and 5 (non-adjacent) and summing them: 5 + 5 = 10. Instructions: Implement a function called max_non_adjacent_sum that takes a list of integers as input. Write the necessary code to find the maximum sum of non-adjacent elements. Return the maximum sum. Test your function with different input cases to validate its correctness.
Use Standard ML Code: Write a function that returns the factorial of a number. Write a function that sums all numbers in a list of pairs. e.g.: sum_of_pairs [(1, 2), (4, 3), (2, 5)] should return 17 (which is equal to 1 + 2 + 4 + 3 + 2 + 5) Write a function to return a list of second elements in a list of pairs. e.g.: sends [(1, 2), (4, 3), (2, 5)] should return [2, 3, 5]।
I really need help with this problem Write a program that reads a list of integers, and outputs whether the list contains all multiples of 10, no multiples of 10, or mixed values. Define a function named is_list_mult10 that takes a list as a parameter, and returns a boolean that represents whether the list contains all multiples of ten. Define a function named is_list_no_mult10 that takes a list as a parameter and returns a boolean that represents whether the list contains no multiples of ten. Then, write a main program that takes an integer, representing the size of the list, followed by the list values. The first integer is not in the list. Ex: If the input is: 5 20 40 60 80 100 the output is: all multiples of 10 Ex: If the input is: 5 11 -32 53 -74 95 the output is: no multiples of 10 Ex: If the input is: 5 10 25 30 40 55 the output is: mixed values The program must define and call the following two functions. is_list_mult10() returns true if all integers in the list are multiples…
I need to solve this in C++ code When analyzing data sets, such as data for human heights or for human weights, a common step is to adjust the data. This can be done by normalizing to values between 0 and 1, or throwing away outliers. For this program, adjust the values by subtracting the smallest value from all the values. The input begins with an integer indicating the number of integers that follow. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 30 50 10 70 65 the output is: 20 40 0 60 55 For coding simplicity, follow every output value by a space, even the last one. Your program must define and use the following function:int GetMinimumInt(vector<int> listInts) Note: This is a lab from a previous chapter that now requires the use of a function.
Write a function in C programming language that gets two ints x and y, and returns the sum of all ints between x and y, including them. int sum_interval(int x, int y); For example: - sum_interval(1, 4)returns 1+2+3+4=10. - sum_interval(10, 3)returns 3+4+5+6+7+8+9+10=52. - sum_interval(2, -1)returns (-1)+0+1+2=2. - sum_interval(-1, -1)returns -1. Note that we may have x>=y or x<=y. You may assume that the sum will be within the range of int.
Suppose you are given a list of integers, where each integer represents the maximum number of steps that can be jumped going forward from that element. Write a function to determine if it is possible to reach the last index starting from the first index. For example, given the list [2,3,1,1,4]. you can start at the first index, jump 2 steps to the second index, then jump 1 step to the third index, then jump 1 step to the fourth index, and finally, jump 4 steps to the last index. Therefore, the function should return "True". However, given the list [3,2,1,0,4], it is impossible to reach the last index. Therefore, thef unction should return "False" Solve it in python
Because floating-point numbers are imprecise, it is common to compute data values of type float that are very close but not exactly equal to the value 0.0. a) In Python, Write a function countNZdata that counts number of elements in a list of type float whose absolute value is less than or equal to a positive tolerance parameter. The function takes the list as its first parameter; the second parameter is the positive float value that is the tolerance. Function should return the number of data values that meet this criterion. For example, for the given list: [2.19, -0.04, 1.66, 0.05, 4.70, -6.53, -0.11, -1.07, 1.94, -2.23] and a tolerance = 0.1, the function should return the value 3. b) Demonstrate that the function works by inputting different example values.
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))…
A common programming problem is maintaining a list in numerical or alphabetical order. For example, inventory part numbers are typically kept in numerical order, but telephone lists are kept in alphabetical order. For this exercise, write a function that inserts a three-digit part number in a list of part numbers. The list is maintained in increasing numerical order, and duplicate part numbers aren’t allowed. Allocate a maximum list size of 100 values, and use a sentinel value of 9999 to indicate the end of the list. For example, if the current list contains nine part numbers, the 10th position in the list contains the sentinel value. the insertion process for an original list of nine part numbers, using the following processing algorithm: To determine where in the list the new part number should be placed This is done by comparing the new part number to each value in the current list until a match is found, a part number larger than the new part number is located, or the end of the…
A common programming problem is maintaining a list in numerical or alphabetical order. For example, inventory part numbers are typically kept in numerical order, but telephone lists are kept in alphabetical order. For this exercise, write a function that inserts a three-digit part number in a list of part numbers. The list is maintained in increasing numerical order, and duplicate part numbers aren’t allowed. Allocate a maximum list size of 100 values, and use a sentinel value of 9999 to indicate the end of the list. For example, if the current list contains nine part numbers, the 10th position in the list contains the sentinel value. the insertion process for an original list of nine part numbers, using the following processing algorithm: To determine where in the list the new part number should be placed This is done by comparing the new part number to each value in the current list until a match is found, a part number larger than the new part number is located, or the end of the…
Write a function MedianWithoutHL(ScoreList) that takes an unsorted list of n numbers as a parameter, discards the highest and the lowest numbers and return the median. You can assume the number of items in the list is between 0.0 and 9.9. To find the median from a list of items, you have tosort the list and find out the value of the item in the middle.Note: If the list has an odd number of items, the median is the value of the middle item. If the list has an even number of items, the median is the average of the two middle items.Sample Run #1:scoreList1 = [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]print("The Original ScoreList: ", scoreList1)print(MedianWithoutHL(scoreList1))Output of Sample Run #1:The Original ScoreList: [9.0, 9.0, 7.5, 8.0, 9.5, 6.5, 5.0, 7.0, 7.5, 8.5]The List after sorting: [5.0, 6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0, 9.5]Without the High & Low: [6.5, 7.0, 7.5, 7.5, 8.0, 8.5, 9.0, 9.0]7.75
Please answer it in Python 1) Write a function last_consonant that takes as an argument a word and returns two return values: the index of its last consonant and the last consonant (as for lists, we will consider that the index of the first letter is zero). We will not deal with the problematic case where the word does not contain a consonant. Example: last_consonant('arrivee') returns 4, 'v' 2) Write a function double_consonant that takes as an argument a word and has two return values: a Boolean worth True if the word contains a double consonant (twice the same consonant in a row), and in this case the second return value is the consonant that is doubled; if there is no doubled consonant, the function must return False and None. If the word contains several double consonants (for example, 'successor'), true will be returned and the first double consonant appearing in the word. Examples: double_consonant('arrive') is True, 'r'. double_consonant ('candy') is false, none…