تخطى إلى المحتوى الرئيسي
واجهة جانبية
Nützliche Links
Veranstaltungssuche
Rechenzentrum
Website-Support
Häufige Fragen
Lehre Digital
Forschung Digital
Lecture - Videoupload
CaseTrain
المزيد
العربية (ar)
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)
أنت الآن تدخل بصفة ضيف
تسجيل الدخول
Nützliche Links
طي
توسيع
Veranstaltungssuche
Rechenzentrum
Website-Support
Häufige Fragen
Lehre Digital
Forschung Digital
Lecture - Videoupload
CaseTrain
توسيع الكل
طي الكل
فتح فهرس المقرر
الصفحة الرئيسية
WS23_AKIDS1
Lectures
L5: Sorting
L5: Sorting
متطلبات الإكمال
اضغط على وصلة
L5_Sorting.pdf
لاستعراض الملف
► L4: Algorithmic Complexity
الانتقال إلى...
الانتقال إلى...
Ankündigungen
Discussion Forum
L1: Introduction
L2: Algorithms
L3: Data Structures
L4: Algorithmic Complexity
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
Probeklausur
Hauptklausur (13.2.): Results and Grades
Nachholklausur (11.4.): Results and Grades
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
L6: Heap ◄
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