Kindly fix the error in this code from typing import List #definition of the count_odds() function which takes nested List of type integer and return list of integer... def count_odds(values: List[List[int]]) -> List[int]: #declare odd_count_list as empty list... odd_count_list = [] #go through all the sub-lists of values... for lst in values: #declare odd_count to 0... odd_count = 0 #again use for loop for all elements of the sub lists... for val in lst: #check if the val is odd or not... if val%2 != 0: #if val is odd then increment the odd_count by 1... odd_count += 1 #append the odd_count to odd_count_list... odd_count_list.append(odd_count) #return the odd_count_list... return odd_count_list #call the count_odds() function and print the result... print("The returned value by count_odds([[111, 165, 207]]) is = {}".format(count_odds([[111, 165, 207]]))) print("The returned value by count_odds([[1,2], [8], [5,6,7]]) is = {}".format(count_odds([[1,2], [8], [5,6,7]])))

Kindly fix the error in this code from typing import List #definition of the count_odds() function which takes nested List of type integer and return list of integer... def count_odds(values: List[List[int]]) -> List[int]: #declare odd_count_list as empty list... odd_count_list = [] #go through all the sub-lists of values... for lst in values: #declare odd_count to 0... odd_count = 0 #again use for loop for all elements of the sub lists... for val in lst: #check if the val is odd or not... if val%2 != 0: #if val is odd then increment the odd_count by 1... odd_count += 1 #append the odd_count to odd_count_list... odd_count_list.append(odd_count) #return the odd_count_list... return odd_count_list #call the count_odds() function and print the result... print("The returned value by count_odds([[111, 165, 207]]) is = {}".format(count_odds([[111, 165, 207]]))) print("The returned value by count_odds([[1,2], [8], [5,6,7]]) is = {}".format(count_odds([[1,2], [8], [5,6,7]])))

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 16PE

See similar textbooks

Similar questions

*IN C++ A handy feature of lists in Python is that you can use negative indices to get at elements starting from the very end. For example, x[-1] returns the last element in x, x[-2] returns the penultimate element, etc. Implement a struct named "PythonicIntVector" in the files "PythonicIntVector.h" and "PythonicIntVector.cpp" that supports the push_back and at methods of a vector of ints. However, be sure to add the functionality of negative indices. Don't forget that the at method still should throw exceptions for invalid indices (just like in Python)!
Run the code below to call the function # In[ ]: otherList = [395,2,-4,20,47,200,-50,-12] #a list for testing print ('Before sorting: ', otherList) bubbleSort (otherList) print ('After sorting:', otherList) a) What are the contents of otherList after a single iteration of the outer loop of 'bubbleSort? b) How many iterations of the outer loop happen when sorting `otherList? * Then run both blocks of code (the def block and the test block) again. * Examine the output to answer the question about iterations. Create a new list below with * elements known as "yourList" - a list where you can get 'bubbleSort` to stop early (do fewer iterations). How many times did the outer loop run for 'yourList? # In[ ]: yourList = [] #fill in this list with 8 elements separated by commas print ('Before sorting:', yourList) bubbleSort (yourList) print ('After sorting:', yourList)
LAB RESTRICTIONS, PLEASE READ: Do not add any imports, the ones that you need will be given to you. You may not use any dictionaries or dictionary methods. Do not use try-except statements, you should be able to anticipate or prevent any errors from happening at all!
Write a function called remove_odd that takes a list of numbers that have both even and odd numbers mixed.# Function should remove all the odd numbers and return a compact list which only contains the even numbers. Example1: Function Call:remove_odd ([21, 33, 44, 66, 11, 1, 88, 45, 10, 9])Output:[44, 66, 88, 10]
Complete the reverse_list() function that returns a new string list containing all contents in the parameter but in reverse order. Ex: If the input list is: ['a', 'b', 'c'] then the returned list will be: ['c', 'b', 'a'] Note: Use a for loop. DO NOT use reverse() or reversed(). This is my code so far: def reverse_list(letters): for x in (letters): letters.sort(reverse=True) return lettersif __name__ == '__main__': ch = ['a', 'b', 'c'] print(reverse_list(ch)) # Should print ['c', 'b', 'a'] When submitting I get 4/10 and it says: Test input list ['a', 'b', 'c'] returns ['c', 'b', 'a'] Your output reverse_list() function reversed array incorrectly: ['c', 'b', 'a'] reverse_list() function should have returned: ['a', 'b', 'c'] Test input list ['a', 'b', 'c', 'd'], first element of returned list is ['d'] Your output First character of returned array should be a instead of d Test empty input array TypeError: object of type 'NoneType' has no len()
Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. Below are the "CODE THAT NEEDS TO BE IMPROVED" or "NOT FINAL CODE" (See attached photo for reference) int add(int num) This will add the element num into the linked list and return the position of the newly-added element. In the above example, having add(60) will return 5 as it is the fifth position in the list. int remove(int num) This will remove the first instance of the element and return the position of the removed element. In the above example, having remove(40) will return 3 as 40 was the third element in the linked list before having removed. int get(int pos) This method will get the element at the specified position. This will return -1 if the specified position is invalid. int add(int num) { addTail(num); return index; } int remove(int num) { node* currnode = head; node* prevnode = NULL;…
Listdiff Use the built-in higher order functions2 and write a non-recursive function val listdiff : ’a list -> ’a list -> ’a list = that, given 2 lists, returns a third, containing elements of the first list that are not in the second list. # listdiff [1;2;2;6;3;9;1;4;6] [2;3]; Using OCaml
def count_types(lst: List[Any]) -> List[int]: """ Given a list <lst> of random types, return the number of occurrences of each type, in the form of a list, in the order that they were first seen. For example, if the input ['str1', 1, 'str2'], the output would be [2, 1], as a string type appears first, and occurs twice in the list. An integer type appears next, and only occurs once in the list. Another example could be [True, 'str1', 1, False, 'str2', True], where the output would be [3, 2, 1], as a boolean type appears first, and occurs three times in the list. A string appears next, and occurs twice in the list. Finally, an integer appears next, and occurs once in the list. """don't use any import, dictionaries, or dictionary methods or try-except statements.
Topic: SIngly Linked ListUsing C++ Programming, improve the implemented following function. Initial code is attached below. int count(int num) This will return the count of the instances of the element num in the list. In the linked list in removeAll method, having the method count(10) will return 3 as there are three 10's in the linked list. int count(int num) { int count = 0; for(int i=1; i<index;i++){ if(get(i)== num){ count++; } } return count; } OUTPUT: 1 2 3 4 5 6 7 8 9 2 0 0 10 -> 30 -> 40 -> 10 -> 20 -> 40 -> 10 EXPECTED OUT PUT: 1 2 3 4 5 6 7 8 9 2 10 40 10 -> 30 -> 40 -> 10 -> 20
Topic: Singly Linked ListImplement the following functions in C++ program. Read the question carefully. (See attached photo for reference) void isEmpty() This method will return true if the linked list is empty, otherwise return false. void clear() This method will empty your linked list. Effectively, this should and already has been called in your destructor (i.e., the ~LinkedList() method) so that it will deallocate the nodes created first before deallocating the linked list itself.
.Please do mImplement a program using Doubly LinkedList. Your doubly linked list should store information of students (Reg_no., Name, CGPA, city, age). Your program should provide following functionalities:  Insert at Front  Insert at Rear  Insert in middle  Delete from front  Delete from rear  Delete from middle  Display all the data Data Structures in C++ Needed urgent i will thumb up her
Write a function reverse_iter_for that takes a list and returns a new list that is the reverse of the original using a for loop. You should not need any indexing notation. def reverse_iter_for(lst): """Returns the reverse of the given list. >>> reverse_iter_for([1, 2, 3, 4]) [4, 3, 2, 1] TELEEL "*** YOUR CODE HERE ***" Complete the function reverse_iter_while that behaves identically to reverse_iter_for but is implemented as using a while loop. You may use indexing or slicing notation. Do not use 1st [::-1] ! def reverse_iter_while(lst): """Returns the reverse of the given list. >>> reverse_iter_while([1, 2, 3, 4]) [4, 3, 2, 1] rev_lst, i = [], 0 while i < len(lst): "*** YOUR CODE HERE ***"