Lab 2 Scheme Exercises CS 152 Section 5 Fall 2020 Michael Mc

Question

Lab 2 Scheme Exercisescs 152 Section 5 Fall 2020michael Mcthrow Write a function named fizz-buzz that accepts no arguments. The fizz-buzz function outputs numbers 1 to 100 (inclusive) and prints them line-by-line as standard output. If a number is divisible by 3, we print “fizz” instead of the number. If a number is divisible by 5, we print “buzz” instead of the number. If a number is divisible by both 3 and 5 (e.g., 15), we print “fizzbuzz” instead of the number. Write a function named gcd that accepts two arguments m and n. This computes the greatest common denominator of m and n; you may assume these are integers. For example, if m is 16 and n is 36, the greatest common denominator is 4. Write a function named linear-search that accepts two arguments: items and key. This function performs a linear search on the list items, determining whether key (an integer) is among those items. The function evaluates to true (#t) if the key is found, and false (#f) if the key is not found. When operating on the list, you are only allowed to use the Scheme functions first and rest; you may not use Scheme’s built-in search functions, nor are you allowed to take advantage of maps and filters. Write a function named my-remove that accepts two arguments: items (a list) and key. This function returns a new list that does not have any elements that match the key. You may only use first and rest for traversing the existing list, and for creating the new list, you are limited to the cons, list, and append functions.

Dr. Jack HW Helper · Accepted Answer

Using Scheme, particularly adhering to the R6RS standard, one can implement essential functions such as fizz-buzz, gcd, linear-search, and my-remove through recursive strategies that emphasize functional programming principles. This approach promotes immutability and pure functions, avoiding side effects and mutable state, which are central to functional paradigms. Below is an exploration of how each function can be formulated to meet the specified behaviors and constraints. Implementing fizz-buzz The fizz-buzz function demonstrates iteration and conditional logic, which in Scheme can be effectively handled using recursion. The function iterates from 1 to 100, evaluating divisibility by 3 and 5. The remainder function, (remainder m n), is essential for this check. Based on the outcome, the function prints "fizz", "buzz", "fizzbuzz", or the number itself. Since display does not automatically add a newline, adding a newline callback or using display-line would be appropriate for line-by-line output. Implementing gcd The gcd function naturally lends itself to Euclid’s algorithm, which is recursive and efficient. The recursive definition states that gcd of m and n is the same as gcd of n and the remainder of m divided by n, terminating when the remainder is zero. This method is both efficient and elegant, well-aligned with the functional programming principles favoring recursion over iteration causing side-effects. Implementing linear-search The linear-search function explores the list linearly, using only first and rest for traversal. It checks whether the first element equals the key; if so, it returns true. If not, it recursively searches the rest of the list. If the list becomes empty, it returns false. This approach involves pattern matching on the list structure and emphasizes the recursion pattern typical in functional programming. Implementing my-remove The my-remove function constructs a new list by recursively examining each element. If the current element equ

Lab 2 Scheme Exercises CS 152 Section 5 Fall 2020 Michael Mc

Lab 2 Scheme Exercisescs 152 Section 5 Fall 2020michael Mcthrow

Paper For Above instruction

Implementing fizz-buzz

Implementing gcd

Implementing linear-search

Implementing my-remove

Summary

References