Write a function named split-list in Scheme that takes a list and a length as input and returns two lists: (1) The first length elements of the input list, and (2) the remainder of the input list. Hint: Use a helper method with an "accumulator" parameter. For example, • (split-list '(a b c d e f g) 0) should return '(() (a b c d e f g)) • (split-list '(a b c d e f g) 1) should return '((a) (b c d e f g)) (split-list '(a b c d e f g) 3) should return '((a b c) (d e f g)) (split-list '(a b c d e f g) 7) should return '((a b c d e f g) ())

Write a function named split-list in Scheme that takes a list and a length as input and returns two lists: (1) The first length elements of the input list, and (2) the remainder of the input list. Hint: Use a helper method with an "accumulator" parameter. For example, • (split-list '(a b c d e f g) 0) should return '(() (a b c d e f g)) • (split-list '(a b c d e f g) 1) should return '((a) (b c d e f g)) (split-list '(a b c d e f g) 3) should return '((a b c) (d e f g)) (split-list '(a b c d e f g) 7) should return '((a b c d e f g) ())

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Help with a lisp function (please post photos) A lisp function that generates a random day of the week, then displays a message saying that "Today is ... and tomorrow will be ...". For this purpose, create a global variable before the function containing the days of the week as a list. Then use the built-in function random first to generate a number between 0 and 6 (including). The expression (random) by itself generates a random integer. You can call it with one parameter to return a value within the range from 0 to the value of the parameter-1. For example, (random 10) will return a value between 0 and 9. Next, use the number generated at the previous step to retrieve the symbol for the day of the week from the list. Use the built-in elt function. We want the name of the day to appear capitalized. For this, extract the symbol-name of the day first, then apply the built-in function capitalize to it. Use the result in the princ function call, and do the same thing for the next day.…
Write two Lisp functions using memory allocation methods 1. The first function should return the first element in the list that is larger than or equal to the value. For example,(first-fit '(3 8 6 4 9) 5)should return 8. The second should return the element of the list that best fits the value. Look for the smallest value in the list that is larger than or equal to the value. Do not use the built-in function sort, nor sort the list in some other way. The solution should be linear For example,(best-fit '(3 8 6 4 9) 5)should return 6.
c++ A palindrome is a string that reads the same both forward and backward. For example, the string "madam" is a palindrome. Write a program that uses a recursive function to check whether a string is a palindrome. Your program must contain a value-returning recursive function that returns true if the string is a palindrome and false otherwise. Do not use any global variables; use the appropriate parameter.
Write a function named select-multiples value 1st in Scheme that takes an integer and a list of integers and uses fold (or reduce) to return list of elements that are multiples of value. You must use either fold or reduce to do the vast majority of the work. (You may do a little pre- and post- processing outside the call to fold.) You may use the built-in fold method by adding the line (require 'list-lib), or you can use your own implementation. You may not use the built-in select function. The built-in fold function has parameters in this order: action partial-result lst. You can detect whether num is a multiple of value by checking whether (mod num value) is 0. For example, (my-select 5 (5)) should return (5) • (my-select 3 '(7 9)) should return () • (my-select 5 '(1 15 25)) should return (15 25) • (my-select 2 '()) should return ()
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.
Write a function sum_and_print(nums) that takes a non-empty list of integers nums as a parameter and prints a series of partial sums in the format shown in the table below. The first line of output shows just the first number, the second shows the first number plus the second, the third shows the sum of the first three numbers, and so on. For example: Test Result sum_and_print([3, 1, 2, 0, 4]) Total up to i = 0: 3 Total up to i = 1: 4 Total up to i = 2: 6 Total up to i = 3: 6 Total up to i = 4: 10 sum_and_print( [333]) Total up to i = 0: 333
The function list_combination takes two lists as arguments, list_one and list_two. Return from the function the combination of both lists - that is, a single list such that it alternately takes elements from both lists starting from list_one. You can assume that both list_one and list_two will be of equal lengths. As an example if list_one = [1,3,5] and if list_two = [2,4,6]. The function must return [1,2,3,4,5,6].
Use Clojure: a. The built-in function type is useful for checking what kind of object an expression evaluates to. Write a function both-same-type? that takes two arguments, and returns true when they both have the same type, and false otherwise. b. Write a function list-longer-than? which takes two arguments: an integer n, and a list lst and returns true if lst has more than n elements, and false otherwise. For example, (list-longer-than? 3 '(1 2 3)) should return false, and (list-longer-than? 2 '(1 2 3)) should return true.
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.
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.
Write the recursive version of the function filter which returns a list and takes in f - a one-argument function that returns True if the passed in argument should be included in the resulting list or False otherwise seq seq- a list of values . Note that this is different from the built in filter function we learned previously, which returns a filter object, not a list. def filter (f, seq): """Filter a sequence to only contain values allowed by filter. >>> def is_even(x): return x % 2 == 0 >>> def divisible_by5(x): return x % 5 == 0 >>> filter (is_even, [1,2,3,4]) [2, 4] >>> filter (divisible_by5, [1, 4, 9, 16, 25, 100]) [25, 100] |||||| "*** YOUR CODE HERE ***'
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 = []…