Create a list of 20 random grades between 0 and 100. Write the code for filtering that generates a list of grades that are A or B only (80<= grades <<100). Use filtering and lambda to create the auxiliary function. Example: [95, 19, 96, 69, 61, 72, 57, 85, 56, 75, 53, 23, 33, 94, 39, 96, 48, 49, 54, 90] Output: [95, 96, 85, 94, 96, 90] Make sure you generate random as required numbers. Don't take input

Create a list of 20 random grades between 0 and 100. Write the code for filtering that generates a list of grades that are A or B only (80<= grades <<100). Use filtering and lambda to create the auxiliary function. Example: [95, 19, 96, 69, 61, 72, 57, 85, 56, 75, 53, 23, 33, 94, 39, 96, 48, 49, 54, 90] Output: [95, 96, 85, 94, 96, 90] Make sure you generate random as required numbers. Don't take input

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

Complete the below function which takes the coefficients of a polynomial P(x) as a tuple, and a list of values, and returns a list of computed values of P(x). Note that P() can be of any order. For example, P((2,-1,1), [1,2,3]) shall compute P(x) for x=1,2,3P(x)=2x^2 -x +1where x^2 denotes the square of x. Hence, the function must return [2,7,16], because P(1) is 2, P(2) is 7, and P(3) is 16.
Write a function biggest_gap(L) that takes a list L of real numbers or integers and finds the largest difference |a−b| between two adjacent elements a and b. The function should return |a−b| and the index of the second element in the list. As an example, a correctly written biggest_gap should return 25,2 when run on L=[7, 13, 38, 43, 53]. Test your function on the array A and show the result. A = [12, 45, 23, 22, 42, 15, 17, 15, 73, 36, 7, 13, 38, 43, 53, 86, 40, 45, 63, 74]
Using the function provided, write a function that decides whether two lists are "identical". That is, if cycling by any number N makes the lists identical, the function should return True, otherwise, it should return False. for example identical([1,2,3,4,5], [5,4,1,2,3,]) should give True and identical([1,2,3,4,5,6], [1,2,3,5,4]) should give False.
Write a function inde which returns the index (start from 1) of the occurrence of a given value. Use helper function. Two functions are enough.inde(1, [1,2,1,1,2,2,1]) → [1,3,4,7] Write a function nele which repeats each element in a list n times. Use helper function. Two functions only.nele([1,2],3) → [1,1,1,2,2,2] Write a function isfact to determine if a positive integer is a factorial number. Do not use any formula such as T(n)=n(n+1)/2. Do it in recursive fashion. Two functions are enough.isfact(120) → true
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses. For example, given n = 3, a solution set is: [ "((()))", "(()())", "(())()", "()(())", "()()()" ] """ def generate_parenthesis_v1(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) return ifright>0: add_pair(res, s+")", left, right-1) ifleft>0: add_pair(res, s+"(", left-1, right+1) res= [] add_pair(res, "", n, 0) returnres def generate_parenthesis_v2(n): defadd_pair(res, s, left, right): ifleft==0andright==0: res.append(s) ifleft>0: add_pair(res, s+"(", left-1, right) ifright>0andleft<right: add_pair(res, s+")", left, right-1).
I have this function that works for the selection sort. I need a function that would work using the same logic for the BubbleSort and InsertionSort. void Selection_Sort(struct studentTag STUDENTS[], int nStudents){ struct studentTag s, t, temp; int i, j; for(i = 0; i < nStudents; i++) { for(j = i + 1; j < nStudents; j++) { s = STUDENTS[i]; t = STUDENTS[j]; if (strcmp(s.name.last, t.name.last) > 0) { temp = STUDENTS[j]; STUDENTS[j] = STUDENTS[i]; STUDENTS[i] = temp; } else if (strcmp(s.name.last, t.name.last) == 0) { if (strcmp(s.name.first, t.name.first) > 0) { temp = STUDENTS[j]; STUDENTS[j] = STUDENTS[i]; STUDENTS[i] = temp; } } } } }
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…
Write a function sort_and_return_in_pairs_list for example:[12, 13, 11, 15] return =>(11.12) and (12,13)[14,19,16,18,17,15] return =>(14.15) (16.17) (18.19)
Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 10 4 39 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space, including the last one. Your program must define and call the following function. When the SortVector function is complete, the vector passed in as the parameter should be sorted.void SortVector(vector<int>& myVec) #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() {/* Type your code here */ return 0;} Please help me with this problem using c++.
Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 10 4 39 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space, including the last one. Your program must define and call the following function. When the SortVector function is complete, the vector passed in as the parameter should be sorted.void SortVector(vector<int>& myVec) Hint: There are many ways to sort a vector. You are welcome to look up and use any existing algorithm. Some believe the simplest to code is bubble sort: https://en.wikipedia.org/wiki/Bubble_sort. But you are welcome to try others: https://en.wikipedia.org/wiki/Sorting_algorithm. #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() { /*…
list_n_perfect_squares This function takes a positive integer, n, and returns a list containing n perfect square numbers, starting with 1 and counting up to n2 Use a list comprehension and a range! Sample runs should look like: >>> list_n_perfect_squares(6)[1, 4, 9, 16, 25, 36]>>> list_n_perfect_squares(1)[1]>>> list_n_perfect_squares(20)[1, 4, 9, 16, 25, 36, 49, 64, 81, 100, 121, 144, 169, 196, 225, 256, 289, 324, 361, 400]