a list -> ’a list -> ’a list = that, given 2 lists, returns a third, containing elements of the first list that are not in the s
Q: You have to take sentence from the user and reverse it (not that the reversed array doesn’t contains…
A: #include<iostream> #include<string.h> #include<stdio.h> reverseArrayAnd OmitVowels…
Q: Note: the find_x function in this question is also used in the next question. Nodes in a…
A: Ans : Here is the declaration for the recursive function named find_x which searches the linked list…
Q: In C program. implement list_find( list_t* list, int targetElement ) function /* * dataStructure.h *…
A: The answer is given below.
Q: Let L is a list object of integers, write a recursive function that returns the sum of L items in…
A: Creating a function with array and number of elements as parameters. Below code will calculate the…
Q: In OCaml Programming Language: Use the built-in higher order functions and write a non-recursive…
A: Given: In OCaml Programming Language: Use the built-in higher order functions and write a…
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: You have been asked to write a function that supplies the "reverse lookup" name for the person…
A: 1) Below is the updated program to return name for the person associated with phone_num It defines…
Q: 2. Write a python program as function that displays a list Prog and returns a tuple of two list…
A: def fun(Prog): # user define function print("The list:", Prog) # display the…
Q: Write a function that takes in two ADT Lists, the function will be called Intercalate, it will…
A: Given: We are given a problem in which two arrays lists are given. A = [1,4,3,2]B = [3,9,0] Goal:…
Q: Write a function toSentence : string list -> string = that takes a string list and concatenates its…
A: Since no programming language is mentioned, I am using python. Code: def toSentence(stringList):…
Q: Listdiff Use the built-in higher order functions2 and write a non-recursive function val…
A: OCAML programming language Listdiff Use the built-in higher order functions2 and write a…
Q: Write a function that takes a nested list of integers and add up the elements from all of the nested…
A: For nested list, you can iterate over a list and then use sum function or you can iterate over that…
Q: In C program. Implement list_removeFront( list_t* list ) function. /* * dataStructure.h * * Provides…
A: Coded using C language.
Q: In loop_functions.py, define a function named list_concat that takes a single parameter li.This…
A: The main objective of the program, loop_functions.py is that the program concatenates the string…
Q: Develop an algorithm to calculate the average of the elements of a list x. Implement your algorithm…
A: Program Plan: Define calculateAverage() function that calculates the average of the list. Input the…
Q: rite a recursive function named sum that adds up all the elements in a list. For example: (sum '(4 5…
A: RACKET CODE: (define (sum ls) (cond [(empty? ls) 0] [else (+ (car ls) (sum (cdr ls)))] ))…
Q: primeFac (Perkovic, Problem 5.42) Write a function primeFac that computes the prime factorization of…
A: PROGRAM INTRODUCTION: Start the definition of the function to find the prime factors of the number…
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: Instructions are given within the quotations for each function. 1)def remove_duplicate_sorted(t):…
A: t = [1, 3, 5, 6, 3, 5, 6, 1] print ("The original list is : " + str(t)) res = [] [res.append(x)…
Q: Need help with sml languege I need to write a binarySearch function that recursively implements the…
A: 1) Linear Search #include <iostream> using namespace std; //i= starting, j=lenght of array, x=…
Q: in data structures write a function to rearrange the integer linked list such that odd items coming…
A: Create a class as Node and declare the member function. Define a function to rearrange the linked…
Q: ut name of new employee : Mike Menu : 1 . Print full list of employees 2 . Insert new employee 3 .…
A: code : #include <iostream>#include <string>using namespace std; class List{public:…
Q: Please answer it in Python Write a function convertir_liste that takes as an argument a list of…
A: Python Program: # Given list of stringsstringList = ['1', '12.3', '4.12'] # Display the given…
Q: Need help with standard ML languege I need to write a binarySearch function that recursively…
A: write a binarySearch function that recursively implements the binary search algorithm to search a…
Q: Write python function that will take list as parameter and will return sum of all elements in the…
A: HI THEREI AM ADDING PYTHON CODE AS PER YOUR REQUIREMENT BELOWPLEASE GO THROUGH IT THANK YOU
Q: Function Description Generate the code for a recursive function: furthest(n: int, lst: list)--> int…
A: I give the code in Python as per your requirement along with output and code screenshot
Q: • Create a function which takes a tuple and returns a dictionary which is a histogram to count how…
A: I solve the question give the code along with screenshot of output along with histogram.
Q: In C program. implement list_get( list_t* list, unsigned int position ) function /* *…
A: Coded using C language.
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: Below is the code for Priority Queue in C using arrays, the code has no errors but the display()…
A: #include <stdio.h>#include <stdbool.h>#define Size 20struct Queue{int PQData[Size];int…
Q: Let L be an integer list object. Write a function that reverses L without utilising any other data…
A: Introduction Use a stack data structure such that the elements that are inserted first are removed…
Q: Assume that L is a list of Boolean values, True and False. Write a program in python with a function…
A: #function that takes boolean list of values#then returns a tuple which contains start and end of…
Q: Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given…
A: I have given answer in step2
Q: Code the following in OCaml. EDIT: Write a function that looks for a pair on elements from two…
A:
Q: Write a function cmid to count elements of an integer list between 5 and 10. One function only. cmid…
A: #function cmid()def cmid(li): #set count variable to 0 count=0 #for each number in list li…
Q: Write a function maxGroup that determines, for a given integer list, the stored number of the…
A: l=list(map(int,input().split()))d={}for i in l: if i in d: d[i]+=1; else:…
Q: Code in python Use the fact that either the first element of a list is the largest or the largest…
A: Answer: Python Source Code 1: element_list = []element_size = int(input('Enter the element size: '))…
Q: Let L is a list object of integers, write a recursive function that returns the sum of L items…
A: Definition: Recursive function: It is a function which is used for calling of itself at the time of…
Q: Write the following recursive functions once for an array and once for simply linked list (as member…
A: Actually, array is a collection of elements.
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: Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given…
A: def Multiply2(mylist): if len(mylist) == 0: return [] return [mylist[0]*2] +…
Q: Need help with SML/ML/MPL I need to write binarySearch function that recursively implements the…
A: C++ code for Binary search tree #include <bits/stdc++.h>using namespace std; int…
Q: python wirte a function max_indexes(xs) that inserts a list xs with numbers and returns a list of…
A: PROGRAM: #Defining max_indexes() def max_indexes(xs): #Defining list to store the…
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: A- Declare a self-referential structure for a linked list having one data StudentNode field called…
A: Part A ) //structure for store student detail struct StudentNode { double GPA; //store the…
Q: Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Which of the below is true? (select two)…
A: Higher-order function foldr: (X Y --> Y) Y ListOfX --> Y Option A And Option C is TRUE.
Q: Python code Python Write a function named `freq(l)` that takes a list `l` of numbers and returns…
A: Here is the python3 code: See below step for code and output.
Q: 2. Write a program in 'C' language that implements a list using array. The elements of the list are…
A: Step 1:- Program Approach:- 1.Declare the array whose name is color 2.Initiliazie the array 3.Use…
Listdiff Use the built-in higher order functions2 and write a non-recursive function val listdiff : ’a list -> ’a list -> ’a list = that, given 2 lists, returns a third, containing elements of the first list that are not in the second list. # listdiff [1;2;2;6;3;9;1;4;6] [2;3];
Using OCaml
Step by step
Solved in 3 steps with 1 images
- Question > Not complete Marked out of 1.50 Flag question Previous page Write a recursive function named get_palindromes (words) that takes a list of words as a parameter. The function should return a list of all the palindromes in the list. The function returns an empty list if there are no palindromes in the list or if the list is empty. For example, if the list is ["racecar", "hello", "noon", "goodbye"], the function should return ["racecar", "noon"]. A palindrome is a word that is spelled the same forwards and backwards. Note: The get_palindromes() function has to be recursive; you are not allowed to use loops to solve this problem. For example: Test words = ["racecar", "hello", "noon", "goodbye", "test", 'aibohphobia'] ['racecar', 'noon', 'aibohphobia'] print (get_palindromes (words)) print (get_palindromes ([])) print (get_palindromes (['this', 'is', 'test'])) Answer: (penalty regime: 0, 0, 5, 10, 15, 20, 25, 30, 35, 40, 45, 50 %) Result Precheck Check [] [] Next pageOCAML programming language Listdiff Use the built-in higher order functions2 and write a non-recursive function val listdiff : 'a list -> 'a list -> 'a list = <fun> that, given 2 lists, returns a third, containing elements of the first list that are not in the second list. # listdiff [1;2;2;6;3;9;1;4;6] [2;3];;- : int list = [1; 6; 9; 1; 4; 6]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.2257988304
- Design a function that accepts a list of numbers as an argument. The function should recursively calculate the sum of all the numbers in the list and return that valemacs/lisp function Write a function in Lisp that takes one parameter which we can assume to be a list. The function should print all the elements of the list using the function princ and a space between them. Use the function mapc for this purpose.Show a few examples of testing this function. Show one example using the function apply and one using the function funcall.Algorithm Efficiency 1- Programming Problem Part 1 Write a function that will have a list as an input, the task of the function is to check if all the elements in the list are unique,( i.e. no repetition of any value has occurred in the list), then the function returns true otherwise it returns false. Your program should include a main method that call the method to test it. (If you would use built-in functions in Python, use lists’ or dictionaries’ methods as we studied their time efficiency in class) 2- Algorithm AnalysisFor the function you implemented in part 1, please calculate T(n), which represents the running time of your algorithm in terms of n. Where n is the length of the list. Then find the order of magnitude of your algorithm (Big O). 3- Algorithms Comparison Please find another algorithm that solves part 1, write the code, calculate T(n) and find Big O. Then compare the efficiency with the algorithm from part1 to determine the more efficient one.
- Computer Science In Racket, write a recursive function called "first-index" that returns only the first index of the specified element in a list. Ex : (first-index '1 '(3 5 1 4 5 2 1)) Would return 3 The function must take 2 arguments, the item you wish to find its index and a listemacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise. This said, a list generated by the function make-multiples could be passed to this new function and the result should be true. On the other hand, show an example of a list that could not have been generated by the first function for which the result is still true.two_sum is a Python function that takes in a list of integers (elements) and an integer number (num) and returns True if there exist two values in elements that add up to num, otherwise, function returns False. def two_sum(elements: List[int], num: int): for i in range(len(elements)): for j in range(i + 1): if elements[i] + elements[j] == num: return True return False Study above function and answer below questions: A. What is time complexity of two_sum? B. Is it possible to improve on above algorithm performance (in terms of its asymptotic cost)? If yes, describe your algorithm, be detailed as much as possible.
- Write the function splitList that takes the first argument list and splits it into two: a list of all the elements that are less than the head (the second argument), and a list of all the elements that are greater than or equal to the head (the third argument): listElementT splitList(listADT list, listADT* ItList, listADT* geList); Note that the head is returned by the function. a) Write this function as a recursive function. b) Write this function as a nonrecursive function.emacs/lisp function Write a function that takes one parameter that is a list of numbers and returns true (t) if all the elements of the list are multiples of the first one and nil otherwise.a- Write a Python function Salary_levels, that takes a list as an argument and returns the number of the high salaries (salary>=5000), the average salaries(1000<=salary<5000, and the low salaries (salary<1000). You can use the following list : salaries= [500,1070,1450,6500,9000,940,450,400,600,2750,1100,8400,1500,900,1200] b- Use the above function to print the counts of the high, average, and low salaries. N.B: the codes of parts a and b should be included in your answer.