Welcome to AP Computer Science A. 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.
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 AP Computer Science A 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.
Write a method that takes two Strings and and
int and returns a String with the second
string inserted into the first one at the index specified by the
int. You can assume that the index is between 0 and the
length of the string, inclusive.
Write a method that takes two Strings and returns a
String consisting of the first String with
the first occurrence of the second String removed.
Write a method that takes two Strings and returns a
String consisting of the first String with
all occurrences of the second String removed.
Write a method that takes a String and two
ints, n and i, and returns a
String consisting of the n characters
starting at position i. You can assume that
i is in bounds and that there are at least
n characters left in the string at that point.
Write a method that takes a String, an
int n, and another String and
returns the n characters from the first
String before the first occurrence of the second
String. You can assume that the second string does
occur in the first and that there are at least
n characters before it.
Write a method that takes a String, an
int n, and another String and
returns the n characters from the first
String starting after the first occurrence of the
second String. You can assume that the second string
does occur in the first and that there are at least
n characters after it.
Write a method that takes a single String and returns a
boolean indicating whether the String is a
palindrome, that is, is the same backwards as forwards.
Write a method that takes a single String consisting of
a word and returns a String of the original
String
translated into Ubbie Dubbie, a gibberish language akin to Pig Latin
formed by the following rule: before each group of vowels insert the
syllable “ub”. So “peanut” would become “pubeanubut”.
Write a method that takes a single String which will
contain a number of runs of repeated letters. Return a
String with each run of letters replaced by the letter
and then the length of the run. For instance
"abbccc" would be turned into "a1b2c3".