Write a function named foo that has two parameters: n1 and n2. The function returns the outcome of adding up all the numbers above n1 up-to but excluding n2, where each number is raised to the power of itself. See below for an example. Your code must check that n1 is less than n2, and if so use a for loop with a range function. Otherwise, return -1. For example, when we pass 1, and 5 to the function it returns the sum of all integers of 22, 33, 44. But, if we pass 5 and 1, the outcome is -1.

Write a function named foo that has two parameters: n1 and n2. The function returns the outcome of adding up all the numbers above n1 up-to but excluding n2, where each number is raised to the power of itself. See below for an example. Your code must check that n1 is less than n2, and if so use a for loop with a range function. Otherwise, return -1. For example, when we pass 1, and 5 to the function it returns the sum of all integers of 22, 33, 44. But, if we pass 5 and 1, the outcome is -1.

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter6: User-defined Functions

Section: Chapter Questions

Problem 22PE

See similar textbooks

Similar questions

Code in Python Write a function, print_perfect_cubes(n), that takes an integer parameter n and prints the perfect cubes starting from 03 = 0 and ending with n3. When n is negative, the function prints nothing; but do not check for this condition with an "if" statement, it is unneccesary; use a for loop that will automatically print nothing when n < 0. Hint for choosing the right range for your for loop: In the general case, when n is not negative, your function will need to print n+1 different values. For example: Test Result print_perfect_cubes(2) 0 1 8 print_perfect_cubes(5) 0 1 8 27 64 125 print_perfect_cubes(-10)
Write a function named sum_nums() that takes two positive integers x and y as input parameters. Your program should loop from the lower number to the higher number and sum all those numbers in between that are not divisible by 5 and return the final sum. For example, if x = 13 and y = 4, your function would return the value of 4+6+7+8+9+11+12+13. Again, if x = 4 and y = 13, your function should return the same value. Call this function using different input parameters to test your code.
Define a function which takes one parameter N, and use loop(s) to control and output a pyramid pattern as follows: print a total of N rows, the number of asterisks in each row equals the row number (e.g. the 1st row has 1 asteroid, the Nth row has N asteroids). Note the pattern should be center aligned. E.g. when N is 5, you will print the following pattern * * * * * * * * * * * * * * *
Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False. Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates. Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following. aaa has duplicatesabc has no duplicates Print a line like one of the above for each of the strings in test_dups. test_dups = ["zzz","dog","bookkeeper","subdermatoglyphic","subdermatoglyphics"]
We would like to write a collection of functions that do operations on a list of numbers. For example, suppose we write a function max_val. The function takes a list of numbers and returns the maximum value. So, if we passed the list [1,30, 70,-90,80,2] the return value would be 80, since 80 is the maximum number in the list. Here is the list of functions we would like to write: (use basic coding, loops, functions, don't use things like the sum function) 1) max_val, return maximum value. 2) min_val, returns minimum value. 3) mean, returns average. 4) std, returns standard deviation. 5) list_append, adds a new element to the end of the list. 6) list_insert, inserts a new element to the list at a desired location (do not use the insert list function). 7) list_add, adds an inputed number to every value in the list. 8) list_subtract, subtracts an inputed number to every value in the list. 9) list_multiply, multiples an inputed number to every value in the list. 10) list_divide, divides…
please code in python Write a function that receives a string as an input and returns the most frequent letter from the given string. Your solution should be case insensitive, so a capital letter (like A) and its non-capital version (a) should be counted as the same letter. In the given string there can be spaces as well, but your solution shouldn’t count spaces. If there are multiple letters with the same occurrence, you can decide which one to return.
python only** define the following function: This function accepts a string as its only parameter, and it must return a tuple containing first the length of the string, and then the string itself. Define lengthAndValue with 1 parameter Use def to define lengthAndValue with 1 parameter Use a return statement Within the definition of lengthAndValue with 1 parameter, use return _in at least one place. Do not use any kind of loop Within the definition of lengthAndValue with 1 parameter, do not use any kind of loop.
Could you solve this Question please? Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False. Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates. Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following. aaa has duplicatesabc has no duplicates Print a line like one of the above for each of the strings in test_dups. Obs:Copy the code below into your program def histogram(s): d = dict() for c in s: if c not in d: d[c] =…
Write a function sequence that accepts an number ( int ) and that prints a sequence of numbers that starts at the given number and obeys the following rules: the number 1 is the last number in the sequence (e.g stop ) if the number if even, the next number is half of it if the number is odd, the next number is one more Specifications: use a while loop print each number in the sequence one per line
Write a function PrintShampooInstructions(), with int parameter numCycles, and void return type. If numCycles is less than 1, print "Too few.". If more than 4, print "Too many.". Else, print "N: Lather and rinse." numCycles times, where N is the cycle number, followed by "Done.". End with a newline. Example output with input 2: 1: Lather and rinse.2: Lather and rinse.Done.Hint: Declare and use a loop variable. #include <iostream>using namespace std; /* Your solution goes here */ int main() {int userCycles; cin >> userCycles;PrintShampooInstructions(userCycles); return 0;} Please help me with this problem using c++.
Bartleby answered my homework and Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False. Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates. Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following. aaa has duplicatesabc has no duplicates Print a line like one of the above for each of the strings in test_dups. True needs to be defined. I tried to code it but didn't accept and got an error message.
this code should be in python: write a function that allows the input of a list of strings as its only parameter. Inside the body of the function find the first palindromic word and return it. If there is no such word, it should return an empty string. A string is palindromic if it reads the same forward and backward so for example If we call the function with [“dog”, “cat”, “car”, “level”, “dad”], the returned value should be “level”. Note that “dad” is also a palindrome, but it is not the first one.