This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/Wiseperson-generator-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/shouter-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/text-normalizer-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/text-normalizer-drill |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/area-of-a-rectangle-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/temperature-conversion-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/Is-divisible-drill?lite=&classroom_template=&outputonly=&fileName= |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/Traffic-lights-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/Error-alert-drill?lite=&classroom_template=&outputonly=&fileName= |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/Creating-arrays-drill | |
https://repl.it/@MZibari/Adding-array-items-drills | |
https://repl.it/@MZibari/Accessing-array-items-drill | |
https://repl.it/@MZibari/Array-length-and-access-drill | |
https://repl.it/@MZibari/Array-copying-I-drill | |
https://repl.it/@MZibari/Array-copying-II-drill | |
https://repl.it/@MZibari/Squares-with-map-drill | |
https://repl.it/@MZibari/Sort-drill | |
https://repl.it/@MZibari/Filter-drill | |
https://repl.it/@MZibari/Find-drill |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/min-and-max-without-sort-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/average-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/fizzbuzz-drill-js?lite=&classroom_template=&outputonly=&fileName= |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Scope is the accessibility to a vairable in different parts of the program. Global variables can be accessed anywhere in the program, while block variables can only be accessed within that particular block that they're declared in. | |
Global variables should be avoided, except in specific cases, because they will cause unintended side effects that will cause bugs, especially in larger programs, that will be hard to track down. | |
Strict mode will trigger an uncaught reference error any time a variable is declared without 'let' or 'const' keywords, it's used to stop the accidental creation of indeteminate code. | |
Side effects are the accidental alteration of a global variable's value that will effect the outputs of a different function or a block of code. Pure function is a function that when provided with the same inputs will always have the same outputs. |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/Object-creator-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/Object-updater-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/Self-reference-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/Deleting-keys-drill?lite=&classroom_template=&outputonly=&fileName= |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
https://repl.it/@MZibari/Make-student-reports-drill?lite=&classroom_template=&outputonly=&fileName= | |
https://repl.it/@MZibari/Enroll-in-summer-school-drill | |
https://repl.it/@MZibari/find-by-id-drill |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
We start with the function "getTokens", which takes a single argument "rawString". it will change all letters to lower case letters, since java script is case sensative, when we compare the amount of times a particular word has occured, we don't want the word "This" be considered a diffirent word from "this". Then the function will remove all symboles and return all the words as an array of strings. In our code, the returned array will be stornd in "words" array. | |
We then create an object "wordFrequencies" that we will later use to store all unique words as keys, and the frequency of thoses keys as thier values. | |
After that, we itirate through the "words" array using a for loop, counting each occurance of words and storing that information in our "wordFrequencies" object. | |
In the last part, we use a for(...in...) loop to determine which key has the largest frequency, and based on that result, we return the key of the most frequent word. | |
There's a more detailed line by line description of the code in the link bel |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
*{ | |
text-align: center; | |
font-family: 'Anton', sans-serif; | |
font-size: 30px; | |
} | |
body{ | |
/*background-image: url("https://cdn.stocksnap.io/img-thumbs/960w/ANC5ACJ7V0.jpg");*/ | |
background-repeat: repeat; | |
} |
OlderNewer