25:["$","title",null,{"children":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen | pmeschenmoser-hslu | Observable"}] 49:Td6d,

4a:Tdbd,

4b:Td54,

4c:[] 29:{"id":"6cc473fe0192a543","slug":null,"title":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen","thumbnail":"63487ce68e0bdd9d62a4e9ec97fa28d40df8195150a985fc450ed7da048f630e","access_level":"public","create_time":"$D2023-05-10T09:15:47.871Z","update_time":"$D2023-05-10T10:59:24.379Z","view_time":null,"first_public_time":"$D2023-05-10T09:15:47.871Z","has_unpublished_edits":null,"fork":{"id":"2e7e1b777cb13db2","slug":"mixed-js-ex","title":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen","owner":{"id":"d453c31c6f30f58d","login":"pmeschenmoser-hslu","name":""}},"stars":0,"starred":false,"owner":{"type":"team","id":"d453c31c6f30f58d","login":"pmeschenmoser-hslu","name":"","avatar_url":"https://avatars-next.observableusercontent.com/63655b833b666ab4131690b92aedce308446ed9468293aec56b2ee71db090aaa","tier":"starter_2024","bio":"","followed_by_you":false,"follows_you":false},"version":322,"publish_version":null,"role":null,"authored":false,"authors":[{"type":"individual","id":"5a3b6ff689928461","login":"pmeschenmoser-hslu","name":"","avatar_url":"https://avatars-next.observableusercontent.com/63655b833b666ab4131690b92aedce308446ed9468293aec56b2ee71db090aaa","tier":null,"bio":"","followed_by_you":false,"follows_you":false}],"members":[{"type":"individual","id":"5a3b6ff689928461","login":"pmeschenmoser-hslu","name":"","avatar_url":"https://avatars-next.observableusercontent.com/63655b833b666ab4131690b92aedce308446ed9468293aec56b2ee71db090aaa","tier":null,"role":"editor"}],"comments":[],"custom_thumbnail":false,"trashed":false,"lapsed":null,"subscribed":null,"forks":0,"collection":null,"type":"notebook","body":{"titling":"auto","title":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen","cells":[{"id":0,"value":"# Data-Driven Web Engineering: Gemischte JavaScript-Übungen","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":51,"value":"### Aufgabe 1: Bis 100 mit for-Schleifen","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":119,"value":"1a) Einfache Aufgaben auf w3Schools: 1-2","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":6,"value":"1b) Nutzen Sie eine for-Schleife um die Ganzzahlen zwischen 1 und 100 in die Browserkonsole zu schreiben. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":11,"value":"{\n for (var i=1; i<=100; i++){\n console.log(i); \n }\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":13,"value":"1c) Nutzen Sie eine for-Schleife, um nur gerade Ganzzahlen aus dem Intervall [2, 100] in die Browserkonsole zu schreiben. Passen Sie hierzu den Schleifenkopf aus Aufgabe 1b an. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":19,"value":"{\n for (var i=2; i<=100; i=i+2){\n console.log(i); \n }\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":22,"value":"1d) Lösen Sie Aufgabe 1c ohne eine Anpassung im Schleifenkopf, aber mit einer if-Bedingung im Schleifenrumpf. Der folgende Snippet ist dabei hilfreich:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":28,"value":"{\n\n for (var i=1; i<=100; i++){\n if (i % 2 === 0) console.log(i)\n }\n\n \n //Ihre Lösung \n\n} ","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":60,"value":"### Aufgabe 2: Objekterstellung","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":34,"value":"2a) Erstellen Sie ein JavaScript-Objekt mit den Schlüsseln 'x' und 'y'. Diese sollen auf Zufallszahlen aus dem Intervall [0,10] verweisen.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":39,"value":"{\n //Ihre Lösung\n var meinObj = {x:Math.random()*10, y:Math.random()*10}\n console.log(meinObj)\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":41,"value":"2b) Fügen Sie dem Objekt aus Aufgabe 2a) einen Schlüssel namens *background color* zu, der auf den Wert *green* verweist.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":67,"value":"{\n //Ihre Lösung\n var meinObj = {x:Math.random()*10, y:Math.random()*10}\n meinObj['background color'] = 'green'\n console.log(meinObj)\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":64,"value":"### Aufgabe 3: Zugriff auf/Sammeln von Objekt-Werte(n)","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":79,"value":"3a) In der folgenden Zelle wird ein Array erstellt, der 100 Objekte mit zufälligen x- und y-Koordinaten beinhaltet. Fragen Sie die erste x-Koordinate ab und schreiben Sie diese in die Konsole. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":77,"value":"{\n let meinArray = []\n for (let i=0; i<100;i++) meinArray.push({x:Math.random(), y:Math.random()});\n //Ihre Lösung:\n console.log(meinArray[0].x)\n} ","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":84,"value":"3b) In der folgenden Zelle wird die Anzahl der Objekte erst zur Ausführungszeit bestimmt. Schreiben Sie die x-Koordinate des letzten Objekts im Array in die Browserkonsole. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":92,"value":"{\n let meinArray = []\n const anzahlObjekte = 1 + parseInt(Math.random()*100) \n for (let i=0; i weitererArray.push(elem.x))\n for (let elem of meinArray) weitererArray.push(elem.x)\n console.log(weitererArray)\n} ","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":104,"value":"### Aufgabe 4: Maximum eines Arrays ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":108,"value":"4a) Schreiben Sie eine Funktion, um den Maximalwert eines übermittelten Arrays zurückzuliefern. Füllen Sie hierzu die Lücken:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":113,"value":"{\n const meinArray = [123, 23, 12, 98, 12, 39, 42]; \n\n function meineMaxFunktion(thatArray){\n let aktuellesMaximum = Number.NEGATIVE_INFINITY;\n for (let j= 0; j < thatArray.length; j++){\n if (thatArray[j] > aktuellesMaximum){\n aktuellesMaximum = thatArray[j];\n }\n }\n return aktuellesMaximum;\n }\n\n console.log(meineMaxFunktion(meinArray));\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":115,"value":"4b) Es geht noch etwas kompakter. Nennen Sie zwei alternative Möglichkeiten, um über die Elemente von *thatArray* zu iterieren.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":274,"value":"- Ihre Lösung:","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":268,"value":"4d) Beschreiben Sie, an welchen Stellen und wie man die obige Funktion anpassen müsste, um das Minimum eines Arrays zu finden.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":277,"value":"- Ihre Lösung:","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":131,"value":"### Aufgabe 5: Die Quadrierung des Arrays","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":135,"value":"5a) Gegeben ist der folgende Array. Nutzen Sie eine for-Schleife, um jedes Element zu quadrieren.","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":139,"value":"{\n let meinArray = [1,2,3,9,2,4];\n let beispielPotenz = Math.pow(10,2);\n //Ihre Lösung:\n for (var i=0; i Math.pow(x,2))\n console.log(meinArray); \n console.log(res); \n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":156,"value":"5c) Gegeben ist der folgende verschachtelte Array, der eine 2D-Matrix repräsentieren soll. Wie viele Elemente besitzt der Array auf oberster Ebene? Nun soll jede enthaltene Zahl quadriert werden und die Form des Arrays erhalten bleiben. Nutzen Sie hierzu zwei ineinander verschachtelte Schleifen: ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":161,"value":"{\n let matrix = [[1,2,3], [9,2,4]];\n for (let i= 0; i< matrix.length; i++){\n console.log(matrix[i]); \n for (let j=0; j < matrix[i].length; j++){\n matrix[i][j] = Math.pow(matrix[i][j], 2);\n }\n }\n console.log(matrix);\n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":162,"value":"5d) Lösen Sie Aufgabe 5c) ohne for-Schleifen, stattdessen mithilfe des folgenden Snippets:","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":167,"value":"{\n let matrix = [[1,2,3], [9,2,4]];\n matrix.forEach(function(elem, i){\n elem.forEach(function(elem2, j){\n matrix[i][j] = Math.pow(elem2, 2); \n }); \n }); \n console.log(matrix); \n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":171,"value":"### Aufgabe 6: Min-Max Normalisierung","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":175,"value":"6a) Gegeben ist der folgende Array. Wenden Sie min-max-Normalisierung an, um Werte im Wertebereich [0,1] zu erhalten. Hinweis: *minmax(v) = (v - min(v))/(max(v)-min(v))*. Hierbei kann auch die Funktion aus Aufgabe 4 nützlich sein. ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":182,"value":"{\n let meinArray = [10, 0, 9, 29, 13, 100]; \n const min = 0; //for simplicity; können wir natürlich auch programmatisch bestimmen\n //Ihre Lösung: \nfunction meineMaxFunktion(thatArray){\n let aktuellesMaximum = Number.NEGATIVE_INFINITY;\n for (let j= 0; j < thatArray.length; j++){\n if (thatArray[j] > aktuellesMaximum){\n aktuellesMaximum = thatArray[j];\n }\n }\n return aktuellesMaximum;\n }\n \n const max = meineMaxFunktion(meinArray); \n //und jetzt normalisieren, wende obige Formel für jedes Element v an:\n console.log(meinArray.map(v => (v - min)/(max-min))) \n}","pinned":true,"hidden":false,"mode":"ojs","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"$undefined","database":"$undefined"},{"id":190,"value":"### Aufgabe 7: For-Schleifen","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":196,"value":"7a) Wie viele Iterationen erfolgen bei der folgenden Schleife?","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":200,"value":"$49","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":252,"value":"- Ihre Lösung:","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":205,"value":"7b) Wie viele Iterationen erfolgen bei der folgenden Schleife? Weshalb?","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":233,"value":"$4a","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":260,"value":"- Ihre Lösung: ","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":213,"value":"7c) Wie viele Iterationen erfolgen bei der folgenden Schleife? Weshalb? ","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":245,"value":"$4b","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"},{"id":263,"value":"- Ihre Lösung:","pinned":true,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"}],"files":"$W4c","stdlib":"1"}} 24:null