Implement a function countMultiples in Python that: accepts a single argument, a 2-dimensional list (e.g, list of lists) containing non-negative integers, and returns the count of those integers that are multiples of 5 but that are not not multiples of 10. (e.g., 65 should be counted, but 80 should not be counted) sample usage: >>> countMultiples( [[1,2,3],[4,5],[6,7,8,9]] ) # 5 counts 1

Implement a function countMultiples in Python that: accepts a single argument, a 2-dimensional list (e.g, list of lists) containing non-negative integers, and returns the count of those integers that are multiples of 5 but that are not not multiples of 10. (e.g., 65 should be counted, but 80 should not be counted) sample usage: >>> countMultiples( [[1,2,3],[4,5],[6,7,8,9]] ) # 5 counts 1

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter18: Stacks And Queues

Section: Chapter Questions

Problem 16PE: The implementation of a queue in an array, as given in this chapter, uses the variable count to...

See similar textbooks

Similar questions

Write a program in python with a function isPal(L), where L is a list of integers, and the function returns True if the list is a palindrome, False otherwise. For example [5, 2, 9, 9, 2 5] is a palindrome. Use the reverse() method of list and check if the reversed list is the same as the original list.
Write a Python function peaksIndex() that takes a list as parameter, returns a list that contains the indexes of peak values in the list.A peak value is greater than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 5, 7, 6, 6, 4, 3, 5, 2, 6, 7] has 2 peaks, the first 7 (index 3) and the second 5 (index 8). Both of these values are greater than their predecessor and their successor. So the function will return [3, 8] for this list.Write only the answer of what is asked. Unnecessary statements may result in loss of points.
Write a Python function peaksIndex() that takes a list as parameter, returns a list that contains the indexes of peak values in the list.A peak value is greater than its predecessor and its successor.Assume that the list contains numbers.Example: [4, 2, 5, 7, 6, 6, 4, 3, 5, 2, 6, 7] has 2 peaks, the first 7 (index 3) and the second 5 (index 8). Both of these values are greater than their predecessor and their successor. So the function will return [3, 8] for this list.Write only the answer of what is asked.
Implement the following functions in the same application in C#: 1. Given a number (integer) N (greater than 1). Implement a Fibonacci sequence of length N. (Function name ComputeFibonacciSequence )ComputeFibonacciSequence receives N.2. Given a list L with n numbers (integers), implement a function that returns whether that list is even prone or not (i.e.: the number of even numbers in the list must be higher than that of the odd numbers.) (Function name ComputeEvenProne) - Return 1 if the list is even prone, return 0 if it is not.ComputeEvenProne receives L.
Implement a function findMixedCase in Python that: accepts a single argument, a list of words, and returns the index of the first mixed case word in the list, if one exists, (a word is mixed case if it contains both upper and lower case letters), and returns -1 if the all words are either upper or lower case. sample: >> findMixedCase( ['Hello','how','are','you'] ) # 'Hello' is mixed case0
Write a program in PYTHON with a function max(L) which examines the argument list L, and returns the largest object of type float. If there is no float object in the list, then the function returns None. For example,max([100, 'blue', 3.5, 'sugar on the rocks', 7.0]) would return 7.0, andmax([7, 2, 9, 1]) would return None. Note that type(element) == float is a way to check if element is a float
PYTHON!!! Implement a function insert_sorted, which will insert a string into its appropriate location in a list of sorted strings. This function is called with two parameters: - A list containing words (each of type str) appearing in an ascending lexicographical (alphabetical) order. - A word (of type str) that is to be inserted into the list provided by the first parameter. When the function is called, it should add the second parameter's value into its sorted place in first parameter (the list). That is, it mutates the list, so that after the execution, it would also include the newly added word (the second parameter), and remain sorted.
Please answer it in Python Write a function insere_milieu that takes as an argument a list l and an element elem and returns the list obtained from l by adding elem "in the middle" of l, that is: If the length of l is even, the item is added once, in the middle of the list. If the length of l is odd: the element is added on either side of the central element. Example: insere_milieu([4, 7, 12, 3], 0) is [4, 7, 0, 12,3] insere_milieu([9, 3, 5, 6, 2], 1) is [9, 3, 1, 5, 1, 6, 2].
In Python Please Implement a function all_same(lst: list) -> bool that determines whether all the elements in a list are the same. For example, all_same([1, 1, 1, 1]) == True, all_same([]) == True, all_same([1, 3, 1, 1]) == False.
Write a function split n l that splits the list l and returns a pairof lists containing the first n elements of l and the rest of l, wheresplit has the type int -> ’a list -> (’a list * ’a list). For ex-ample, split 3 [1,2,3,4,5] returns the pair ([1,2,3], [4,5]) andsplit 3 [1,2,3] returns ([1,2,3], []).
Write a python function named replaceVal(list, valToBeReplaced, newValue) which takesthe above described inputs and finds the value ‘valToBeReplaced’ in the list. If it ispresent, it is replaced with newValue and the updated list is returned, otherwise thesame list is returned.Example:[1,2,3,4,5], 5, 20Output: [1,2,3,4,20] Example:[10, 15, 20, 25, 30], 5, 20Output: [10, 15, 20, 25, 30]
Write a program in PYTHON with a function longest(L) which examines the argument list L and returns the longest string. You can assume all of the elements of the list L are strings, and that the list is not empty. Use the approach where there is a variable largestyet which is initialized to the first element of L. Then go through the rest of the elements and update largestyet whenever you encounter a longer string. For example, longest(['blue', 'red', 'the old barn', 'the white house', 'green']) would return 'the white house'.