Implement a method called strangeAverage, which inputs a list of ints and calculates the strangeAverage of the numbers in the list. The strange average is defined as the average of unique items in a list. For example: strangeAverage ([1,2,2,3,3,3,3,4]) -> 2.5 # Average of 1, 2, 3, 4 -> 10 / 4 strangeAverage([3,3,4,5]) -> 4 # Average of 3, 4, 5 -> 12 / 3

Implement a method called strangeAverage, which inputs a list of ints and calculates the strangeAverage of the numbers in the list. The strange average is defined as the average of unique items in a list. For example: strangeAverage ([1,2,2,3,3,3,3,4]) -> 2.5 # Average of 1, 2, 3, 4 -> 10 / 4 strangeAverage([3,3,4,5]) -> 4 # Average of 3, 4, 5 -> 12 / 3

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Please answer quick in python
PYTHON: Give a recursive implement to the following function: def split_by_sign(lst, low, high) The function is given a list lst of non-zero integers, and two indices: low and high (low ≤ high), which indicate the range of indices that need to be considered. The function should reorder the elements in lst, so that all the negative numbers would come before all the positive numbers. Note: The order in which the negative elements are at the end, and the order in which the positive are at the end, doesn’t matter, as long as all he negative are before all the positive. Please type answer no write by hend.
Haskell Using the recursive definitions show how "length [1,2,3]", "drop 3 [1,2,3,4,5]", and "init [1,2,3]" are evaluated. Here, you need to write out (i.e., show) each step that Haskell takes to evaluate the corresponding three expressions. Note : recursive definition of "init" is: init :: [a] -> [a] init [_] = [] init (x:xs) = x : init xs
Python language only Suppose you are working in the pizza company named Dominoes. Dominoes provides the best in class pizza in the world so While dealing with the coustomer you got a number on every billed amount. SO here your task is to identifiy that the billing amount is a magic number or not. A number is said to be a magic number, if the sum of its digits are calculated till a single digit recursively by adding the sum of the digits after every addition. If the single digit comes out to be 1,then the number is a magic number. Input : 1234Output : Yes it isInput : 12345Output : No it is not
Write a C++ program incorporating recursion to solve the following problem. The program should compile and execute under the UNIX gcc or g++ environments. (show this please) In this program it needs to accept a sequence of k characters from the user and use the characters to produce a k concentric squares. Also assume that there is an index origin of 1, the outermost square is made up of the letter a[k], the square inside that is made from the letter a[k-1], the square inside that is made from the letter a[k-2], and so on, with the innermost square made from the letter a[1]. For example, if k=5, and the values of a are ("R","O","C","K","Y") then the executed program should display: Y Y Y Y Y Y Y Y Y Y K K K K K K K Y Y K C C C C C K Y Y K C O O O C K Y Y K C O R O C K Y Y K C O O O C K Y Y K C C C C C K Y Y K K K K K K K Y Y Y Y Y Y Y Y Y Y To make this program simpiler to do if you implement it in C++ and write a class; instances of this class can be passed by value. If a class is…
Note: Answer in Python only Sam has been very busy with his christmas preparations and he doesn't have time to look after Samosa Bhai and Jalebi Bai. To keep them busy, CodeChef has given them an array A of size N. He has asked them to plant trees at the points with Cartesian coordinates (A[i], A[j]), such that i
Please help with this program. Need to create a program in python called dads-stack that doesn’t use adjacency list but instead uses an adjacency matrix. The code should prompt the user for input will post instructions and picture of algorithm. Based upon the REQUIREMENTS above, along with the IMPLEMENTATION DETAILS (Le, this sections, you MUST develop a FINAL algorithmic solution using paeudocode This includes both your logic in pseudocode) and the logic presented in the pseudocode indicated in Algorithm 2.3. 2 be sure to include your name, along with the Certificate of Authenticity, as comments at the very beginning of your Python code. Also, if you collaborated with others be sore to state their names as well 3. Your program should begin by prompting the user for the number of vertices in the graph G 4. Your program will represent the graph Gunung an adjacency matrix, which is a square matra with a row and a column for each vertex. Thus your program will need create a matrox…
Note: Answer in Python only Sam has been very busy with his christmas preparations and he doesn't have time to look after Samosa Bhai and Jalebi Bai. To keep them busy, CodeChef has given them an array A of size N. He has asked them to plant trees at the points with Cartesian coordinates (A[i], A[j]), such that i
In c++, Thanks!!! Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Take an array and its size as input params and return a bool such that 'true' ==> array and all elements are prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. You will need to define one other helper function (IsPrimeRecur) for the recursion which should also not contain any loops to make it a…