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

Write a method called listFilter() that takes in a list of strings, and returns a list containing only the strings that have an even length or that end in "ing". You can either modify the provided list or create a new one.
/*** Write the method named nOdds().* * Given an ArrayList of positive Integers, return a new list * of length "count" containing the first odd numbers from * the original list. The original will contain at least * "count" odd numbers.* * Examples:* nOdds([3, 2, 4, 5, 8], 2) returns [3, 5]* nOdds([3, 2, 4, 5, 8, 9], 3) returns [3, 5, 9]* nOdds([3, 1, 2, 4, 5, 8], 3) returns [3, 1, 5]* * @param list the ArrayList of Integers to search.* @param count the number of odd numbers to copy.* @return the first "count" odd numbers from the list.*/// TODO - Write the nOdds method here.
Write the method named nOdds().* * Given an ArrayList of positive Integers, return a new list * of length "count" containing the first odd numbers from * the original list. The original will contain at least * "count" odd numbers.* * Examples:* nOdds([3, 2, 4, 5, 8], 2) returns [3, 5]* nOdds([3, 2, 4, 5, 8, 9], 3) returns [3, 5, 9]* nOdds([3, 1, 2, 4, 5, 8], 3) returns [3, 1, 5]
Write a Program in Java programming: Support you have an ArrayList containing random integers. These integers can be any number, and each integer can appear more than once. For example, [2, 19, 21, 19, 21, 1, 3, 3, 6, 21, .....] Your job is to write a method called findEvenFrequentNumbers(ArrayList<Integer> list) that returns an ArrayList which has all the numbers appears in even frequency and in increasing order. e.g. list = [2, 19, 21, 19, 21, 1, 3, 3, 6, 21], should return [3, 19] list = [3, 3, 3, 1, 2, 2, 2, 2, 2], should return [] list = [1, 1, 1, 1, 1], should return [1] Note that you need to provide a class with the main function and also the imports.
Write a static method called "flip4" that takes an ArrayList of integer values as a parameter and that rewrites successive sequences of four values in the list. For each sequence of four values, the method will swap the first element and the fourth element and then swap the second element with the third element. For example, suppose that a variable called list stores the following sequence of values: [3, 8, 19, 42, 7, 26, 19, -8, 193, 204, 6, -4] and we make the following call: flip4(list); Afterwards the list should store the following sequence of values: [42, 19, 8, 3, -8, 19, 26, 7, -4, 6, 204, 193] Each sequence of three elements will be rotated so that the 3rd value becomes the 1st value and the other two are moved to the next higher index; ie. the 1st becomes the 2nd and the 2nd becomes the 3rd. If the list has extra values that are not part of a sequence of three, those values are unchanged. For example, if the list had instead stored: [3, 8, 19, 42, 7, 26, 19,…
Write a method markLength4 that takes an ArrayList of Strings as a parameter and that places a String of four asterisks ("****") in front of every String of length 4. For example, suppose that an ArrayList called "list" contains the following values: (this, is, lots, of, fun, for, every, Java, programmer) And you make the following call: markLength4(list); Then list should store the following values after the call: (****, this, is, ****, lots, of, fun, for, every, ****, Java, programmer) Notice that you leave the original Strings in the list (this, lots, Java) but include the four-asterisk String in front of each to mark it. You may assume that the ArrayList contains only String values, but it might be empty.
Write a method manyStrings that takes an ArrayList of Strings and an integer n as parameters and that replaces every String in the original list with n of that String. For example, suppose that an ArrayList called "list" contains the following values: ("squid", "octopus") And you make the following call: manyStrings(list, 2); Then list should store the following values after the call: ("squid", "squid", "octopus", "octopus") As another example, suppose that list contains the following: ("a", "a", "b", "c") and you make the following call: manyStrings(list, 3); Then list should store the following values after the call: ("a", "a", "a", "a", "a", "a", "b", "b", "b", "c", "c", "c") You may assume that the ArrayList you are passed contains only Strings and that the integer n is greater than 0.
Write the method filterBySize().* * Given an ArrayList of String, return a new list where only * strings of the given length are retained.* * Examples:* filterBySize(["a", "bb", "b", "ccc"], 1) returns ["a", "b"]* filterBySize(["a", "bb", "b", "ccc"], 3) returns ["ccc"]* filterBySize(["a", "bb", "b", "ccc"], 4) returns []
Implement unique method that takes an ArrayList as input and returns an ArrayList withexactly a single occurrence of each element from the input list. For example, if the input listcontains 5, 6, 7, 6, 3, 5, 5, 4 then the output list should have 5, 6, 7, 3, 4.Note: (1) You may assume that the ArrayList has a specific type of elements in it. In the class, we assumedit to have String type values. (2) You may only work with ArrayList(s).
Write a method called stutter that replaces every value with two of that value. For example, if the list initially stores [42, 7, 0, –3, 15], after the call it should store [42, 42, 7, 7, 0, 0, –3, –3, 15, 15].
In java, Write a method void popMult(int k) for the ArrayBoundedStack class which will pop k items from this. Throw a StackUnderflowException and don't pop anything if there are fewer than k items on this. This is a method of the ArrayBoundedStack class. DO NOT USE ANY OTHER METHODS OF THE ARRAYBOUNDEDSTACK CLASS.
Write a method called changeQueue to be considered inside the ArrayQueue class and has one parameter item of type E. Your method will change the queue in such a way that if the the first element of the queue and the last element of the queue are equal, the first and last elements in the queue will be replaced with item, otherwise, do not do any change. Similarly, the same process is done for the second element in the queue and the element before the last in the queue and so on. Assume you have a non-empty queue with even number of elements. You are not allowed to call any method from the the ArrayQueue class. Do not use iterators. Method head: public void changeQueue(E item) Example1: Before run: front rear “this” queue: 10 29 2 2 5 10 Item1: 100 After run: front rear “this” queue: 100 29 100 100 5 100