Ocaml Explode list Write a function explode_list : string list -> char list = that given a string list it returns a character list of all exploded strings. The problem can be done linearly (O(n)). Avoid repeatedly using @ and similar list merges for maximum points. Examples explode_list ["ab";"cde";"f";"";"ghij"];; - : char list = [’a’; ’b’; ’c’; ’d’; ’e’; ’f’; ’g’; ’h ’; ’i’; ’j’]

Ocaml Explode list Write a function explode_list : string list -> char list = that given a string list it returns a character list of all exploded strings. The problem can be done linearly (O(n)). Avoid repeatedly using @ and similar list merges for maximum points. Examples explode_list ["ab";"cde";"f";"";"ghij"];; - : char list = [’a’; ’b’; ’c’; ’d’; ’e’; ’f’; ’g’; ’h ’; ’i’; ’j’]

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

Using C languge, implement programmer defined-data types with linked lists. A set of integers may be implemented using a linked list.Implement the following functions given the definition:typedef struct node* nodeptr;typedef struct node{int data;nodeptr next;}Node;typedef Node* Set;Set initialize();- simply initialize to NULLvoid display(Set s);- display on the screen all valid elements of the listSet add(Set s, elem);- simply store elem in the listint contains(Set s, int elem);- search the array elements for the value elemSet getUnion(Set result, Set s1, Set s2);- store in the set result the set resulting from the union of s1 and s2- x is an element of s1 union s2 if x is an element of s1 or x is an element of s2Set intersection(Set result, Set s1, Set s2);- store in the set result the set resulting from the intersection of s1 and s2- x is an element of s1 intersection s2 if x is an element of s1 and x is an element of s2Set difference(Set result, Set s1, Set s2);- store in the set…
C Language In a linear linked list, write a function named changeFirstAndLast that swaps the node at the end of the list and the node at the beginning of the list. The function will take a list as a parameter and return the updated list.
Linked list. Complete the function that takes as a parameter the head of a linked list and prints the linked list in reverse order. If the linked list had the contents: of,the,and,on,a,an,ok. Then the correct output would be: ok,an,a,on,and,the,of. Given: struct node { char word[31]; struct node *prev, next; }; void print_reverse(struct node *head) { }
C Language In a linear linked list, write a function that deletes the element in the middle of the list (free this memory location) (if the list has 100 or 101 elements, it will delete the 50th element). The function will take a list as a parameter and return the updated list.
Quesions in SML program Write a higher order function dup2 to double each element of an integer list as integer list list. dup2([2,3,5]) => [[2,2], [[3,3], [[5,5]. 2.What is order of fn: char => (char => char => char => char). Give detailed reasons.
Python Please Define a function max_run(lst: list) -> int to find the maximum run in a list. A run is a subsequence with identifical values. For example, in [1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4], the runs are [1, 1], [2, 2], [3], [4, 4, 4], [2], and [4, 4]. The longest run is [4, 4, 4], which has 3 elements. max_run([1, 1, 2, 2, 3, 4, 4, 4, 2, 4, 4]) should return 3. max_run([]) == 0, max_run([1, 2, 3]) = 1, and max_run([1, 2, 1, 1]) = 2.
Use the following code which adds and prints elements of a simply linked list, and add a member function that will duplicate nonzero value nodes in a list. Call your function properly in main and print the list again. #include <iostream> using namespace std; struct node { int data; node *next; node(int d,node*n=0) { data=d; next=n; } }; class list { node *head; public: list() { head=0; } void print() { for (node *t=head;t!=0;t=t->next) cout<<t->data<<" "; cout<<endl; } void add(int el) { head=new node(el,head); } }; void main() { list l; l.add(0); l.add(7); l.add(1); l.add(0); l.add(3); l.print(); }
struct node{int num;node *next, *before;};start 18 27 36 45 54 63 The above-linked list is made of nodes of the type struct ex. Your task is now to Write a complete function code to a. Find the sum of all the values of the node in the linked list. b. Print the values in the linked list in reverse order. Use a temporary pointer temp for a and b. i dont need a full code just the list part
The list method reverse reverses the elements in the list. Define a function named reverse that reverses the elements in its list argument (without using the inbuilt reverse() list method). Try to make this function as efficient as possible, and state its computational complexity using big-O notation. ----------------------------------------------------------------------------------- """ File: reverse.py Project 11.2 Defines a function to reverse the elements in a list. """ def reverse(lyst): # Define your reverse function here without using the inbuilt reverse() method. def main(): """Tests with two lists.""" lyst = list(range(4)) reverse(lyst) print(lyst) lyst = list(range(3)) reverse(lyst) print(lyst) if __name__ == "__main__": main()
In Ocaml Map functions left Write a function map_fun_left : (’a -> ’a) list -> ’a list -> ’a list = that is given a list of functions and a list of elements. For each element apply all functions from left to it and keep the result. Return the results as a list. examplesmap_fun_left [((+) 1) ;( * ) 2; fun x - >x -10] [1;2;3;4];;- : int list = [ -6; -4; -2; 0]map_fun_left [( fun x - > int_of_char x | > (+) 32 | >char_of_int ) ;( fun x - > char_of_int (( int_of_char x )+1) ) ] [ ’A ’; ’B ’; ’C ’; ’D ’];;- : char list = [ ’b ’; ’c ’; ’d ’; ’e ’]
C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and back of list ls.
Please fill in the blanks for C /* This program will print students’ information and remove students using linked list: */ #include<stdio.h> #include<stdlib.h> //Declare a struct student (node) with 5 members //each student node contains an ID, an age, graduation year, // 1 pointer points to the next student, and 1 pointer points to the previous student. struct student { int ID; int age; int classOf; __1__ __2__ next; __3__ __4__ prev; }; /* - This function takes the head pointer and iterates through the list to get all 3 integers needed from the user, and save it to our list - Update the pointer to point to the next node. */ __5__ scanLL(__6__ __7__ head) { while(__8__ __9__ __10__) //this condition makes sure the list is not at the end { printf("Lets fill in the information. Enter 3 integers for the student's ID, age, and graduation year: ");…