Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Please answer the questions in plait language in drRacket (please show outputs to prove solution code works): #lang plait #|PROBLEM 1 returns a list containing

Please answer the questions in plait language in drRacket (please show outputs to prove solution code works):

#lang plait

#|PROBLEM 1 returns a list containing n copies of x|# (define (duple n x) ...)

(test (duple 2 3) '(3 3)) (test (duple 4 '(ha ha)) '((ha ha) (ha ha) (ha ha) (ha ha))) (test (duple 0 '(word)) '())

#|PROBLEM 2 return a sorted list of integers based on operator less than < ascending greater than > descending > |# (define (merge [op : (Number Number -> Boolean)] [int-list1 : (Listof Number)] [int-list2 : (Listof Number)]) : (Listof Number) ...) (test (merge < '(1 4 6) '(2 5 8)) '(1 2 4 5 6 8)) (test (merge > '(6 4 1) '(8 5 2)) '(8 6 5 4 2 1))

#|Problem 3 return an association list from a list of symbols and a list of numbers define a type to allow for the output of a list of associations ?_t is to be replaced with your appropriately named type |# (define-type ... )

(define (make-assoc [names : (Listof Symbol)] [values : (Listof Number)]): (Listof ?_t) ....)

(test (make-assoc '(a b c d) '(1 2 3 4)) '((?_t 'a 1) (?_t 'b 2) (?_t 'c 3) (?_t 'd 4))) (test (make-assoc '(t a c o tuesday) '(0 1 34 1729 42)) '((?_t 't 0) (?_t 'a 1) (?_t 'c 34) (?_t 'o 1729) (?_t 'tuesday 42)))

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Database Design And Implementation

Authors: Edward Sciore

2nd Edition

3030338355, 978-3030338350

Students also viewed these Databases questions