Vai al contenuto principale
Pannello laterale
Nützliche Links
Veranstaltungssuche
Rechenzentrum
Website-Support
Häufige Fragen
Lehre Digital
Forschung Digital
Lecture - Videoupload
CaseTrain
Altro
Italiano (it)
Català (ca)
Deutsch (de)
Deutsch (du) (de_du)
English (en)
Español - Internacional (es)
Français (fr)
Italiano (it)
Português - Portugal (pt)
Svenska (sv)
Türkçe (tr)
Русский (ru)
العربية (ar)
Ospite
Login
Nützliche Links
Minimizza
Espandi
Veranstaltungssuche
Rechenzentrum
Website-Support
Häufige Fragen
Lehre Digital
Forschung Digital
Lecture - Videoupload
CaseTrain
Espandi tutto
Minimizza tutto
Espandi
Minimizza
General information
Vurgulanmış
Ankündigungen
Discussion Forum
Espandi
Minimizza
Lectures
Vurgulanmış
L1: Introduction
L2: Algorithms
L3: Data Structures
L4: Algorithmic Complexity
L5: Sorting
L6: Heap
L7: Hashing
L8: Binary Search Tree
L9: Balanced Trees (AVL)
L10: Graphs
L11: Graph Algorithms
L12: Dynamic Programming
L13: DP Problems
L14: State Space Search
L15: Heuristic State Space Search
L16: Adversarial Search (Game Playing)
L17: Metaheuristic Search (Discrete Optimization)
L18: Constraint Satisfaction and Backtracking
L19: Knowledge-Based Reasoning (Expert Systems)
L20: Numeric(al) Optimization
L21: Introduction to Machine Learning
L22: Parametric Classification
L23: Non-Parametric Classification
Espandi
Minimizza
Klausur
Vurgulanmış
Probeklausur
Hauptklausur (13.2.): Results and Grades
Nachholklausur (11.4.): Results and Grades
Espandi
Minimizza
Content
Vurgulanmış
Week 1 23.10. Lecture 1: Introduction 26.10. Lectu...
Espandi
Minimizza
Exercises
Vurgulanmış
Exercise 0 - Introduction to Python
Exercise 01 - Stack & Queue
Exercise 01 - Stack & Queue - Solutions
Exercise 02 - Complexity & Sorting
Exercise 02 - Complexity & Sorting - Solutions
Exercise 03 - Heaps & Hashing
Exercise 03 - Heaps & Hashing - Solutions
Exercise 04 - Binary & Balanced Trees
Exercise 04 - Binary & Balanced Trees - Solutions
Exercise 05 - Graphs
Exercise 05 - Graphs - Solution
Exercise 06 - Dynamic Programming
Exercise 06 - Dynamic Programming - Solutions
Exercise 07 - State Space Search
Exercise 07 - State Space Search - Solution
Exercise 08 - Adversarial Search
Exercise 08 - Adversarial Search - Solution
Exercise 09 - Metaheuristic & Constrained Satisfaction
Exercise 09 - Constrained Satisfaction - Solution
Exercise 10 - Expert Systems & Numerical Optimization
Exercise 10 - Expert Systems & Numerical Optimization (Solution)
Exercise 11 - Machine Learning
Apri indice del corso
Home
Demokurs Wortschatz B1
Beispiel Modul I Einheit 1.3 Was ist, wenn ...?
1.3 Mindmap zum Thema Emotionen
1.3 Mindmap zum Thema Emotionen
Aggregazione dei criteri
Spunta come completato
Mindmap.jpg
Mindmap.jpg
◄ 1.3 Wörter erkennen
Vai a...
Vai a...
Herzlich willkommen im Kurs!
Wie ist der Kurs aufgebaut?
Wie ist eine Einheit aufgebaut?
Wie ist ein Modul aufgebaut?
Auszug aus dem kursbegleitenden Glossar
Virtuelles Glossar
1.3 Eintauchen
1.3 Wörter erkennen
1.3 Wörter hören
1.3 Arbeiten mit dem Glosssar
1.3 Wörter hören und Grammatik
1.3 Wortbedeutung
1.3 Wörter im Kontext
1.3 Aufgaben zum Glossar
1.3 Material Emotionen
1.3 Wörter hören ►
Impressum
|
Datenschutzerklärung - WueCampus
|
Erklärung zur Barrierefreiheit
|
Bildnachweise
Navigationsleiste - WueStudy:
University icons created by justicon - Flaticon
Navigationsleiste - Rechenzentrum:
Data center icons created by Eucalyp - Flaticon
Navigationsleiste - Website Support:
Consultant icons created by Vitaly Gorbachev - Flaticon
Navigationsleiste - Häufige Fragen:
Files and folders icons created by Freepik - Flaticon
Navigationsleiste - Lehre Digital:
Training icons created by vectorspoint - Flaticon
Navigationsleiste - Forschung Digital:
Research icons created by Eucalyp - Flaticon
Navigationsleiste - Lecture:
Video icons created by Freepik - Flaticon
Werbefeld 2 - WueLogin:
Login icons created by Freepik - Flaticon
Werbefeld 3 - Upgrade WueCampus 4.4:
Update icons created by Freepik - Flaticon