diff options
| author | Florian Fischer <florian.fischer@muhq.space> | 2024-11-11 17:40:48 +0100 |
|---|---|---|
| committer | Florian Fischer <florian.fischer@muhq.space> | 2024-11-11 17:40:48 +0100 |
| commit | ee5118e6cc6bdf3f5b240b364cf80c505f43a8b1 (patch) | |
| tree | 66a48b7e1bc0277340d93b2cdf9857e2727d565b /Info/11/NTG | |
| parent | d1155cc42650a671a406b36c82bba41acb242fd9 (diff) | |
| download | unterricht-ee5118e6cc6bdf3f5b240b364cf80c505f43a8b1.tar.gz unterricht-ee5118e6cc6bdf3f5b240b364cf80c505f43a8b1.zip | |
update quiz
* fix answer
* include graph
Diffstat (limited to 'Info/11/NTG')
| -rw-r--r-- | Info/11/NTG/1/Breitensuche/arsnova_click_graphen_und_bfs.json | 2 | ||||
| -rw-r--r-- | Info/11/NTG/1/Breitensuche/quiz_graph.dot | 6 |
2 files changed, 7 insertions, 1 deletions
diff --git a/Info/11/NTG/1/Breitensuche/arsnova_click_graphen_und_bfs.json b/Info/11/NTG/1/Breitensuche/arsnova_click_graphen_und_bfs.json index 5f3c72f6..fed51faf 100644 --- a/Info/11/NTG/1/Breitensuche/arsnova_click_graphen_und_bfs.json +++ b/Info/11/NTG/1/Breitensuche/arsnova_click_graphen_und_bfs.json @@ -1 +1 @@ -{"name":"Graphen und BFS","currentQuestionIndex":-1,"questionList":[{"questionText":"Graphen sind für mich ...","timer":30,"displayAnswerText":true,"tags":[],"requiredForToken":false,"difficulty":5,"answerOptionList":[{"answerText":"einfach","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"verständlich ","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"schwierig","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"schwarze Magie","isCorrect":false,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"SurveyQuestion"},{"questionText":"Welche Eigenschaft hat folgender Graph? \n\n![]()","timer":30,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":3,"answerOptionList":[{"answerText":"gerichtet","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"gewichtet","isCorrect":true,"TYPE":"DefaultAnswerOption"},{"answerText":"zusammenhängend","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"vollständig","isCorrect":false,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"SingleChoiceQuestion"},{"questionText":"Jeder zusammenhängende Graph ist auch vollständig.","timer":20,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":3,"answerOptionList":[{"answerText":"Ja","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"Nein","isCorrect":true,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"YesNoSingleChoiceQuestion"},{"questionText":"Bei folgendem Signalfeuernetzwerk dauert es 1 Minute bis alle Nachbarsignalfeuer entzündet sind.\n\nWie viele Minuten dauert es bis, ausgehend vom schwarzen Signalfeuer, alle anderen Signalfeuer brennen?\n\n","timer":40,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":5,"answerOptionList":[{"answerText":"6","isCorrect":false,"TYPE":"FreeTextAnswerOption","configCaseSensitive":false,"configTrimWhitespaces":false,"configUseKeywords":false,"configUsePunctuation":false}],"TYPE":"FreeTextQuestion"},{"questionText":"Welcher der Pseudocodebeschreibungen der Breitensuche ist korrekt?","timer":60,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":6,"answerOptionList":[{"answerText":"","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"","isCorrect":true,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"SingleChoiceQuestion"},{"questionText":"Die Warteschlange der Breitensuche und die des Dijkstra-Algorithmus verhalten sich gleich.","timer":20,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":3,"answerOptionList":[{"answerText":"Wahr","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"Falsch","isCorrect":true,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"TrueFalseSingleChoiceQuestion"},{"questionText":"Vervollständige den Javacode, um die Bezeichnung aller Nachbarknoten eines Knotens auszugeben.\n\n```java\nint[][] adjazenzmatrix;\nKnoten knotenfeld[];\nint anzKnoten;\n\nint knotenIndex = 5;\nfor (int i = 0; i < anzKnoten; i++) {\n println(/*FIXME*/);\n}\n```","timer":75,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":8,"answerOptionList":[{"answerText":"adjazenzmatrix[knotenIndex][i].bezeichnung","isCorrect":false,"TYPE":"FreeTextAnswerOption","configCaseSensitive":false,"configTrimWhitespaces":false,"configUseKeywords":true,"configUsePunctuation":true}],"TYPE":"FreeTextQuestion"}],"sessionConfig":{"theme":"Material","readingConfirmationEnabled":false,"showResponseProgress":true,"confidenceSliderEnabled":false,"music":{"enabled":{"lobby":true,"countdownRunning":true,"countdownEnd":true},"shared":{"lobby":false,"countdownRunning":false,"countdownEnd":false},"volumeConfig":{"global":60,"lobby":60,"countdownRunning":60,"countdownEnd":60,"useGlobalVolume":true},"titleConfig":{"lobby":"Song3","countdownRunning":"Song1","countdownEnd":"Song1"}},"nicks":{"memberGroups":[],"maxMembersPerGroup":10,"autoJoinToGroup":false,"selectedNicks":[],"blockIllegalNicks":true}},"state":"Inactive","currentStartTimestamp":-1}
\ No newline at end of file +{"name":"Graphen und BFS","currentQuestionIndex":-1,"questionList":[{"questionText":"Graphen sind für mich ...","timer":30,"displayAnswerText":true,"tags":[],"requiredForToken":false,"difficulty":5,"answerOptionList":[{"answerText":"einfach","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"verständlich ","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"schwierig","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"schwarze Magie","isCorrect":false,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"SurveyQuestion"},{"questionText":"Welche Eigenschaft hat folgender Graph? \n\n","timer":30,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":3,"answerOptionList":[{"answerText":"gerichtet","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"gewichtet","isCorrect":true,"TYPE":"DefaultAnswerOption"},{"answerText":"zusammenhängend","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"vollständig","isCorrect":false,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"SingleChoiceQuestion"},{"questionText":"Jeder zusammenhängende Graph ist auch vollständig.","timer":20,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":3,"answerOptionList":[{"answerText":"Ja","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"Nein","isCorrect":true,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"YesNoSingleChoiceQuestion"},{"questionText":"Bei folgendem Signalfeuernetzwerk dauert es 1 Minute bis alle Nachbarsignalfeuer entzündet sind.\n\nWie viele Minuten dauert es bis, ausgehend vom schwarzen Signalfeuer, alle anderen Signalfeuer brennen?\n\n","timer":40,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":5,"answerOptionList":[{"answerText":"5","isCorrect":false,"TYPE":"FreeTextAnswerOption","configCaseSensitive":false,"configTrimWhitespaces":false,"configUseKeywords":false,"configUsePunctuation":false}],"TYPE":"FreeTextQuestion"},{"questionText":"Welcher der Pseudocodebeschreibungen der Breitensuche ist korrekt?","timer":60,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":6,"answerOptionList":[{"answerText":"","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"","isCorrect":true,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"SingleChoiceQuestion"},{"questionText":"Die Warteschlange der Breitensuche und die des Dijkstra-Algorithmus verhalten sich gleich.","timer":20,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":3,"answerOptionList":[{"answerText":"Wahr","isCorrect":false,"TYPE":"DefaultAnswerOption"},{"answerText":"Falsch","isCorrect":true,"TYPE":"DefaultAnswerOption"}],"showOneAnswerPerRow":true,"TYPE":"TrueFalseSingleChoiceQuestion"},{"questionText":"Vervollständige den Javacode, um die Bezeichnung aller Nachbarknoten eines Knotens auszugeben.\n\n```java\nint[][] adjazenzmatrix;\nKnoten knotenfeld[];\nint anzKnoten;\n\nint knotenIndex = 5;\nfor (int i = 0; i < anzKnoten; i++) {\n println(/*FIXME*/);\n}\n```","timer":75,"displayAnswerText":true,"tags":[],"requiredForToken":true,"difficulty":8,"answerOptionList":[{"answerText":"adjazenzmatrix[knotenIndex][i].bezeichnung","isCorrect":false,"TYPE":"FreeTextAnswerOption","configCaseSensitive":false,"configTrimWhitespaces":false,"configUseKeywords":true,"configUsePunctuation":true}],"TYPE":"FreeTextQuestion"}],"sessionConfig":{"theme":"Material","readingConfirmationEnabled":false,"showResponseProgress":true,"confidenceSliderEnabled":false,"music":{"enabled":{"lobby":true,"countdownRunning":true,"countdownEnd":true},"shared":{"lobby":false,"countdownRunning":false,"countdownEnd":false},"volumeConfig":{"global":60,"lobby":60,"countdownRunning":60,"countdownEnd":60,"useGlobalVolume":true},"titleConfig":{"lobby":"Song3","countdownRunning":"Song1","countdownEnd":"Song1"}},"nicks":{"memberGroups":[],"maxMembersPerGroup":10,"autoJoinToGroup":false,"selectedNicks":[],"blockIllegalNicks":true}},"state":"Inactive","currentStartTimestamp":-1}
\ No newline at end of file diff --git a/Info/11/NTG/1/Breitensuche/quiz_graph.dot b/Info/11/NTG/1/Breitensuche/quiz_graph.dot new file mode 100644 index 00000000..6ada6b46 --- /dev/null +++ b/Info/11/NTG/1/Breitensuche/quiz_graph.dot @@ -0,0 +1,6 @@ +graph G { + f; + a -- b; + b -- c; + c -- a [ label="2" ]; +} |
