The function select takes a predicate and two lists as arguments and returns a list composed of elements from the second list in those positions where the predicate, when applied to the element in the corresponding positions of the first list, returns True. * Main> :t select select :: (t -> Bool) -> [t] -> [a] -> [a] *Main> select even [1..26] "abcdefghijklmnopqrstuvwxyz" "bdfhjlnprtvxz" *Main> select (<= 'g') "abcdefghijklmnopqrstuvwxyz" [1..26] [1,2,3,4,5,6,7] Write select using list comprehensions.
Q: Write a function high_low_dict(numbers, sep) that takes a list of numbers and an int sep that will…
A: Note: The problem solved in JAVA. ALGORITHM: -> take a ArrayList to add elements and an int type…
Q: Identify the output execution of print() function in main?
A: Given list L1 is initialized as 23->32->21->12 print() function not returning anything but…
Q: In the C++ code for a queue, when you insert an item, which do you do first: insert the item,…
A: Queue is a data structure where it follows FIFO approach where the element that was inserted first…
Q: Write a function double lastValue(ListNode *ptr) that returns the value stored in the last node of a…
A: LinkedList A LinkedList is a special data structure where elements are store at noncontiguous…
Q: 5. Define a function in PHP language that takes a sorted list as the parameter and returns a list…
A: Answer: I have done code and also I have attached code and code screenshot as well as output
Q: Problem 13 Vrite a function that takes a list and computes the alternating sum of all its elements.…
A: PROGRAM CODING: #include<iostream.h>using namespace std; int alternate_sum(int ar[], int size)…
Q: Prime number separation write a function (in OCaml) val prime_separator : int list -> int list *…
A: Prime number separation write a function (in OCaml) val prime_separator : int list -> int list *…
Q: Write a function to be included in an unsorted doubly linked list class, called deleteLast, that…
A: A doubly linked list is one where all nodes are connected by a large number of links, allowing…
Q: 6. Write a program that creates a list-returned function to display a lists contains all but the…
A: The program is written in Python. Check the program screenshot for the indentation. Please check…
Q: C function takes a simply-linked list as an input argument. It modifies the list by moving the last…
A: Lets see the solution.
Q: woid funX (struct Node n) if (n--NULL) return printf ("id ",n->data) funX (n->next) What is the aim…
A: Recursion is a process of function calling same function
Q: Write a function called check_third_element that takes in a list of tuples, lst_tups as a parameter.…
A: Please find thee answer below :
Q: You are given pointers to first and last nodes of a singly linked list, which of the following…
A: Linked list is a dynamic memory allocation technique to store values.
Q: OCAML programming Prime number separation Write a function val prime_separator : int list -> int…
A: Write a function val prime_separator : int list -> int list * int list = <fun> that takes…
Q: Complete the function that takes as a parameter the head of a linked list and prints the linked list…
A: To print the linked list in-reverse order we can use recursion method. The recursive implementation…
Q: Define a function compress which takes in a list and eliminates all consecutive duplicate elements.…
A: Note : Answering the question in python as no programming language is mentioned. Input : Data…
Q: Write a program that implements the doubly linked list clearly explain the steps for the following…
A: ALGORITHMS:- 1. Declare a empty double linked list. 2. Insert 4 elements in it. Insertion would be…
Q: 1. a function that takes in a list (L), and creates a copy of L. note: The function should return a…
A: As per our guidelines, we are supposed to answer only one question. Kindly repost the remaining…
Q: 8.14 LAB: Mileage tracker for a runner Given the MileageTrackerNode class, complete main() to…
A: Actually, program is a executable software that runs on computer.
Q: Prime number separation Write a function val prime_separator : int list -> int list + int list =…
A: Given:
Q: Write a function that changes the places of the first and second nodes of a linked list. I.e. the…
A: Purpose: In this we will have the linked list of two nodes where the first node have to point the…
Q: 2. Write a function with the following signature: bool findElement(node *&list, int value) The…
A: Input: Search key Output : Return true if element present otherwise return false step1: Initialize…
Q: 3 Listdiff Use the built-in higher order functions² and write a non-recursive function val listdiff…
A: OCAML programming : a general purpose programming language with an importance on expressiveness. It…
Q: A dummy-headed circular singly-linked list has been created and holds a list of integer…
A: A circular linked list can be denoted as a data structure that is used to store values in the form…
Q: Write a function "finalGrade" that takes a list "classList" which contains a sublist for each…
A: Here, we are operating on Lists and Tuples are immutable and cannot be inserted or appended. So, do…
Q: in C++ kth Element Extend the class linkedListType by adding the following operations: a. Write a…
A: (A) In this function, Initially, we declare a node called random and set it equal to the head of…
Q: 8.17 LAB: Inventory (linked lists: insert at the front of a list) C++ Given main(), define an…
A: Actually, the code has given below:
Q: Write a function wordfreg(s) that returns a list of the number of occurences of each word in s. Each…
A: Here I have defined the function named wordfreq(). Inside the function, I have converted the string…
Q: Exercise 8 (Multiple Choice). Let X be inductively defined as the smallest set of finite number…
A: [1,1,1,1] This is in X. We know that we have [1] in X From that we know we have [1,1] in X, because…
Q: 5. The following function indexCounter aims to find and return all the indices of the element x in a…
A: def indexCounter(L, x): indexList = [] startIndex = 0 while startIndex < len(L):…
Q: Given the MileageTrackerNode class, complete main() to insert nodes into a linked list (using the…
A: Main.cpp #include "MileageTrackerNode.h"#include <string>#include <iostream>using…
Q: 1. Write a function to search and return the node, in a single linked list, having a given value v…
A: Code :- #include <iostream> using namespace std; class LinkedList{ // linked list class…
Q: Write a recursive function sumlist(my_list) to calculate the sum of the numbers in a list my_list…
A: #recursive function to find and return sum of numbers in the listdef sumlist(my_list): if…
Q: 2-) In a double linked list, the structure of a node is defined as follows: struct node { int…
A: ANSWER:-
Q: Q.2 Write a program that uses a circular linked list to simulate the sequence of execution directly.…
A: c program to implement circular linked list to simulate the sequence of execution directly using…
Q: Please write it in Python Write a delete function that takes as an argument a list l and an elem…
A: Python Code: def delete( l, x ): l.remove(x) return x Explaination : Define a function…
Q: Question The following function is supposed to reverse a singly-linked list. Fill in the blanks.…
A: Singly linked list: Linked list is a collection of data and it is linear data structure and it's…
Q: Add the following functions and write a program using c++ to test these functions in the class…
A: #ifndef H_UnorderedLinkedList#define H_UnorderedLinkedList #include "linkedList.h"using namespace…
Q: 2. Assume, there is a doubly linked list. And *HEAD is the head-node of a doubly linked list (dll).…
A: Doubly Linked List Doubly linked list is a type of data structure that is made up of nodes that are…
Q: Code the following in OCaml. EDIT: Write a function that looks for a pair on elements from two…
A:
Q: Complete the examples in the docstring and then write the body of the following function: def…
A: def same_first_last(L):""" (list) -> boolPrecondition: len(L) >= 2Return True if and only if…
Q: 3. What does the following function do for a given Linked List with first node as head? void…
A: Linked list contains two parts i.e data part and address part. Each address part is linked with…
Q: write the following program using simply linked list in C++ language Add definition of the…
A: Since you have posted a question with multiple sub-parts, we will solve the first three sub-parts…
Q: C++ Create a generic function add_bookends(ls, e) that adds a copy of element e to the front and…
A: #include <iostream>#include <list>using namespace std;// template function to put…
Q: Question 6 Linked Lists lend themselves easily to recursilve solutions. and it is common to traverse…
A: Find the answer with reason given as below :
Q: Complete the below function that takes two lists, constructs tuples with one element from each list…
A: PROGRAM: #Defining list_product def list_product(list1, list2): #Local list list3 = []…
Q: Define a function max_run(lst: list) -> int to find the maximum run in a list. A run is a…
A: Use a list to store the consecutive occurrences and then finally return max of that list
Q: write the following program using simply linked list in C++ language Add definition of the…
A: Since you have posted a question with multiple sub-parts, we will solve the first three sub-parts…
Please answer this question in haskell
Step by step
Solved in 2 steps
- Exercise, maxCylinderVolume F# system function such as min or methods in the list module such as List.map are not allowed Write a function maxCylinderVolume that takes a list of floating-point tuples that represent dimensions of a cylinder and returns the volume of the cylinder that has the largest volume. Each tuple has two floating point values that are both greater than zero. The first value is the radius r and the second value is the height h. The volume of the cylinder is computed using ??2h. The value π is represented in F# with System.Math.PI. If the list is empty, return 0.0. Examples: > maxCylinderVolume [(2.1, 3.4); (4.7, 2.8); (0.9, 6.1); (3.2, 5.4)];;val it : float = 194.3137888> maxCylinderVolume [(0.33, 0.66)];;val it : float = 0.2257988304struct Node { int data; Node * next; }; Node • head; a. Write a function named addNode that takes in a variable of type int and inserts it at the head of the list. b. Write a function named removeNode that removes a node at the head of the list.struct insert_at_back_of_sll { // Function takes a constant Book as a parameter, inserts that book at the // back of a singly linked list, and returns nothing. void operator()(const Book& book) { /// TO-DO (3) /// // Write the lines of code to insert "book" at the back of "my_sll". Since // the SLL has no size() function and no tail pointer, you must walk the // list looking for the last node. // // HINT: Do not attempt to insert after "my_sll.end()". // ///// END-T0-DO (3) ||||// } std::forward_list& my_sll; };
- Suppose a node of a doubly linked list is defined as follows: struct Node{ int data; struct Node* next; struct Node* prev; }; Write the function definition of the function deleteElement as presented below. This function deletes a node at position n from a doubly linked list. struct Node* deleteElement(struct Node* head, int n){ //write the function definition }Q3 Racket Number Function Suppose that into the Racket evaluator we enter the definition: (define dozen 12) Give the value of the Racket expression: (number? dozen). Note that the value should be consistent with the Racket language. Enter your answer here Save Answer Q4 Racket Empty Lists Give two ways to write a Racket expression of which the value is a one-element list with the empty list as its element. Enter your answer here Save AnswerComputer Science //iterator() creates a new Iterator over this list. It will//initially be referring to the first value in the list, unless the//list is empty, in which case it will be considered both "past start"//and "past end". template <typename ValueType>typename DoublyLinkedList<ValueType>::Iterator DoublyLinkedList<ValueType>::iterator(){//return iterator(head);} //constIterator() creates a new ConstIterator over this list. It will//initially be referring to the first value in the list, unless the//list is empty, in which case it will be considered both "past start"//and "past end". template <typename ValueType>typename DoublyLinkedList<ValueType>::ConstIterator DoublyLinkedList<ValueType>::constIterator() const{//return constIterator(head);} //Initializes a newly-constructed IteratorBase to operate on//the given list. It will initially be referring to the first//value in the list, unless the list is empty, in which case//it will be…
- Function 1: draw_subregion Complete the implementation of draw_subregion. This function has the following parameters: my_turtle: A turtle object (which will do the drawing) polygon_points: A list of (x, y) points (i.e. a list of tuples) that defines the points of a polygon. This function should make the turtle draw the polygon given by the points. Make sure that you lift your pen before heading to the first point. You should also make sure you return to the very first point at the end (i.e. you will go to the first point in the list two times: once at the beginning, and once at the end). Language PythonA- Declare a self-referential structure StudentNode for a linked list having one data field called GPA (float), and one pointer to StudentNode called next. B- Write a non-recursive function that prints all the GPAS that are less than or equal to 2 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should print: 1.9->2->1.8. C- Write a recursive function that counts all the GPAS that are higher or equal to 3.5 in your linked list starting from the head of the list. Example: If the list is 1.9->2->3.5->4->1.8, the function should return 2.HELP Write C code that implements a soccer team as a linked list. 1. Each node in the linkedlist should be a member of the team and should contain the following information: What position they play whether they are the captain or not Their pay 2. Write a function that adds a new members to this linkedlist at the end of the list.
- Q-No.4: Add the following functions and write a program to test these functions in the class linkedListType: a. Write the definition of a function that returns the data of the kth element of the linked list. If such element is not exist in the list, exit the program. b. Write the definition of a function that deletes the kth element of the linked list. If such element is not exist in the list, exit the program and display message as output.Prime number separation write a function (in OCaml) val prime_separator : int list -> int list * int list = that takes an integer list as an input, and returns a pair of integer lists where the prime numbers are in the first while the composite numbers are in the second returned list. #prime_separator [1; 2; 3; 4; 5; 6; 7; 8; 9; 10; 11];; - : int list * int list = ([11; 7; 5; 3; 2], [10; 9; 8; 6; 4; 1])11. deep-reverse Define a function similar to the built-in reverse function, except that it acts recursively, reversing the order the members of any nested sublists. You may not use the built-in reverse function as a helper function. However, you may use your own my-reverse function as a helper function. Input: A single list which may contain an arbitrary number of elements and sublists, each sublists may also contain an arbitrary number of elements and sublists, nested to an any depth. Output: A new list which contains all elements in reverse order, as well as recursively reverse order all members of sublists. Example: > (deep-reverse (((4 3) 6) ((7 2 9) (5 1)))) '(((15) (9 2 7)) (6 (34))) > (deep-reverse ((1 2) 3)) (3 (21)) > (deep-reverse '((4 5))) '((5 4)) > (deep-reverse (3 6 9 12)) (12 963)