Given the following function foo , which choice(s) best describes its functionality in general? Select all that apply. def foo(1st: list[int]): x = [] for item in 1st: if item % 2 != 0: item += 1 else: x.append (item) return x O foo returns a new list of elements containing only odd integers foo returns a new list of elements containing only even integers | foo mutates list Ist, given a non-empty Ist O foo mutates list x, given a non-empty Ist after foo executes, x and Ist contain the same elements (i.e., x == Ist) O foo has a syntax error O none of these options are correct

Given the following function foo , which choice(s) best describes its functionality in general? Select all that apply. def foo(1st: list[int]): x = [] for item in 1st: if item % 2 != 0: item += 1 else: x.append (item) return x O foo returns a new list of elements containing only odd integers foo returns a new list of elements containing only even integers | foo mutates list Ist, given a non-empty Ist O foo mutates list x, given a non-empty Ist after foo executes, x and Ist contain the same elements (i.e., x == Ist) O foo has a syntax error O none of these options are correct

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 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…
Implement the function below void swap(int pos1, int pos2) {} Inital code to be completed: class LinkedList : public List { node* head; node* tail; int index; node* create_node(int num) { node* n = (node*) malloc(sizeof(node)); n->element = num; n->next = NULL; return n; } public: LinkedList() { index = 0; head = NULL; tail = NULL; } int add(int num) { addTail(num); return index; } int get(int pos) { node* currnode = head; int count =0; while (currnode != NULL){ count++; if (count == pos){ return currnode -> element; }else{ currnode = currnode -> next; } } return -1; } int size() { return index; } void swap(int pos1, int pos2) { } // WARNING!…
Write a function called mymember? Which will take an object x and a list y, and return #t (true) If x is an element of y and #f (false) otherwise. Note that y may be a nested list, but x is only a member of y if x is one of the top-level elements. One can use the built in equal. Code in Racket. I really appreciate it thank you so much. I have been so stuck on this question for so long
write a function that add any item in a linked list after the item X, if the item X is not found in the linked list don't add the item. data structre please solve it fast less than 30 minute
Please answer it in Python Write a function min_odd that takes a list as an argument and returns the smallest even integer contained in the list. If the list contains no even integers, the function will return None. For Example : min_odd([45, 62, 19, 22, 26, 18, 3, 5, 14])Expected answer is 14 min_odd([])Expected answer is None Write a function index_of that takes as an argument an integer (supposedly even) and a list, and returns the index to which this integer appears in the list. If the integer does not appear, the function will return None. It is assumed here for simplicity that the integer searched for does not appear several times in the list. Hint: if the for e in list loop doesn't suit you, remember that you can make a for + range or a while. .. For Example: index_of(34, [3, 67, 62, 34, 19, 24])Expected answer is 3 index_of(16, [2, 6, 104, 5, 25, 18, 50, 16])Expected answer is 7
Please answer it in Python Write a function pairsbypairslist that would return pair by pair from the smallest value to the biggest value For example [12, 13, 11, 15], # return : (11, 12) and (13, 15) [9, 15, 4, 24, 19, 2] # return : (2,4) (9,15) (19,24) [1, 5, 9, 15, 21, 9, 12, 9], # return : (1,5) (9,9) (9,12) (15,21)
Write a function with the signature below that returns the sum of the last k elements of a singly linked list that contains integers. int returnSumOfLastKNodes(Node* head, int k) Example: 10 -> 5->8->15->11->9->23 10 represents the head node, returnSumOfLastKNodes(Node* head, 4) will return 58.
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 greater(a, b, c): if a > b: return c elif a > c: return b else: return a
Consider the following function:int enigma(NodeInt32* node){if(node == NULL)return 0; elsereturn 1 + enigma(node->next);} Which best describes the enigma function?A. The function performs a binary search of a list. B. The function computes the length of a list. C. The function sorts a list. D. None of the above.
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))
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].