Given both a list x and a tuple y, write a function called sum_list_andOr_tuple that sums all the elements of both data structures and returns the sum. There is also an optional boolean argument into the function called separate which, if True, causes the function to return the sum of the list and the tuple separately (returns two values); separate is False by default. Please note that the function DOES NOT print anything - it only returns a value(s). See the sample output below: >>> my_list = [0, 9, 99] >>> my_tuple = (8, 12) >>> result = sum_list_andOr_tuple(my_list, my_tuple) >>> print(result) Output: 128 >>> result = sum_list_andOr_tuple(my_list, my_tuple, separate = True) >>> print(result) Output: 108, 20

Given both a list x and a tuple y, write a function called sum_list_andOr_tuple that sums all the elements of both data structures and returns the sum. There is also an optional boolean argument into the function called separate which, if True, causes the function to return the sum of the list and the tuple separately (returns two values); separate is False by default. Please note that the function DOES NOT print anything - it only returns a value(s). See the sample output below: >>> my_list = [0, 9, 99] >>> my_tuple = (8, 12) >>> result = sum_list_andOr_tuple(my_list, my_tuple) >>> print(result) Output: 128 >>> result = sum_list_andOr_tuple(my_list, my_tuple, separate = True) >>> print(result) Output: 108, 20

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

Use the Design Recipe to write a function, count_odds, that consumes a list and two integers, lower_bound and upper_bound, and returns the number of all the odd integers in the list that are between lower_bound and upper_bound (inclusive of both lower_bound and upper_bound). Include a docstring!
4. Modify the bracketsBalance function so that the caller can supply the brackets to match as arguments to this function. The second argument should be a list of beginning brackets, and the third argument should be a list of ending brackets. The pairs of brackets at each position in the two lists should match; that is, position 0 in the two lists might have [ and], respectively. You should be able to modify the code for the function so that it does not reference literal bracket symbols, but just uses the list arguments. (Hint: The method index returns the position of an item in a list.) the bracketsBalance function: def bracketsBalance(exp):"""exp is a string that represents the expression""" stk = LinkedStack() for ch in exp: if ch in [’[’, ’(’]: stk.push(ch) elif ch in [’]’, ’)’]: if stk.isEmpty(): # Create a new stack # Scan across the expression # Push an opening bracket # Process a closing bracket# Not balanced return FalsechFromStack = stk.pop()# Brackets must be of…
The following C function takes a single-linked list of integers as a parameter and rearranges the elements of the list. The function is called with the list containing the integers 1, 2, 3, 4, 5, 6, 7 in the given order. What will be the contents of the list after the function completes execution? struct node { int value; struct node *next; }; void rearrange(struct node *list) { struct node *p, * q; int temp; if ((!list) || !list->next) return; p = list; q = list->next; while(q) { temp = p->value; p->value = q->value; q->value = temp; p = q->next; q = p?p->next:0; } } a) 1, 2, 3, 4, 5, 6, 7b) 2, 1, 4, 3, 6, 5, 7c) 1, 3, 2, 5, 4, 7, 6d) 2, 3, 4, 5, 6, 7, 1
Remember to include the docstring, and explain it step by step. Write a function named square_list that takes as a parameter a list of numbers and replaces each value with the square of that value. It should not return anything - it should mutate the original list. Your function could be used like this: nums = [4, -5, 13, 8] square_list(nums) print(nums) # This should print [16, 25, 169, 64]
Write a function that concatenates all the strings in a list. The concatenation of all the strings in an empty list is the empty string "". please use Ocaml for the code and make sure the code is complete
1) Write a function that takes one argument, a list named sample-list. 2 ) If the length of the sample-list is > 8, then use the last element of sample-list and return it in a list. 3) If the length of sample-list is <= 8 and > 4, then return the first elements of sample-list in a list. 4) Otherwise, return the string “This is the third option.”. Please make sure to test your function!!! and explain your code shortly by adding comments to each line.
The function list_combination takes two lists as arguments, list_one and list_two. Return from the function the combination of both lists - that is, a single list such that it alternately takes elements from both lists starting from list_one. You can assume that both list_one and list_two will be of equal lengths. As an example if list_one = [1,3,5] and if list_two = [2,4,6]. The function must return [1,2,3,4,5,6].
In pyton: In this lab, you will be building a software application that removes duplicate values from a list.The purpose of the assignment isto gain experience with user-defined functions, forloop and listmanipulation. Start Start of remove duplicate function (numbers: list of numbers) Initialize an empty list as new_list Loop over each of the number of the numbers list If number not in new_list Append number to new_list Return new_list End of remove duplicate functionStart main function Prompt user for list of numbers Call remove duplicate function Print the new list returned by the remove function End of main functionEnd
In scheme Write a function removeN which takes three arguments called N, E and L (where L is a list) and returns a list equal to L but with the first N occurrences of E in that list removed. Note: only first N occurrences of E must be removed, not all occurrences! If there are less than N occurrences of E in the list, then all occurrences of E should be removed. Test Result (removeN 2 'a '(a b a c a d a)) (b c a d a) (removeN 4 'a '(a b a c a d a)) (b c d)
Write a function named how_many(a_list, a_num) that that expects a list of numbersand a number as arguments. It returns how many times the number is found in the list.If the number is not in the list, return 0. For examplehow_many( [12, 15, 16, 4, 10, 3, 5, 7, 9, 15], 15 )returns 2 And how_many( [12, 15, 16, 4, 10, 3, 5, 7, 9, 15], 11 )returns 0Ask the user for an integer between 0 and 19. If the number is in the list, report howmany times it occurs.
program by using C language In the struct structure given below, the data of a student is stored in a singly linear linked list. Write a function named "secondHighest" that takes the starting address of the list as a parameter and returns the student number with the second highest grade? typedef struct node { int OgrNo; int not; struct node *next; };
Complete the below function which takes a list of distinct positive integers and a target positive integer value, and then returns a list of the pairs of integers where each pair sums up to the target value. Each pair is represented as a tuple. For example, pairsum([3,2,6,1,5,4], 7) should return[(1,6), (2,5), (3,4)]If there are no pairs matching the target value, then you should return an empty list. IMPORTANT: the first integer in a tuple must be always smaller than the second integer. So, (5,3) is wrong and (3,5) is correct, and the resulting list must be in ascending order of first element in each tuple.