SluitenHelpPrint
Switch to English
Cursus: 202001182
202001182
Algorithms, Datastructures and Complexity
Cursus informatieRooster
Cursus202001182
Studiepunten (ECTS)5
CursustypeCursus
VoertaalEngels
Contactpersoondr.ir. R. Langerak
E-mailr.langerak@utwente.nl
Docenten
Examinator
dr.ir. R. Langerak
Docent
dr.ir. R. Langerak
Contactpersoon van de cursus
dr.ir. R. Langerak
Collegejaar2021
Aanvangsblok
1B
AanmeldingsprocedureZelf aanmelden via OSIRIS Student
Inschrijven via OSIRISJa
Cursusdoelen
At the end of the course the student is able to:
  • use and explain elementary data structures (like heaps, binary trees, priority queues, graphs)
  • use and explain elementary algorithms (like sorting algorithms, algorithms for traversing and updating data structures, and optimization algorithms)
  • analyse complexity of algorithms and operations on data structures (using Master’s Theorem or recursion trees), and use dynamic programming to decrease complexity
Inhoud
Elementary algorithms and data structures for solving problems in computer sciences applications. Basic principles and techniques to analyse the complexity of algorithms; time complexity (worst-case and average-case) and space complexity. Data structures: heaps, binary trees, priority queues, graphs. Algorithm design dealing with: sorting, divide and conquer, dynamic programming.

 
Voorkennis
High school math, programming
Participating study
Bachelor Technical Computer Science
Verplicht materiaal
-
Aanbevolen materiaal
Book
Cormen, Introduction to Algorithms, third ed. isbn 9780262533058
Werkvormen
Exercise course

Hoorcollege

Toetsen
Written examination

SluitenHelpPrint
Switch to English