Code the following in OCaml. EDIT: Write a function that looks for a pair on elements from two integer lists that sum to a given value. Note: Only use recursion and lists. You may need a auxiliary or helper function. Write the following function sumOfTwo (a, b, v) that returns true if there exists an integer a list that when added to any integer in a different list, equals the sum. Signature: val sumOfTwo : int list * int list * int -> bool = Example output: # sumOfTwo([1;2;3],[10;20;30;40],42);; :bool = true (since 2 + 40 = 42) # sumOfTwo([1;2;3],[10;20;30;40],40);; :bool = false (nothing in list 1 can be added to list 2 to get 40)

Code the following in OCaml. EDIT: Write a function that looks for a pair on elements from two integer lists that sum to a given value. Note: Only use recursion and lists. You may need a auxiliary or helper function. Write the following function sumOfTwo (a, b, v) that returns true if there exists an integer a list that when added to any integer in a different list, equals the sum. Signature: val sumOfTwo : int list * int list * int -> bool = Example output: # sumOfTwo([1;2;3],[10;20;30;40],42);; :bool = true (since 2 + 40 = 42) # sumOfTwo([1;2;3],[10;20;30;40],40);; :bool = false (nothing in list 1 can be added to list 2 to get 40)

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 16PE

See similar textbooks

Similar questions

Write a function with below starting function: public static void printFirstAnd Last(ArrayList list) The approach should accomplish the following: Print "no elements" if the list is empty. Print the single element in the list if there is only one. Print the first entry in a list with more than one element, followed by a space, and then the last element.
In Python: Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed. It's ok if the list becomes empty after calling the function.
Old MathJax webview Old MathJax webview In Java Some methods of the singly linked list listed below can be implemented efficiently (in different respects) (as opposed to an array or a doubly linked list), others not necessarily which are they and why? b. Implement a function to add an element before the first element. c. Implement a function to add an item after the last one element. d. Implement a function to output an element of the list. e. Implement a function to output the entire list. f. Implement a function to output the number of elements. G. Implement a function to delete an item. H. Implement a function to clear the entire list. I. Implement functionality to search for one or more students by first name, last name, matriculation number or course of study. J. Implement functionality to sort the records of the student, matriculation number and course according to two self-selected sorting methods.
Write a recursive function named Multiply2 that multiples by 2 and prints each element in a given list. For example: mylist=[1,2,3,4] Multiply2(mylist) prints: 2 4 6 8 Note: the function takes only one parameter, which is the list on which the operation will be performed.
Recursive Max! Write a recursive function rc_max(L:List[int]) -> int that takes a list L and returns an element with highest value in the list. For example, rc_max([1,2,3]) returns 3. Note that L is not necessarily sorted. You may assume that the input L is not empty. You cannot use the built-in max() Your Answer: 1 # Put your answer here 2 Submit
* allSame returns true if all of the elements in list have the same value. * allSame returns false if any two elements in list have different values. * The array may be empty and it may contain duplicate values. * * Your solution should contain at most one loop. You may not use recursion. * Your solution must not call any other functions. * Here are some examples (using "==" informally): * * * * * * * * true == allSame (new double[] { }) true == allSame(new double[] {11}) true == allSame (new double[] { 11, 11, 11, 11 }) false == allSame(new double[] { 11, 11, 11, 22 }) false == allSame (new double[] { 11, 11, 22, 11 }) true == allSame (new double[] { 22, 22, 22, 22 }) * */ public static boolean allSame (double[] list) { return StdRandom.bernoulli(); //TODO: fix this
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
Recursive Count Write a recursive function rc_count(L:List[int], x:int) -> int that takes a list L and an integer x. The function returns the number of occurrences of x in L. For example, rc_count([1,1,2,3], 1) returns 2 and rc_count([1,1,2,3], 4) returns 0. Your Answer: 1 # Put your answer here 2 Submit
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.
C++ ONLY Add the following functions to the linked list. int getSize() -> This function will return the number of elements in the linked-list. This function should work in O(1). For this keep track of a size variable and update it when we insert a new value in the linked-list. int getValue(index) -> This function will return the value present in the input index. If the index is greater or equal to the size of the linked-list return -1. void printReverse() -> This function will print the linked list in reverse order. You don’t need to reverse the linked list. Just need to print it in reverse order. You need to do this recursively. You cannot just take the elements in an array or vector and then print them in reverse order. void swapFirst() -> This function will swap the first two nodes in the linked list. If the linked-list contains less than 2 elements then just do nothing and return. To check your code add the following code in your main function. LinkedList l;…
Write a function that accepts two lists as it's only arguments. The function should return a new list containing all the elements of the two list arguments. For example, if the function was passed the lists [1, 2, 3] and [4, 5, 6], it would return a new list containing [1, 2, 3, 4, 5, 6]
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 list