OCAML Code please, thank you! Problem 3In [ ]:Write a functionbuckets : ('a -> 'a -> bool) -> 'a list -> 'a list listthat partitions a list into equivalence classes. That is, buckets equiv 1st should return a list of lists where each sublist in the result contains equivalentelements, where two elements are considered equivalent if equiv returns true. For example:buckets (=) [1; 2; 3; 4] = [[1]; [2] ; [3]; [4]]buckets (=) [1; 2; 3; 4; 2; 3; 4; 3; 4]buckets (fun x y -> (=) (x mod 3)[[1;4]; [2;5]; [3; 6]]The order of the buckets must reflect the order in which the elements appear in the original list. For example, the output of buckets (=) [1;2;3;4]should be [[1] ; [2] ; [3] ; [4]] and not [[2]; [¹]; [3]; [4]] or any other permutation.=The order of the elements in each bucket must reflect the order in which the elements appear in the original list. For example, the output of buckets (fun xy -> (=) (x mod 3) (y mod 3)) [1; 2; 3; 4; 5; 6] should be [[1;4]; [2;5]; [3;6]] and not [[4;1]; [5;2]; [3;6]] or any otherpermutations.Just use lists. Do not use sets or hash tables.[[1]; [2; 2]; [3; 3; 3]; [4; 4;4]](y mod 3)) [1; 2; 3; 4; 5; 6]Assume that the comparison function ('a -> 'a -> bool) is commutative, associative and idempotent.In [] let buckets p 1 =List append function @ may come in handy. [1;2;3] @ [4;5;6](* YOUR CODE HERE *)assert (buckets (=) [1; 2; 3; 4] [[¹]; [2] ; [3]; [4]]);assert (buckets (=) [1; 2; 3; 4; 2; 3; 4; 3; 4]assert (buckets (fun x y -> (=) (x mod 3)==[1; 2; 3; 4; 5; 6].[[1]; [2; 2]; [3; 3; 3]; [4; 4; 4]]);(y mod 3)) [1; 2; 3; 4; 5; 6]=[[1;4]; [2;5]; [3; 6]])

Answered: Image /qna-images/answer/39c678fc-ef2d-47d5-9a63-f8356e399080.jpg

Problem 3 Write a function buckets ('a -> 'a -> bool) -> 'a list -> 'a list list. that partitions a list into equivalence classes. That is, buckets equiv 1st should return a list of lists where each sublist in the result contains equivalent elements, where two elements are considered equivalent if equiv returns true. For example: buckets () [1;2;3;4] = [[1]; [2] ; [3]; [4]] buckets (=) [1; 2; 3; 4; 2; 3; 4;3;4] = buckets (fun x y-> (=) (x mod 3) [[1]; [2; 2]; [3; 3; 3]; [4; 4;4]] (y mod 3)) [1; 2; 3; 4; 5; 6] = [[1;4]; [2;5]; [3; 6]] The order of the buckets must reflect the order in which the elements appear in the original list. For example, the output of buckets (=) [1;2;3;4] should be [[1]; [2] ; [3]; [4]] and not [[2] ; [1]; [3]; [4]] or any other permutation. The order of the elements in each bucket must reflect the order in which the elements appear in the original list. For example, the output of buckets (fun x y-> (=) (x mod 3) (y mod 3)) [1; 2; 3; 4; 5; 6] should be [[1;4]; [2;5]; [3;6]] and not [[4;1]; [5;2]; [3; 6]] or any other

Problem 3 Write a function buckets ('a -> 'a -> bool) -> 'a list -> 'a list list. that partitions a list into equivalence classes. That is, buckets equiv 1st should return a list of lists where each sublist in the result contains equivalent elements, where two elements are considered equivalent if equiv returns true. For example: buckets () [1;2;3;4] = [[1]; [2] ; [3]; [4]] buckets (=) [1; 2; 3; 4; 2; 3; 4;3;4] = buckets (fun x y-> (=) (x mod 3) [[1]; [2; 2]; [3; 3; 3]; [4; 4;4]] (y mod 3)) [1; 2; 3; 4; 5; 6] = [[1;4]; [2;5]; [3; 6]] The order of the buckets must reflect the order in which the elements appear in the original list. For example, the output of buckets (=) [1;2;3;4] should be [[1]; [2] ; [3]; [4]] and not [[2] ; [1]; [3]; [4]] or any other permutation. The order of the elements in each bucket must reflect the order in which the elements appear in the original list. For example, the output of buckets (fun x y-> (=) (x mod 3) (y mod 3)) [1; 2; 3; 4; 5; 6] should be [[1;4]; [2;5]; [3;6]] and not [[4;1]; [5;2]; [3; 6]] or any other

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 18SA

See similar textbooks

Similar questions

Suppose you have two objects of Doubly Linked List D1 and D2. Each object is representing a different Doubly Linked List. Write a function to concatenate both doubly linked lists. The concatenation function must return the address of head node of concatenated Doubly Linked List, and it must take two Node* parameters. You need to keep in mind all exceptional cases for example what if either one of the doubly linked lists is empty? Perform this task on paper, take a clear picture of solution and paste it in answer section.
Suppose a node of a linked list is defined as follows in your program: typedef struct{ char data; struct Node* link; } Node; Write the definitions of two functions (i) Node* pop(Node* top) – which removes the top element of the stack, and (ii) bool compare(Node* topA, Node* topB) - which returns true if the both stacks have identical data. The function returns false if the data in both stacks are not identical. In the function definitions, top, topA, and topB point the top elements of corresponding stacks. You must use the following function definitions in your answer. The peek function has already been defined. You need to write the definition of pop and compare functions. You are not allowed to modify the parameters and/or return types of the functions. Node* pop(Node* top){ //write the function definition } char peek(Node* top){ return top->data; } bool compare(Node* topA, Node* topB){ //write the function definition } Write the time complexity in Big-O notation…
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…
C++ program for the following please: Create a generic function print(ls, n) that prints to standardoutput the first n elements of list ls. The elements are printed on separatelines. If ls has less than n elements, then the entire list is printed
Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that anode of doubly linked list has previous pointer as prev and next pointer as next.void fun(struct node **head_ref){struct node *temp = NULL;struct node *current = *head_ref;while (current != NULL){temp = current->prev;current->prev = current->next;current->next = temp;current = current->prev;}if(temp != NULL )*head_ref = temp->prev;}Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call? Note: solve as soon as possible
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.
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 [ ].
1. Suppose you have already developed an SLL ADT. You have to search a specificelement of the linked list. If you find the element in the list then you have to swapits previous node with its next node. Otherwise, simply print the message “Datanot found”. Now write a function in your SLL ADT with this functionality.
in C++ kth ElementExtend the class linkedListType by adding the following operations:a. Write a function that returns the info of the kth element of the linked list. If no such element exists, terminate the program.b. Write a function that deletes the kth element of the linked list. If no such element exists, terminate the program. Provide the deﬁnitions of these functions in the class linkedListType. please, do not copy from any other sources, give me a fresh new code. Thank you
Write a void function that takes a linked list of integers and removes all the duplicate elements from the list. The function will have one call-by-reference parameter that is a pointer to the head of the list. After the function is called, this pointer will point to the head of a linked list that has the nodes that have all the distinct integers. Place your function in a suitable test program.
C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and back of list ls.