Use Dr Racket please. 3. Write Scheme programs/forms to(1) check if (+ # \d 26) converts a letter to a different letter(2) try guessing what running ((+ 2 1) will do and then test it(2) check whether '(+24) is a symbol(3) check whether "+", "(+ 3 5), "(* 4 6)" are strings(4) check whether (* 3 5), '(/ 3 7), (1 2 3 4), "(+ 2 8) and "(1 2 3)" are strings(5) convert a temperate in Fahrenheit to Celsius. (use a define form to make generic)

Answered: Use Dr Racket please

Engineering

Computer Science

Use Dr Racket please

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

In Scheme please. Please do not copy and paste the wrong answer that is out there. Dislike will be given to you. Write a Scheme procedure (clean-list lst) that returns the list with all non-numeric elements removed. You can use this for #8 & #9. Copy your Scheme code without formatting in the box below: Copy your output without formatting in the box below:
4. Use this provided scheme code to answer the following questions. Listing 3: counter.scm 1 (let loop ((n 1)) (if (> n 10) '() (cons n (loop (- n 1))))) 3 4 a) Describe the code that is presented as though you were writing a comment within the code file to describe inputs, outputs, and what's happening. Format your text as though you are writing a comment to a Scheme file; use the correct commenting symbol(s). b) Is there an error in the scheme code? (Yes | No) c) If you indicated yes, describe the error briefly in your own words.
Computer Science The below code is written in C++, can you please write it in Scheme language with comments or explination? thank you!! void antiSymmetric(int b[], int sizeOfB) { bool hold = true; // set hold to true for(int i = 0; i < sizeOfB;) // for each pair (e,f) in b { if(hold == false) { cout << "AntiSymmetric - No" << endl; break; //Did not find (e,e) in b } for(int j = 0; j < sizeOfB;) { if(b[i] == b[j+1] && b[i+1] == b[j]) //If true, then pair(f,e) exists { if(b[i+1] != b[i]) //If true, relation is antisymmetric { hold = true; break; } else { hold = false; j = j + 2; } } else { hold = false; j = j + 2; } } i = i + 2;
Evaluate the following Scheme form: (let ((a 3) (b 4) (+ (* a a) (* 2 a b) (* b b))n
4-Write a Scheme procedure that takes a list and returns the sum of the odd- numbers that are less than 8 in the list. For example, (sumodd '(1 (2 () 6) 3 (5) 8)) returns 9. Then, Manually trace your procedure with the provided example. Please study provided examples foreign the lecture notes to learn how you should manually trace our procedure.
Scheme question: Q1: Over or Under Define a procedure over-or-under which takes in a number x and a number y and returns the following: -1 if x is less than y 0 if x is equal to y 1 if x is greater than y *Hint: You can use cond (define (over-or-under x y) 'YOUR-CODE-HERE ) ;;; Tests (over-or-under 1 2) ; expect -1 (over-or-under 2 1) ; expect 1 (over-or-under 1 1) ; expect 0
4- Write a C program to read an integer number num and find it's factorial. Note: the factorial number is all the number multiplied from 1 to the number itself. n! = n(n - 1)(n – 2) ... (2)(1) Example: 5! = (5)(4)(3)(2)(1) = 120
Data Structure Using C Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', Using C determine if the input string is valid. An input string is valid if: Open brackets must be closed by the same type of brackets. Open brackets must be closed in the correct order. Example 1: Input: s = "()" Output: true Example 2: Input: s = "()[]{}" Output: true Example 3: Input: s = "(]" Output: false Example 4: Input: s = "([)]" Output: false Example 5: Input: s = "{[]}" Output: true note* the previous answered solution had a problem the following input was giving a wrong output Input: s = "([)]" Output: false
'Strictly-Increasing' in Scheme:
def optimize_tail_calls(original_scheme_eval): """Return a properly tail recursive version of an eval function.""" def optimized_eval(expr, env, tail=False): """Evaluate Scheme expression EXPR in Frame ENV. If TAIL, return an Unevaluated containing an expression for further evaluation. """ if tail and not scheme_symbolp(expr) and not self_evaluating(expr): return Unevaluated(expr, env) result = Unevaluated(expr, env) # fill in code code here while isinstance(result, Unevaluated): #code here return optimized_eval scheme_eval = optimize_tail_calls(scheme_eval)
The below code is written in C++, can you please write it in Scheme language with comments or explination? thank you!! void antiSymmetric(int b[], int sizeOfB) { bool hold = true; // set hold to true for(int i = 0; i < sizeOfB;) // for each pair (e,f) in b { if(hold == false) { cout << "AntiSymmetric - No" << endl; break; //Did not find (e,e) in b } for(int j = 0; j < sizeOfB;) { if(b[i] == b[j+1] && b[i+1] == b[j]) //If true, then pair(f,e) exists { if(b[i+1] != b[i]) //If true, relation is antisymmetric { hold = true; break; } else { hold = false; j = j + 2; } } else { hold = false; j = j + 2; } } i = i + 2;
Evaluate the following Scheme form: (let ((a 3) (b 4)) (+ (* a a) (* 2 a b) (* b b)))