For this assignment, you will implement several functions using the Reason programming language. You will be provided with the interface for various functions or a specific problem, and you are responsible for implementing the specified functionality.
Project 1 will give you time to practice the concepts we cover in class with respect to the functional programming paradigm. These skills will help prapare you for the remaining programming assignments.
For this assignment, you will be programming in Reason, a dialect of OCaml. There are two parts to this assignment.
You may not work in teams for this project.
Working alone, create and submit the following four (4) artifacts:
p1a1.re through
p1a5.re, that contains your implementations of the
function interfaces required for P1a.
p1b1.re through
p1b2.re, that contains your implementations of the
function interfaces required for P1b.
references.txt
providing a citation for each resource you used (excluding class
notes, and assigned readings) to complete the assignment. For
example, if you found a Stack Overflow answer helpful, provide a
link to it. Additionally, provide a brief description of how the
resource helped you. You should create a separate version of
this file for both P1a and P1b.
Unless otherwise noted, you may use standard library functions.
Create a Reason file named p1aX.re, where
X is replaced by the question number, and implement
the following function interfaces:
c_to_f
let c_to_f = (temp: float) : float => {
/* ... */
};
split_tip
let split_tip = ((price: float), (n: int)) : option(float) => {
/* ... */
};
price of a meal, and the number of
ways to split the check n, return
Some(<float>), where float is the price with
20% tip split n ways. If n is less than 1 or
price is less than 0, return None.Some(<value>) to return a value and
None to return nothing.
triangle_area
let triangle_area = ((s1: float), (s2: float), (s3: float)) : option(float) => {
/* ... */
};
Some(<float>) where float is the area of a triangle
with those sides. If the sides do not form a valid triangle, return
None.
repeat
let repeat = ((f: 'a => 'a), (arg: 'a), (n: int)) : 'a => {
/* ... */
};
f, an argument to the function
arg, and an integer n, return
f applied to arg n times.
list_length
let list_length = (l: list('a)) : int => {
/* ... */
};
List.length function.
Create a Reason file named p1bX.re, where
X is replaced by the question number, and implement
the following function interfaces:
salutations
let salutations = (l: list(string)) : list(string) => {
/* ... */
};
dot_product
let dot_product = ((l1: list(int)), (l2: list(int))) : option(int) => {
/* ... */
};
Some
<int>, where int is the dot product of the two lists.
If the lists are not the same length, return None.
count
let count = ((l: list ('a)), (e: 'a)) : int => {
/* ... */
};
l, and an element,
e, return the number of occurrences of e
in l.
pre_order
let pre_order = (t: int_tree) : list(int) => {
/* ... */
};
t, return a list of the tree
items in the order that they are visited by a pre-order traversal.
int_tree_map
let int_tree_map = ((f: int => int), (t: int_tree)) : int_tree => {
/* ... */
};
f, and an integer tree,
t, return a new integer tree with f
applied to all nodes of t.
For this part of the assignment, one resource is provided:
Documentation is your friend! Here are some external resources you might find helpful:
Recall that Reason is a dialect of OCaml. You are able to make use all of OCaml's standard library and pervasives as a result. While it is possible to implement all of the function interfaces on your own, you may find it easier to use library functions in some cases (check out the List module in particular).
When implementing code in Reason, make a particular effort to use local bindings to:
You will most likely need to define recursive helper functions. To improve the performance of your code, be sure to make your functions tail-recursive whenever possible.
If you are still stuck, you should ask questions or stop by Student Hours.
p1aX.re and p1bX.re files should
not contain anything but the function. Use a separate file for
testing your functions.
Video guides are provided to help you get started with various aspects of this project. Note that there may be errors and mistakes in these videos. You should not blindly follow the steps taken in these videos!
You must turn in a the following files to Gradescope:
references.txt: your file of citationsp1aX.re (each containing your answer for P1a question
X) You must turn in the following files to Gradescope:
references.txt: your file of citationsp1bX.re (each containing your answer for P1a
question X) You will submit your files to Gradescope. The easiet way to do this for the current assignment is to drag the individual files to the submission page on Gradescope.
P1 Grading (out of 50 points):