Write a function in Scheme or rules in Prolog called countlt that takes a list of numbers, L, and another number, N, and returns the count of numbers less than N in the list L. Example calls Scheme: (countlt '(6 1 9) 4) -> 1 (countlt '(50 27 13) 1) -> 0 Prolog ?- countlt (I6, 1, 91, 4, X). X = 1. ?- countlt (I50, 27, 131, 1, x). x = 0.

Write a function in Scheme or rules in Prolog called countlt that takes a list of numbers, L, and another number, N, and returns the count of numbers less than N in the list L. Example calls Scheme: (countlt '(6 1 9) 4) -> 1 (countlt '(50 27 13) 1) -> 0 Prolog ?- countlt (I6, 1, 91, 4, X). X = 1. ?- countlt (I50, 27, 131, 1, x). x = 0.

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

Write a small C++ program that defines a recursive function GCD based on the model of the Lisp function (defun gcd (n m)"Returns the gcd of two numbers" (let ((dividend n) (divisor m) (remainder 1)) (while (/= remainder 0) (setq remainder (mod dividend divisor)) (setq dividend divisor) (setq divisor remainder)) dividend)) In the main function, write a loop (while or do) that repeats the following actions: ask the user to enter two numbers, compute their GCD and output it, until the user enters 0 for one of the numbers.
Write a Haskell function filterAB. This takes a boolean function and two lists. It returns a list of all items in the second list for which the corresponding item in the first list makes the boolean function true. Examples: filterAB (>0) [-1,1,-2,2] [1,2,3,4,5,6] should return [2,4]. filterAB (==1) [2,2,1,1,1,1,1] "abcde" should return "cde".
In kotlin, Write a recursive function with an expression body that takes a list of Pairs in which each value may be of any type, and returns a list of the first elements from each pair.
Develop a system/application in Prolog that will allow grader to: load a set of student’s grades (see samples from the Table C below) query student’s final letter grade (A, B, C, etc.) by a given student’s name. query student(s) whose grade matches to the input letter grade (e.g., A). For example, show student(s) whose final letter grade is A. There are 3 types of grades for each student—HWs, Exams, and Project, with a weight of 20%, 40% and 40%, respectively, to the 100-point final. Table A and B show how the final grades (in points and letter) are computed. Table C shows samples of students’ grades. You will define the execution instructions to answer the following questions so that grader can test out your application in Prolog: how to load your source code to Prolog runtime/compiler how to load students’ grades to Prolog runtime/compiler how to query student’s letter grade how to query student(s) whose letter grade matches to an input letter grade Please DO NOT hard code any…
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 write in scheme language. Write a Scheme procedure that sums all the elements in a given list of numbers. It takes input from the user as a list. Then it returns sums of elements in this list of numbers. Let's say The user enters 1 2 3 4 as a list. It must be returned 10 ( 1+2+3+4=10)
C programming language
*Needs to be done in scheme interleave* Implement function interleave in scheme, which expects as arguments two lists x and y, and returns asingle list obtained by choosing elements alternately, first from x and then from y. When either x or yruns out, interleave takes the remaining elements from the other list, so that the elements of the resultare exactly the elements of the two argument lists taken together. (interleave '(1 2 3) '(a b c)) -> (1 a 2 b 3 c) (interleave '(1 2 3) '(a b c d e f)) -> (1 a 2 b 3 c d e f) (interleave '(1 2 3 4 5 6) '(a b c)) -> (1 a 2 b 3 c 4 5 6)
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…
Let the function fun be defined as: int fun(int &k) { k += 4; return 3 * k -1; } Suppose the function fun was used in a program as follows: void main() { int i = 10, j = 10, sum1, sum2; sum1 = (i / 2) + fun(i); sum2 = fun(j)) + ( j / 2); } A. What are the values of sum1 and sum2 if the operands in the expressions are evaluated left to right? B. What are the values of sum1 and sum2 if the operands in the expressions are evaluated right to left?
Create a SCHEME file/program that implements a quadratic equation solver and calls it with 1, 0, -25 1, 7, 12 1, 8, 16 2, 16, 32 Your choice Then implement a temperature conversion F to C, and C to F.
Program in Haskell (Replace the question marks with code). Has to be recursive: my_map :: (a -> b) -> [a] -> [b] my_map = ? my_all :: (a -> Bool) -> [a] -> Bool my_all = ? my_any :: (a -> Bool) -> [a] -> Bool my_any = ? my_filter :: (a -> Bool) -> [a] -> [a] my_filter = ? my_dropWhile :: (a -> Bool) -> [a] -> [a] my_dropWhile = ? my_takeWhile :: (a -> Bool) -> [a] -> [a] my_takeWhile = ? my_break :: (a -> Bool) -> [a] -> ([a], [a]) my_break = ? -- Implement the Prelude functions and, or, concat using foldr my_and :: [Bool] -> Bool my_and = ? my_or :: [Bool] -> Bool my_or = ? my_concat :: [[a]] -> [a] my_concat = ? -- Implement the functions sum, product, reverse using foldl my_sum :: Num a => [a] -> a my_sum = ? my_product :: Num a => [a] -> a my_product = ? my_reverse :: [a] -> [a] my_reverse = ?