[SOLVED] CS代考 OCaml assignment1

OCaml assignment1
Important notes about grading:
1. Compiler errors: Programs that cannot be compiled will receive an automatic zero. If you are having trouble getting your assignment to compile, please visit recitation or office hours.
2. Late assignments: Please carefully review the course website’s policy on late assignments, as all assignments handed in after the deadline will be considered late. Submitting an incorrect version before the deadline and realizing that you have done so after the deadline will be counted as a late submission.

Copyright By PowCoder代写加微信 assignmentchef

Compile and run your code:
After downloading and unzipping the file for assignment1, in your command-line window, cd into the directory which contains src . You should write your code in src/assignment1.ml .
Use ocamlc -o test src/assignment1.ml to compile the code. Then, use ./test to excute it.
Submission:
In your submission, you are not allowed to use any functions from the OCaml List module (library). But you can use the @ operator for concatenating two lists, e.g. [1; 2] @ [3; 4] = [1;2;3;4] .
Please submit assignment1.ml only to Canvas.
Write a function
range : int -> int -> int list
such that range num1 num2 returns an ordered list of all integers from num1 to num2 inclusive. For
example, range 2 5 = [2;3;4;5] . Return [] if num2 < num1 . In [ ]:Write a functionflatten : ‘a list list -> ‘a list
that flattens a list. For example, flatten [[1;2];[4;3]] = [1;2;4;3] .
let rec range num1 num2 = (* YOUR CODE HERE *)
assert (range 2 5 = [2;3;4;5])

2022/2/15 23:31 assignment1
let rec flatten l = (* YOUR CODE HERE *)
Write a function
remove_stutter : ‘a list -> ‘a list
that removes stuttering from the original list. For example, remove_stutter [1;2;2;3;1;1;1;4;4;2;2]=
[1;2;3;1;4;2] . In [ ]:
assert (flatten ([[1;2];[4;3]]) = [1;2;4;3])
let remove_stutter l = (* YOUR CODE HERE *)
assert (remove_stutter [1;2;2;3;1;1;1;4;4;2;2] = [1; 2; 3; 1; 4; 2])

2022/2/15 23:31 assignment1
Problem 4 (3 questions)
Set Implementation using Lists
For this part of the project, you will implement sets. In practice, sets are implemented using data structures like balanced binary trees or hash tables. However, your implementation must represent sets using lists. While lists don¡¯t lend themselves to the most efficient possible implementation, they are much easier to work with.
For this project, we assume that sets are unordered, homogeneous collections of objects without duplicates. The homogeneity condition ensures that sets can be represented by OCaml lists, which are homogeneous. The only further assumptions we make about your implementation are that the empty list represents the empty set, and that it obeys the standard laws of set theory. For example, if we insert an element x into a set a , then ask whether x is an element of a , your implementation should answer affirmatively.
Finally, note the difference between a collection and its implementation. Although sets are unordered and contain no duplicates, your implementation using lists will obviously store elements in a certain order and may even contain duplicates. However, there should be no observable difference between an implementation that maintains uniqueness of elements and one that does not; or an implementation that maintains elements in sorted order and one that does not.
Our testcases do not use input lists with duplicated elements.
If you do not feel comfortable with sets, see the Set Wikipedia Page (https://en.wikipedia.org/wiki/Set_(mathematics)) and/or this Set Operations Calculator (https://www.mathportal.org/calculators/misc-calculators/sets-calculator.php).
We provide some example code.
elem : ‘a -> ‘a list -> bool
elem x a returns true iff x is an element of the set a. For example, elem 5 [2;3;5;7;9] = true .
subset: ‘a list -> ‘a list -> bool
subset a b returns true iff a is a subset of b . For example, subset [5] [2;3;5;7;9] = true .
let rec elem x a =
match a with
| [] -> false
| h::t -> if h = x then true else elem x t
let rec subset a b =
match a with
| [] -> true
| h::t -> if elem h b then subset t b else false

2022/2/15 23:31 assignment1
eq: ‘a list -> ‘a list -> bool
eq a b returns true iff a and b are equal as sets. For example, eq [5;3;2;9;7] [2;3;5;7;9] = true .
You need to implement the following three functions:
remove: ‘a -> ‘a list -> ‘a list
remove x a removes x from the set a . For example, eq (remove 5 [2;3;5;7;9]) [2;3;9;7] = true .
union: ‘a list -> ‘a list -> ‘a list
union a b returns the union of the sets a and b . For example, eq (union [5;2] [3;7;9]) [2;3;5;7;9]
= true . In [ ]:
diff: ‘a list -> ‘a list -> ‘a list
diff a b returns the difference of sets a and b in a . For example, eq (diff [1;3;2] [2;3]) [1] =
let rec eq a b =
(subset a b) && (subset b a)
let rec remove x a = (* YOUR CODE HERE *)
assert (eq (remove 5 []) []);
assert (eq (remove 5 [2;3;5;7;9]) [2;3;9;7]); assert (eq (remove 4 [2;3;5;7;9]) [2;3;5;9;7]);
let rec union a b = (* YOUR CODE HERE *)
assert (eq (union [2;3;5] []) [2;3;5]); assert (eq (union [5;2] [3;7;9]) [2;3;5;9;7]); assert (eq (union [2;3;9] [2;7;9]) [2;3;9;7]);
let rec diff a b =
(* YOUR CODE HERE *)

2022/2/15 23:31 assignment1
assert (eq (diff [1;3;2] [2;3]) [1]);
assert (eq (diff [‘a’;’b’;’c’;’d’] [‘a’;’e’;’i’;’o’;’u’]) [‘b’;’c’;’d’]); assert (eq (diff [“hello”;”ocaml”] [“hi”;”python”]) [“hello”;”ocaml”]);
Problem 5 (3 questions)
Write an OCaml function
digitsOfInt : int -> int list
such that digitsOfInt n returns [] if n is less than zero, and returns the list of digits of n in the order in
which they appear in n . In [ ]:
Consider the process of taking a number, adding its digits, then adding the digits of the number derived from it, etc., until the remaining number has only one digit. The number of additions required to obtain a single digit from a number n is called the additive persistence of n , and the digit obtained is called the digital root of n . For example, the sequence obtained from the starting number 9876 is 9876, 30, 3, so 9876 has an additive persistence of 2 and a digital root of 3.
Write two OCaml functions:
additivePersistence : int -> int
digitalRoot : int -> int
that take positive integer arguments n and return respectively the additive persistence and the digital root of
let rec digitsOfInt n = (* YOUR CODE HERE *)
assert (digitsOfInt 3124 = [3;1;2;4]); assert (digitsOfInt 352663 = [3;5;2;6;6;3]);
let additivePersistence n = (* YOUR CODE HERE *)
let digitalRoot n =
(* YOUR CODE HERE *)
assert (additivePersistence 9876 = 2); assert (digitalRoot 9876 = 3);

程序代写 CS代考加微信: assignmentchef QQ: 1823890830 Email: [email protected]