Datastructures and Algorithms
6 EC
Semester 2, periode 4
5082DAAL6Y
Abstracte datatypen, algoritmen en hun complexiteit.
Een keuze uit de klassieke datastructuren, o.m. arrays, stapels, wachtrijen, geschakelde lijsten, heaps en hashtabellen. Het college behandel toperaties en algoritmes op deze datastructuren. Ook wordt aandacht besteed aan het gebruik van datastructuren in concrete toepassingen voor de AI.
In the lectures we cover all necessary theoretical concepts.
In the labs, the students can work on their programming assignments and the quizzes and get help and feedback.
During selfstudy, students recap the material from lectures and work on assignments and quizzes.
Each assignment is graded in a one on one grading sessions where further feedback is given.
|
Activiteit |
Aantal uur |
|
Hoorcolleges |
28 |
|
Laptopcollege |
28 |
|
Code review |
1 |
|
Toets |
2 |
|
Zelfstudie |
109 |
Aanwezigheidseisen opleiding (OER-B):
Aanvullende eisen voor dit vak:
Attendance is mandatory for the grading sessions where the assignments are evaluated (each student must be present for their scheduled slot). For the rest of the labs and lectures we do not monitor attendance.
| Onderdeel en weging | Details |
|
Eindcijfer | |
|
4 (40%) Tentamen | Moet ≥ 5 zijn, Vereist |
|
1 (100%) 25-03-2025 Tentamen | |
|
6 (60%) Opdrachten | Moet ≥ 5 zijn, Vereist |
|
3 (30%) Assignment 1 Testing, Lists, and Trees | |
|
3 (30%) Assignment 2 Sorting and Hash Tables | |
|
3 (30%) Assignment 3 Graphs | |
|
1 (10%) Quiz grade [ from ans.app! ] |
In addition to the standard threshold on the final grade (per OER), we also require
De manier van inzage wordt via de digitale leeromgeving gecommuniceerd.
Three assignments, graded. Feedback is given via codegrade as well as during a one-on-one grading session.
All three assignments have to be made individually.
Dit vak hanteert de algemene 'Fraude- en plagiaatregeling' van de UvA. Hier wordt nauwkeurig op gecontroleerd. Bij verdenking van fraude of plagiaat wordt de examencommissie van de opleiding ingeschakeld. Zie de Fraude- en plagiaatregeling van de UvA: http://student.uva.nl
| Weeknummer | Onderwerpen |
| 1 | Collection data types |
| 2 | Algorithmic complexity, Sorting |
| 3 | Quicksort, Sets, dictionaries, and hash tables |
| 4 | Trees, Priority queues and heaps |
| 5 | Graphs: shortest paths |
| 6 | maximum spanning trees, dynamic programming |
| 7 | Advanced topics & Recap |
dr. Thomas Loots
Sergey Troshin