Complete the get_sum_of_evens (lower_bound, upper_bound) function that takes two integer parameters, lower bound and upper bound. The function returns the sum of all the even numbers between the two bounds, both included, passed to the function. You can assume that lower bound will always be smaller than or equal to upper bound. For example: Test result get sum_of_evens (2, 4) print("The sum of all even numbers are:", result) print (get_sum_of_evens (9, 17)) Result The sum of all even numbers are: 6 52

Complete the get_sum_of_evens (lower_bound, upper_bound) function that takes two integer parameters, lower bound and upper bound. The function returns the sum of all the even numbers between the two bounds, both included, passed to the function. You can assume that lower bound will always be smaller than or equal to upper bound. For example: Test result get sum_of_evens (2, 4) print("The sum of all even numbers are:", result) print (get_sum_of_evens (9, 17)) Result The sum of all even numbers are: 6 52

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

Look at the differences between max1 and max22. What is the difference?3. Do the two functions do the same amount of computation?4. If so, do you think that the two functions will run in the same amount of time? #include <stdio.h>#include <time.h>#include <stdlib.h> // For the assignment, be sure to run unmodified code, but you are free to // play around with the code to try out different parameters or different// implementations. // arrs is a 16384 element array of 256 integer arrays (a 2D array)// each function is run 50 times (numiters) in order to increase the runtime// into the range of seconds (which is the time printed) int max1(int** arrs, int narrs, int arrlen) { int max = 0; for (int i=0; i<narrs; i++) { for (int j=0; j<arrlen; j++) { if (arrs[i][j] > max) max = arrs[i][j]; } } return max;} int max2(int** arrs, int narrs, int arrlen) { int max = 0; for (int j=0; j<arrlen; j++) { for (int i=0; i<narrs; i++) {…
How many parameters does the following function have? def printvar(myvar) : print(myvar, end ='')
Hi, I am implementing a matrox with several functions. I have pasted the error, the assignment and my code. Hopefully you can see what causes the error and how to fix it. Thank you so much. My transpose function gives an error: IndexError: list assignment index out of range self = <tests_matrix.TestsStudent testMethod=test_transpose> def test_transpose(self): self.assertEqual(str(self.a.transpose()), ' 1 4 7\n 2 5 8\n 3 6 9\n') self.assertEqual(str(self.b.transpose()), ' 2 8 14\n 4 10 16\n 6 12 18\n') self.assertEqual(str(self.c.transpose()), ' 1 0 0\n 0 1 0\n 0 0 1\n') self.assertEqual(str(self.a.transpose().transpose()), ' 1 2 3\n 4 5 6\n 7 8 9\n') self.assertEqual(str(self.e.transpose()), ' 0 0 0 1\n 0 0 1 0\n 0 1 0 0\n 1 0 0 0\n') > self.assertEqual(str(self.f.transpose()), ' 1 2 3 1\n 2 3 2 3\n 3 1 1 2\n') tests_matrix.py:34: _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ self = 1 2 3 2 3 1 3 2 1 1 3 2 def transpose(self): nl…
3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n) 4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…
Please enumerate all of the situations when invoking inline functions will not get the expected results.
It says there is an error in the class solution(the followup one), specifically in the read data function students[i].setGrade(); It says it is empty, but when I add the declaration char grade; to the function and change the statement to students[i].setGrade(grade); it still says there is an error. What does it need to be instead? Here is my code: #include <iostream> #include <string> using namespace std; const int numstudents = 20; class studentType { private: string studentFName; string studentLName; int testscore; char grade; public: void setName(string first, string last) { studentFName = first; studentLName = last; } void setScore(int score) { testscore = score; } void setGrade(char grade) { if (testscore >= 90) { grade = 'A'; } if (testscore <= 90 && testscore >= 80)…
Hi there, You mention what should be changed in a comment in the function multiply right? but you dint cgange it in the code, right? (i see no difference). besides, my error was in the transpose function. The multiply function actually passed the tests. Do you see any errors in the transpose function? Thanks
1) What is the purpose of the code below? 2) What is each function used for in the code? 3) What are the names of the parameters/ arguments and what are they responsible for? 4) Why did you use a while loop in you code? 5) How did you accomplish the sort() to sort numbers? Code: #predefined modulesimport randomimport math #function to sort the list in ascending orderdef sort(x): #predefined function sort() x.sort() #print the sorted list print("\nSorted list is: ",str(x)) #function to find the sum of list elementsdef sum_of_list(x): #predefined function sum() Sum=sum(x) #return the sum of list elements return Sum #function to list the maximum from the listdef list_max(x): #predefined function max() maximum=max(x) #return maximum return maximum #function to test the above three functiondef main(): #set a flag variable flag=True #create a list list1=list() #initialize the list element by using randrange() predefined function of…
The program will ask the user for their name and employee ID. The ID will be a five-digit number. This will be done in a single function, AskNameId, with bool return, where the name and id are passed as pointers. Read both variables as strings with a getline and convert the id to an int using atoi. Check that the id is not 0. If it is, cout a message to the user for entering an invalid id. Check if the name is an empty string. If it is, cout a message to the user for entering an invalid name. Return a bool, true if name and id are both valid and false if either one is not valid.
(Numerical) Write a program that tests the effectiveness of the rand() library function. Start by initializing 10 counters to 0, and then generate a large number of pseudorandom integers between 0 and 9. Each time a 0 occurs, increment the variable you have designated as the zero counter; when a 1 occurs, increment the counter variable that’s keeping count of the 1s that occur; and so on. Finally, display the number of 0s, 1s, 2s, and so on that occurred and the percentage of the time they occurred.
Edit the isPrime function so that it returns False when any number less than 3 is passed (including negative numbers). Then write a function called nPrimes that accepts an integer parameter called n and then prints the first n prime numbers. Start looking for prime numbers at 3, and keep looking until you find n of them. Your nPrimes function should use the isPrime function to determine if a number is prime. Both of these functions should be placed in a file called NPrimes.py. Here is a sample run of the completed program: Enter the number of primes you want to find: 10 3 5 7 11 13 17 19 23 29 31 from NPrimes import nPrimesdef main(): n = int(input("Enter the number of primes you want to find: \n")) nPrimes(n) main() def isPrime(num): prime = True for x in range(2, num): if num % x == 0: prime = False break return prime;
Fix an error and show it please? And here are the information about the homework and for the error too. def kwargs_to_args_decorator(*args, **kwargs): This question is meant to test your knowledge of creating a decorator that accepts an arbitrary number of positional and keyword arguments, to decorate a function that accepts an arbitrary number of positional and keyword arguments, and alters the arguments before passing them to the decorated function. When the decorated function is invoked, this decorator should modify the arguments the decorated function receives. This decorator should filter out all positional arguments passed to the decorated function, which are found in the positional arguments passed to the decorator when the decorator was initialized. It should also filter out all keyword arguments with keys that are found in the keyword arguments given to the decorator when the decorator was initialized. After performing the modifications to the arguments, the decorator should…