Write a function named all-unique in Scheme that takes a list as input and returns true if each item appears once only on the list and false otherwise. You may assume the list is flat (i.e., no nested lists). Hint: Consider writing a helper function contains that returns wither a list contains a given item. For example, (all-unique '(a b c 1 2)) should return true • (all-unique '(a b c 1 a)) should return false • (all-unique '()) should return true

Write a function named all-unique in Scheme that takes a list as input and returns true if each item appears once only on the list and false otherwise. You may assume the list is flat (i.e., no nested lists). Hint: Consider writing a helper function contains that returns wither a list contains a given item. For example, (all-unique '(a b c 1 2)) should return true • (all-unique '(a b c 1 a)) should return false • (all-unique '()) should return true

C++ for Engineers and Scientists

4th Edition

ISBN:9781133187844

Author:Bronson, Gary J.

Publisher:Bronson, Gary J.

Chapter5: Repetition Statements

Section5.5: A Closer Look: Loop Programming Techniques

Problem 12E: (Program) Write a program that tests the effectiveness of the rand() library function. Start by...

See similar textbooks

Similar questions

Implement the following functions in Scheme using the functions map and/or foldl. DO NOT use recursive definition for this problem. Define a function leq, which takes two lists of numbers (x1,x2,…,xn),(y1,y2,…,yn) and returns \#t if and only if x i≤y if or all 1≤i≤n. You can assume that the two lists have the same length.
Suppose you have a list of key/value pairs (i.e., a nested list where each element of the list is a (key value)pair. For example, the list might look like this: '((France Paris) (France Nice) (Spain Madrid) (Poland Krakow) (Poland Warsaw)) (Notice that the keys need not be unique for this problem.) Write a function named first-occurrence in Scheme that takes a key and a list then returns the value of the first item on the list with a matching key. Return '() if none of items on the list has a matching key. You must use either fold or reduce to do the vast majority of the work. You may use the built-in foldmethod by adding the line (require 'list-lib), or you can use your own implementation. The built-in fold function has parameters in this order: action partial-result lst. You may assume that the list contains an element with the key to be updated. For example, (first-occurrence 'Germany '((France Paris) (Germany Bonn) (Germany Berlin))) should return 'Bonn (first-occurrence 'Poland…
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.
Write a function removeN which takes three arguments called N, E and L (where L is a list) and returns a list equal to L but with the first N occurrences of E in that list removed. Note: only first N occurrences of E must be removed, not all occurrences! If there are less than N occurrences of E in the list, then all occurrences of E should be removed. Using scheme language Test Result (removeN 2 'a '(a b a c a d a)) (b c a d a) (removeN 4 'a '(a b a c a d a)) (b c d)
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.
Write a recursive Racket function "update-if" that takes two functions, f and g, and a list xs as parameters and evaluates to a list. f will be a function that takes one parameter and evaluates true or false. g will be a function that takes one parameter and evaluates to some output. The result of update-if should be a list of items such that if x is in xs and (f x) is true, then (g x) is in the list. The output list's elements should keep the input list's items in the same relative order. For example (update-if even? add1 '(1 2 3 4)) should evaluate to '(3 5) because 2 and 4 make even? true and add1 turns 2 and 4 into 3 and 5.
The "outer" list data structure of 2-dimensional lists can be matrix-like ( having same number of elements in each "inner" list or "row"), or it can be ragged (having different number of elements in each "row"). a) Write a Python function called raggs that takes a single argument that is a reference to a 2-d list, and returns the value True if the 2-d list is ragged, and False otherwise. b) Demonstrate that the function works for all relevant cases by inputting different example values.
Question 1 write a curried SML function, filter, that takes two arguments, a predicate ( a function that takes a single argument and returns a bool) and a list. Calling filter f L returns a list containing only those elements of L that satisfy f (that is, only those elements that f returns true for are in the resulting list). Calling filter with an empty list returns an empty list. List members should appear in the same order in the results as in L. Do not use explicit recursion Full explain this question and text typing work only thanks
Define a recursive function removeAll that expects an item and a Lisp-like list as arguments. This function returns a Lisp-like list with all of the instances of the item removed. In the lisplist.py file, make sure to include the insert() and equal() methods from Programming exercise 9.7 and Programming exercise 9.8. Hint: Keep on removing the item if it equals the list’s first item. Here is an example of its use: >>> lyst = cons(2, cons(2, (cons 3, THE_EMPTY_LIST))) >>> lyst (2 2 3) >>> removeAll(2, lyst) (3) >>> removeAll(3, lyst) (2 2) File: lisplist.py Project 9.9 Adds a removeAll function for Lisp lists. Add the insert() and equal() methods from Programming Exercise 9.7 and 9.8 """ class Node(object): """Represents a singly linked node.""" def __init__(self, data, next = None): self.data = data self.next = next def __repr__(self): """Returns the string representation of a nonempty lisp 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):
(a) Write a function top_students(marks) that takes as a parameter a non-empty list of (name, mark) tuples, where name is the name of a student (a string) and mark is the student's mark for some course (an int). The function returns a list of the names of all students whose mark equals that of the top student. If there is just a single student with the maximum mark, the return value will be a list of length 1, as in the first example in the table below. The names in the return list should be in the same order as in the input parameter list. Test Result marks = [('Beatrice', 50), ('Nerly', 90), ('Uniza', 70)] print(top_students(marks)) ['Nerly'] marks = [('Beatrice', 80), ('Nerly', 75), ('Uniza', 66), ('Joshua', 80)] print(top_students(marks)) ['Beatrice', 'Joshua'] (b) Write a function char_counts(string) that takes a string as a parameter and returns a dictionary in…
I need 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.