Welcome to BHS Computer Science. If you are a student in the class, the first thing you need to do (and which we should have done in class) is set up your GitHub account.
Once you have a GitHub account, click “Log in to GitHub” below to proceed. Or you can click “Use anonymously” to play with the environment but you will not be able to save your work or submit assignments. (You can always log in later by clicking the at the top of the page.)
If you don’t have a GitHub account yet, please create one and then log in here for further instructions.
Congratulations! You have successfully connected this app to GitHub. However you are not yet a member of the GitHub organization for this class, something Mr. Seibel needs to set up for you.
This is your GitHub profile URL:
Click the clipboard icon to copy it and then submit it at this form so he can add you.
Congratulations! You have successfully connected this app to GitHub. And it looks like you have an invitation to join the GitHub organization for this class. You need to accept that invitation before you can proceed. The invite should be sent to whatever email you used when you created your GitHub account.
I see you are logged into GitHub and a member of the berkeley-high-cs GitHub organization. However there seems to have been some problem finishing the setup for your account. Please let Mr. Seibel know.
This is a tool for the BHS Computer Science class at Berkeley High School. It is intended to provide a simple environment for experimenting with Javascript without all the complexities of a full development environment such as ReplIt or Glitch which we may use later in the year.
It is also designed to take advantage of the browser’s ability to run Javascript natively. It does not need access to a server to run code making in extremely responsive even if the Wifi is flaking out.
Finally, under the covers it is saving work to a GitHub repository in a very simplified workflow that does not depend on immediately learning any git commands. Code written in this environment for each assignment is saved to a directory and branch specific to that assignment each time it is saved. Thus when the assignment is done, it is easy to go to GitHub and create a PR containing just the work on that assignment which can then be commented on and worked on further before it is turned in and merged to main.
You're all set! You don't need to worry about this yet but we have successfully created a GitHub repository for your work:
You can get to it any time by clicking on your GitHub username at the top-right of the screen.
A function that takes two arguments and adds them. Must be recursive.
A function that takes two arguments and multiplies them. Must be recursive.
A function that takes two arguments and doubles the first argument the number of times specified by the second argument. Must be recursive.
A function that takes two arguments and triples the first argument the number of times specified by the second argument. Must be recursive.
A function that takes two arguments and raises the first to the power of the second. Must be recursive.
A function that takes a string argument and return a new string with all 'x's removed. Must be recursive.
A function that takes a string argument and returns the number of 'x's in the string. Must be recursive.
A function that takes an array of numbers and returns the maximum
value in the array. If the array is empty, it should return the
special value
-Infinity
. Must be recursive.
A function that takes an array and a predicate function and returns true if every element of the array satisfies the predicate. Must be recursive.
A function that takes an array and a predicate function and returns true if at least one element of the array satisfies the predicate. Must be recursive.
For all the functions in this assignment I want you to write a recursive function. Note, that even moreso than in the first recursion problem set, many of these functions are not ones that you'd naturally write recursively. This is an exercise in making sure you understand how recursion works so you can use it on problems where it is a natural way to express things.
As in the previous assignment, for functions the recurse on arrays,
you may want to use the fact that s.slice(1)
returns an
array consisting of all but the first element of xs
. E.g.
[2, 3, 5, 7, 11].slice(1)
evaluates to a new array
[3, 5, 7, 11]
. Similarly you can recurse on strings using
s.substring(1)
to get the string containing all but the
first character of s
.