1. create an html file that uses an alert dialog box to display the message "hi there! " when the page loads.
2. create an html file that creates a variable named testscore. use a prompt-function dialog box to ask the user to specify a value for the variable. then, use a series of if-else statements to display the corresponding grade based on the following: 90 to 100: a 80 to 89: b 70 to 79: c 60 to 69: d below 60: f
3. create an html file that uses a for loop to display the letters of the alphabet within alert dialog boxes. for (i = 65; i < = 90; i++) {alert( string. fromcharcode(i).;
4. create an html file that displays the current system date and time within an alert dialog box as the page loads.
5. create an html file that uses an array to store links for your three favorite websites. use a for loop to display each link url within an alert dialog box.
6. create an html file that uses a function, which you create, named max that returns the larger of two values.
7. compare and contrast global and local variables, and provide a javascript example.
8. create an html form, and use javascript to validate the fields.
9. research the javascript string object, and discuss the capabilities it provides. include examples of the object’s use.
10. create an html file that creates a dog object that includes a breed, name, and age. assign values to the object, and then use an alert dialog box to display each field’s value.

Some of your friends have gotten into the burgeoning field of time-series data mining, in which one looks for patterns in sequences of events that occur over time. purchases at stock exchanges--what’s being bought-- are one source of data with a natural ordering in time. given a long sequence s of such events, your friends want an efficient way to detect certain "patterns" in them--for example, they may want to know if the four events buy yahoo, buy ebay, buy yahoo, buy oracle occur in this sequence s, in order but not necessarily consecutively. they begin with a collection of possible events (e.g., the possible’ transactions) and a sequence s of n of these events. a given event may occur multiple times in s (e.g., yahoo stock may be bought many times in a single sequence s). we will say that a sequence s’ is a subsequence of s if there is a way to delete certain of the events from s so that the remaining events, in order, are equal to the sequence s’. so, for example, the sequence of four events above is a subsequence of the sequence buy amazon, buy yahoo, buy ebay, buy yahoo, buy yahoo, buy oracle their goal is to be able to dream up short sequences and quickly detect whether they are subsequences of s. so this is the problem they pose to you: give an algorithm that takes two sequences of even~s--s’ of length m and s of length n, each possibly containing an event more than once--and decides in time o(m n) whether s’ is a subsequence of s

Which cultural aspect does this type of song best portray? a german polka dance

What a backup plan that you have created in a event you encounter a situation