Write a Python function countEvens that consumes an integer N and a nested list representing a matrix of arbitrary size (but larger than NxN). The function returns the number of even numbers in the NxN sub-matrix of the first N rows and columns. Note: You may assume the list argument passed to the function is a nested list of integers, but it may be larger than NxN!

Write a Python function countEvens that consumes an integer N and a nested list representing a matrix of arbitrary size (but larger than NxN). The function returns the number of even numbers in the NxN sub-matrix of the first N rows and columns. Note: You may assume the list argument passed to the function is a nested list of integers, but it may be larger than NxN!

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 18PE

See similar textbooks

Similar questions

Write a Python function `removeDuplicates(myList)` that removes duplicate values from a list. While the algorithm for this problem might seem trivial, its implementation is not. In general, it is not advisable to modify a list while you are iterating on it, as in the following pseudo-code: for element in myList: if <condition>: <remove element(s) from myList> # recipe for disaster
write a Python function that takes in a list of integers (nums) and finds whether the list consists of any duplicate numbers, the function returns True or False accordingly (Note: this is not a linked list, just a Python list). Function must run in place and cannot use Python’s built-in Set() structure. Make sure to provide the most efficient algorithm in terms of its time and space complexity.
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 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.
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function: void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support…
Write a function that gets a linked list of ints, and reverses it. For example - on input 1 -> 2 -> 3 -> 4, after the function finishes the execution, the list becomes 4 -> 3 -> 2 -> 1 - If the list has one element, then it doesn’t change - If the list is empty, then it doesn’t change You may use the data fields in the struct and the functions provided in LL.h and LL.c. // reverses a linked list void LL_reverse(LL_t* list); Test for the Function; void test_q3() { LL_t* lst = LLcreate(); LL_add_to_tail(lst, 1); LL_add_to_tail(lst, 3); LL_add_to_tail(lst, 8); LL_add_to_tail(lst, 4); LL_add_to_tail(lst, 3); LL_reverse(lst); intcorrect[] = {3,4,8,3,1}; inti; node_t* n = lst->head; for(i=0;i<5;i++) { if (n==NULL) { printf("Q3 ERROR: node %d==NULL unexpected\n", i); return; } if (n->data != correct[i]) { printf("Q3 ERROR: node%d->data==%d, expected %d\n", i, n->data, correct[i]); return; } n = n->next; } if (n==NULL) printf("Q3 ok\n"); } Support File…
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].
Write a python program and add a function called add_matrix() to it. This functiontakes two 2-D lists of integers (matrix) as parameters and computes their sum, if a sumcan actually be computed. Otherwise, it returns an empty list. Note that, two matrices canonly be added together if they have the exact same dimensions. If the dimensions areacceptable, then the resulting matrix will also have the same dimensions as its operands,and the value of each element in the resulting matrix is the sum of the correspondingelements in the input matrices.Hint: test rectangularity (the number of rows and the number of elements in each rowmust be the same in two matrices) before attempting addition.Sample output:>>> matrix1 = [[2,3], [4,5]]>>> matrix2 = [[9,0], [8,6]]>>> print(add_matrix(matrix1, matrix2))[[11, 3], [12, 11]]
In python, remove_from_list(my_list, indices): Takes two lists as input. Creates a new list from the first input list by removing the elements at indices given by the integers in the second input list, then return the new list. The indices in the second input list may have any order. For example, if the first input list is [4, 8, 12, 16], and the second input list is [0, 2], then the new list returned from the function should have the 4 and the 12 removed, because they were at indices 0 and 2 of the original list. Note: You do not need to consider negative indices for this function. >>> remove_from_list(['abc', 'def', 'ghi'], [1]) ['abc', 'ghi'] >>> strs = ['The', 'quick', 'brown', 'fox'] >>> remove_from_list(strs, [0, 3]) ['quick', 'brown'] >>> strs ['The', 'quick', 'brown', 'fox'] # original list is unchanged >>> remove_from_list(['The', 'quick', 'brown', 'fox'], [3, 0]) ['quick', 'brown']
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.
Suppose a node of a linked list is defined as follows in your program: typedef struct{ int data; struct Node* link; } Node; Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.