Write a program to generate 10 random numbers from -100 to 100. Save the randomly generate numbers in a list. Create a function to count how many odd numbers are in a list. Create a function to count how many even numbers are in the list. Create a function to sum up all the even numbers in the list as well.

Write a program to generate 10 random numbers from -100 to 100. Save the randomly generate numbers in a list. Create a function to count how many odd numbers are in a list. Create a function to count how many even numbers are in the list. Create a function to sum up all the even numbers in the list as well.

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 python, create a function wherein you transfer elements from a list into different lists. If a certain element has been encountered, continue the listing in a new list. Continue doing so until this certain element has been encountered two times. Disregard the succeeding elements after the second certain element. Once you have your 2 lists, return them both as a tuple. Example: element_stop = ‘a’ original_list = [‘b’, ‘c’, ‘d’, ‘d’, ‘f’, ‘a’, ‘e’, ‘t’, ‘d’, ‘g’, ‘f’, ‘t’, ‘a’, ‘b’, ‘e’] The output should be: ([‘b’, ‘c’, ‘d’, ‘d’, ‘f’], [‘e’, ‘t’, ‘d’, ‘g’, ‘f’, ‘t’])
Write a function that takes in a list of numbers as arguments and returns the productof all the numbers in the list. Use a while loop to multiply each number in the list together.
Implement a function void printAll(void) to print all the items of the list.
Write a function that takes two arguments, a list L1 and a list L2. • If the length of the list L1 is greater than twice the length of the list L2, then append the first three values of L1 to the three last values of L2. E.g. if L1 = ‘(1 2 3 4 5 6 7) and L2 = ‘(8 9 10), then return ‘(1 2 3 8 9 10) Should be written in the Racket programming language
Create a function that takes a list of numbers and returns a list where each number is the sum of itself + all previous numbers in the list. Example: cumulative_sum([1, 3, 4, 5]) → [1, 4, 8, 13] WRITE IN PYTHON AND SHOW OUTPUT
Write a function that will accept a list of integers and return the sum of the contents of the list(……if the list contains 1,2,3 it will return 6…..)
program- python Write a function called “missing”. Ask the user for a series of integers from 1 to N. Send that list to missing and have it return the list of what numbers are missing. For example, if they enter 1 3 7 10, then you would call missing on that list which returns the list of missing numbers and then you can let them know by printing out the list that they are missing 2 4 5 6 8 9. Test it out on this and show it works. PLEASE USE SET SUBTRACTION
Write a function swap that swaps the first and last elements of a list argument.Sample output with input: 'all,good,things,must,end,here'['here', 'good', 'things', 'must', 'end', 'all'] ''' Your solution goes here ''' values_list = input().split(',') # Program receives comma-separated values like 5,4,12,19swap(values_list) print(values_list)
create an array of 30 random numbers that range between 1and 100. And yet again, write a function that will receive a number from the userand determine if that number exists in the array or not. But this time, start bySORTING your input list. After a sort, the list in problem 1 is as follows:[2, 2, 3, 5, 12, 14, 14, 15, 23, 36, 39, 41, 44, 44, 45, 48,49, 50, 52, 52, 59, 71, 81, 82, 88, 89, 89, 93, 96, 97] Approach: Implement a method called findC(x, A, i, j), where x is the number we arelooking for in array A, the first index of the array is i and the last index is j. We wantto determine whether x exists in A anywhere between index i and index j. Your firstcall to this method will therefore look like this: findC(x, A, 0, A.length-1). In the body of your function, compare x with the item that is in the middle of thearray, as you did before. As before, call the middle of index of the array mid. But thistime, if x<=a[mid], recursively call your function to search ONLY the first half of…
Given the list: int x[] ={4,2,5,3,6,0,7,1}; Write a C function that finds the lowest two values in the list. This must work for any list. Can someone please go through this step by step for me? Thank you!
Write python code 1) Write a function verifsort that accepts a list as a parameter, check if the list elements are sorted and returns: 1 - if the list is sorted in ascending order, 2 – if the list is sorted in descending order, and 0 – if the list is not sorted.
In PYTHON, write a program that reads elements from a list, where each element from the list is a list with three values. Call the function defined in part 1 with the 3 values as arguments in order and print the returning value.Test your code with the list:"numbers=[[3, 5, 4], [7, 4, 3], [2, 3, 1]]" The functions defined in part 1 were: def greatest(a,b,c): if a>b: return c ifnot a>b and a>c: return b ifnot a>b andnot a>c: return a print(greatest(2,3,1))