I have to write the following functions using SML. Write a function concat_with that takes a separator string and a list of strings, and returns the string that consists of all the strings in the list concatenated together, separated by the separator. The separator should be only between elements, not at the beginning or end. Use ML's - operator for concatenation (e.g., "hello" - "world" evaluates to "helloworld"). Sample solution is 5 lines.

I have to write the following functions using SML. Write a function concat_with that takes a separator string and a list of strings, and returns the string that consists of all the strings in the list concatenated together, separated by the separator. The separator should be only between elements, not at the beginning or end. Use ML's - operator for concatenation (e.g., "hello" - "world" evaluates to "helloworld"). Sample solution is 5 lines.

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

in F# (F sharp) Write an function findMatches that takes a string and a list of tuples as arguments. Each element of the list will be a tuple consisting of a string and an int. Find all of the tuples for which the string matches the first argument and collect all of the corresponding integers. Your final result should be the collected integers sorted in ascending order. For example, if the string argument is "A" and the list is [("A",5); ("BB",6); ("AA",9); ("A",0)], your function should return the list [0;5]. You may use the List.sort function to produce your final result.
In F# (F sharp) Write an function findMatches that takes a string and a list of tuples as arguments. Each element of the list will be a tuple consisting of a string and an int. Find all of the tuples for which the string matches the first argument and collect all of the corresponding integers. Your final result should be the collected integers sorted in ascending order. For example, if the string argument is "A" and the list is [("A",5); ("BB",6); ("AA",9); ("A",0)], your function should return the list [0;5]. You may use the List.sort function to produce your final result. Important: Do not use F# system functions or methods (such as map, max or filter, etc). Examples in F# Interactive: > findMatches "A" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = [0; 5]> findMatches "BB" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = [6]> findMatches "X" [("A",5); ("BB",6); ("AA",9); ("A",0)];;val it : int list = []> findMatches "A" [];;val it : int list = []…
Question 2: Write a function that takes a list of distinct integers l, and an integer k. Your function then finds the index of the integer in l, whose removal from l results in a list whose sum is k. For example, given [3,6,4,1,5,2] and 18, your function should return index 0, which corresponds to 3 in the list. Because, when 3 is removed from the list, the sum of the remaining list [6,4,1,5,2] is 18. You can assume that the given problem is always solvable. """ def removeOne(l, k):
Write a function in C++ "replaceVowels()" with no return value to replace all the vowels (A, E, I, O, U) from 8 randomly selected letters from the alphabet with a symbol from the list ($ % @ # &). That is, A must be replaced by $, E replaced by %, I must be replaced by @, O replaced by #, and U must be replaced by &. The function receives the address of the first characters of the password string as parameter. Display the password from the main() function. An Example Output is given in the following image.
Help writing an 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. 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.
In Kotlin A. Write a function lengthGreaterThan() with an expression body that takes a String s and an Int n and returns true if the String is at least n characters long. Then revise the function so that it can accept null values. If it receives null as the parameter, it should return false. B. Write a recursive function with an expression body that takes a list of nullable Strings and and Int an returns a list of just the Strings from the original list for which the function you wrote in the first part returns true C. Get the same result as in part B by using filter()
Write a function letter_count that accepts a string txt and returns a list containing the number of times that each letter of the alphabet occurs within txt. The returned list should contain the number of occurences of all twenty-six letters of the Latin alphabet, counting both upper and lower-case instances. For example, the string 'Abacus' contains two instances of the letter 'a', and so the first element of the returned list would be 2
Use clojure, define a function called remove-second that takes a list, and returns a new list that is the same as the input list, but with the second value removed. For example, given '(3 1 4), remove-second should return the list '(3 4).
In Kotlin, Write a recursive function called myZip, with an expression body. MyZip takes two Lists and returns a List of Pairs in which each value may be any type (I suggest your start by thinking out how to represent this data type). The pairs consist of corresponding elements in the two lists (the first element of the first list and the first element of the second list, etc). The base case should be that either (or both) of the original lists has length 1, so that, if the lists have different length, the zipping stops when the first list runs out of values.
Please answer in Python 1) Write a function towards which takes as an argument a list li (attention, not a word, unlike the other functions of this exercise) and which returns a list obtained from li by reversing the order of the elements. Example: towards(['a', 'b', 'c', 'd']) is ['d', 'c', 'b', 'a'] 2) Write a palindrome function that takes a word as an argument and returns a Boolean indicating whether the word is a palindrome. A palindrome is a word that remains the same when read from right to left instead of the usual order from left to right. Example: palindrome('here') is True but palindrome('go') is False.
Write a function that takes three lists of integers, l1, l2, and l3, and returnsa list of all tuples, where each tuple (a,b,c) is such that a is from l1, b is from l2 and c is from l3 and a+b=c. For example, given [1,2,3], [4,5] and [7,8]you should return [(2,5,7), (3,4,7), (3,5,8)]. The returned list must be sortedaccording to a and b, in ascending order.
Please answer it in Python Write a function insere_milieu that takes as an argument a list l and an element elem and returns the list obtained from l by adding elem "in the middle" of l, that is: If the length of l is even, the item is added once, in the middle of the list. If the length of l is odd: the element is added on either side of the central element. Example: insere_milieu([4, 7, 12, 3], 0) is [4, 7, 0, 12,3] insere_milieu([9, 3, 5, 6, 2], 1) is [9, 3, 1, 5, 1, 6, 2].