Problem 1 Write a function count123: int list -> int *int int that takes in an int list 1 and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in 1. For example, count 123 [3; 4;2;1;3] = (1,1,2), and count123 [4; 4; 1; 2;1] = (2,1,0). In [] let count123 1 = (* YOUR CODE HERE *) In [ ]: assert (count123 [3; 4; 2;1;3] = (1,1,2))

Problem 1 Write a function count123: int list -> int int int that takes in an int list 1 and returns a 3-tuple of integers counting the number of 1's, 2's and 3's respectively in 1. For example, count 123 [3; 4;2;1;3] = (1,1,2), and count123 [4; 4; 1; 2;1] = (2,1,0). In [] let count123 1 = ( YOUR CODE HERE *) In [ ]: assert (count123 [3; 4; 2;1;3] = (1,1,2))

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

Suppose a node of a linked list is defined as follows in your program: typedef struct{ int data; struct Node* link; } Node; Write the definition of a function, printOdd(), which displays all the odd numbers of a linked list. What will be the time complexity of printOdd()? Express the time complexity in terms of Big-O notation.
Python Please Implement a function dedup(lst: list) -> list: that returns a de-duplicated version of the input list. Elements appear in the same order as the input list, but subsequences of equal elements are replaced by one representative. For example, dedup([]) = [], dedup([1, 1, 2, 1, 1]) = [1, 2, 1].
In Ocaml Write a function l3_of_3l : ’a list * ’b list * ’c list -> (’a * ’b * ’c) list = that transforms a triple of lists into lists of triples. If lengths don’t match then ignore leftover elements. examples l3_of_3l ([1;2;3] ,[1.;2.] ,[ ’ a ’; ’b ’; ’c ’; ’d ’]) ;;- : ( int * float * char ) list = [(1 , 1. , ’a ’) ; (2 , 2. ,’b ’) ]l3_of_3l ([1.;2.] ,[ ’ a ’; ’b ’; ’c ’; ’d ’] ,[1;2;3]) ;;- : ( float * char * int ) list = [(1. , ’a ’ , 1) ; (2. , ’b’ , 2) ]
Please answer it in Python Write a function extrait_pairs that takes as an argument a list l1 and returns the list obtained from l1 keeping only the even integers (and without changing their order). Be careful, l1 must not be modified by the function. Example: extrait_pairs([4, 7, 12, 0, 3]) is [4, 12, 0] and extrait_pairs([21, 17, 3]) is [ ].
In SML write a function posLL to count a number of positive values in an int list list. One function only. posLL[nil,[~2,3], [5], [~7,11]] > 3
Write a function Delete(x,L) in Pascal that deletes last occurrence of x in a singly linked list and returns the number of elements (not the elements*) before the deleted element x. MANDATORY FOR CODE TO BE IN PASCAL.
Please answer it in Python Write a function min_pair 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. Example: min_pairs([4, 7, 12, 0, 21, 5]) is 0 min_pairs([9, 3, 1]) is None. min_pair([16, 13, 10, 102, 7, 23]) is 10
(This question is for a linked list of the type described on the front page, Item 5). Write a recursive function CountGE60. that receives a linked list (may or may not be empty) and returns the number of nodes (each containing a data item value) greater than or equal to 60.
1. a function that takes in a list (L), and creates a copy of L. note: The function should return a pointer to the first element in the new L. [iteration and recursion]. 2. a function that takes in 2 sorted linked lists, and merges them into a single sorted list. note: This must be done in-place, and it must run in O(n+m).
Write a function cmid to count elements of an integer list between 5 and 10. One function only.cmid [12,3,6,4,5,1] → 2
List of triples or a triple of lists? Write a function l3_of_3l : ’a list * ’b list * ’c list -> (’a * ’b * ’c) list = that transforms a triple of lists into lists of triples. If lengths don’t match then ignore leftover elements. examples l3_of_3l ([1;2;3],[1.;2.],[’a’;’b’;’c’;’d’]);; - : (int * float * char) list = [(1, 1., ’a’); (2, 2., ’b’)] l3_of_3l ([1.;2.],[’a’;’b’;’c’;’d’],[1;2;3]);; - : (float * char * int) list = [(1., ’a’, 1); (2., ’b’, 2)]
Write a function split n l that splits the list l and returns a pairof lists containing the first n elements of l and the rest of l, wheresplit has the type int -> ’a list -> (’a list * ’a list). For ex-ample, split 3 [1,2,3,4,5] returns the pair ([1,2,3], [4,5]) andsplit 3 [1,2,3] returns ([1,2,3], []).