44:["$","title",null,{"children":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen (mit Lösungen) | pmeschenmoser-hslu | Observable"}] 4c:Td6d,

4d:Tdbd,

4e:Td54,

4f:[] 48:{"id":"64e2a86d81e04b0f","slug":"js-ex-sol","title":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen (mit Lösungen)","thumbnail":"2153e2f8ef84a743b815e6e5a5c52adf8f16af3544fa0f4bd65abab775f5d5f2","access_level":"public","create_time":"$D2022-05-05T09:36:06.426Z","update_time":"$D2023-04-25T12:12:25.050Z","view_time":null,"first_public_time":"$D2023-04-25T12:12:14.706Z","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":340,"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":7,"collection":null,"type":"notebook","body":{"titling":"auto","title":"Data-Driven Web Engineering: Gemischte JavaScript-Übungen (mit Lösungen)","cells":[{"id":0,"value":"# Data-Driven Web Engineering: Gemischte JavaScript-Übungen (mit Lösungen)","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// Ihre Lösung:\n for (let 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 // Ihre Lösung\n for (let 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 console.log(5 % 2); \n console.log(4 % 2);\n //Ihre Lösung \n for (let i = 1; i<=100; i++){\n if (i % 2 === 0){ //Vergleich auf selben Datentyp & Wert mit drei '=' \n console.log(i);\n } \n } \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 const meinObjekt = {x: Math.random()*10, y:Math.random()*10}\n console.log(meinObjekt);\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 let meinObjekt = {x: Math.random()*10, y:Math.random()*10}\n meinObjekt['background color'] = 'green'; \n console.log(meinObjekt);\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 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: *for (let element of thatArray)* und *thatArray.forEach(function(elem, i){})* ","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: Verwenden von *aktuellesMinimum = Number.POSITIVE_INFINITY* und <-Operator in if-Bedingung.","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 (let i=0; i aktuellesMaximum){\n aktuellesMaximum = thatArray[j];\n }\n }\n return aktuellesMaximum;\n }\n \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: \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":"$4c","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:11, da <= verwendet wird ","pinned":false,"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":"$4d","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: 1 Iteration, da danach wird versucht die Konstante i zu erhöhen (Fehler)","pinned":false,"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":"$4e","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: i wird für jede Iteration um 1 vermindert, dadurch kommt es nie zu der Erfüllung der Abbruchbedingung. -> Endlosschleife","pinned":false,"hidden":false,"mode":"md","author":"$undefined","summary":"$undefined","tool":"$undefined","providerMetadata":"$undefined","attachments":"$undefined","output":"","database":"$undefined"}],"files":"$W4f","stdlib":"1"}} 24:null