scheme file

#lang scheme

; Scheme Poject test module

; YOU SHOULD NOT MODIFY THIS FILE! If one of your functions does not work

; comment out the call to the test module in your code.

; Your code will be tested with a similar module

$($provide test$-$remove$-$next$-$to$-$last$)$

$($provide test$-$manhattan$)$

$($provide test$-$remove$-$dups$)$

$($provide test$-$deep$-$search$)$

$($provide test$-$inorder$)$

$($provide test$-$tree$-$exists$)$

$($provide test$-$eval$-$poly$)$

$($provide test$-$get$-$poly$-$fun$)$

$($display "Summer $2024$ Test Cases"$)($newline$)$

$($define test$-$remove$-$next$-$to$-$last

$($lambda $($x$)$

$($begin

$($display "Question $1$: remove$-$next$-$to$-$last: $")$

$($write $($x $\text{'}($l a s x t$)))($display $"$ & $")$

$($write $($x $\text{'}($o n x e$)))$

$($newline$)$

$)))$

$($define test$-$manhattan

$($lambda $($x$)$

$($begin

$($display "Question $2$: manhattan: $")$

$($write $($x $\text{'}(-1.4)\text{'}(1.8)))($display $"$ & $")$

$($write $($x $\text{'}(-4.-3)\text{'}(6.3)))($display $"$ & $")$

$($write $($x $\text{'}(-2.-2)\text{'}(5.5)))$

$($newline$)$

$)))$

$($define test$-$remove$-$dups

$($lambda $($x$)$

$($begin

$($display "Question $3$: remove$-$dups: $")$

$($write $($x $\text{'}($w o r k s$)))($display $"$ & $")$

$($write $($x $\text{'}($p p p p e e e r r r r r f f f f f e e e e c c c t t t t$)))($display $"$ & $")$

$($write $($x $\text{'}($T T T T T T T T T T T$)))$

$($newline$))))$

$($define test$-$deep$-$search

$($lambda $($x$)$

$($begin

$($display "Question $4$: deep$-$search $")$

$($write $($x $22))($display $"$ & $")$

$($write $($x $\text{'}(12345)3))($display $"$ & $")$

$($write $($x $\text{'}(12345)7))($display $"$ & $")$

$($write $($x $\text{'}(1(2(3)45))4))($display $"$ & $")$

$($write $($x $\text{'}($a $($b $($c $($d $($e$)))))\text{'}$e$))($display $"$ & $")$

$($write $($x $\text{'}(1(2(34))(5)((67(8)))9)13))$

$($newline$)$

$)))$

$($define tree$1\text{'}((1.3).((4.5).(8.9))))$

$($define tree$2\text{'}((1.(2.3)).(((4.6).7).(8.(9.10)))))$

$($define test$-$inorder

$($lambda $($x$)$

$($begin

$($display "Question $5$: inorder: $")$

$($write $($x tree$1))($display $"$ & $")$

$($write $($x tree$2))$

$($newline$)$

$)))$

$($define test$-$tree$-$exists

$($lambda $($x$)$

$($begin

$($display "Question $5$: tree$-$exists: $")$

$($write $($x tree$15))($display $"$ & $")$

$($write $($x tree$110))($display $"$ & $")$

$($write $($x tree$25))($display $"$ & $")$

$($write $($x tree$210))$

$($newline$)$

$)))$

$($define test$-$eval$-$poly

$($lambda $($x$)$

$($let $(($poly$1\text{'}((1.1)(1.1)(1.0)))$

$($poly$2\text{'}((1.4)(-3.2)(3.1)(6.0)))$

$($poly$3\text{'}((1.4)(2.3)(1.2)(3.1)(5.0))))$

$($begin

$($display "Question $6$a: eval$-$poly: $")($newline$)$

$($display $"$ Poly$1$: $")$

$($write $($x poly$11))($display $"$ & $")$

$($write $($x poly$1-2))($display $"$ & $")$

$($write $($x poly$14))$

$($newline$)$

$($display $"$ Poly$2$: $")$

$($write $($x poly$21))($display $"$ & $")$

$($write $($x poly$2-2))($display $"$ & $")$

$($write $($x poly$24))$

$($newline$)$

$($display $"$ Poly$3$: $")$

$($write $($x poly$31))($display $"$ & $")$

$($write $($x poly$3-2))($display $"$ & $")$

$($write $($x poly$34))$

$($newline$)$

$))))$

$($define test$-$get$-$poly$-$fun

$($lambda $($x$)$

$($let $(($poly$1\text{'}((1.1)(1.1)(1.0)))$

$($poly$2\text{'}((1.4)(-3.2)(3.1)(6.0)))$

$($poly$3\text{'}((1.4)(2.3)(1.2)(3.1)(5.0))))$

$($let

$(($f$1($x poly$1))$

$($f$2($x poly$2))$

$($f$3($x poly$3)))$

$($begin

$($display "Question $6$b: get$-$poly$-$fun: $")$

$($write $($x poly$1))($display $"$ & $")$

$($write $($x poly$2))$

$($newline$)$

$($display $"$ f$1$: $")$

$($write $($f$11))($display $"$ & $")$

$($write $($f$1-2))($display $"$ & $")$

$($write $($f$14))($newline$)$

$($display $"$ f$2$: $")$

$($write $($f$21))($display $"$ & $")$

$($write $($f$2-2))($display $"$ & $")$

$($write $($f$24))($newline