SluitenHelpPrint
Switch to English
Cursus: 202001183
202001183
Algorithms, Datastructures and Complexity for EMSYS
Cursus informatieRooster
Cursus202001183
Studiepunten (ECTS)4
CursustypeCursus
VoertaalEngels
Contactpersoondr.ir. R. Langerak
E-mailr.langerak@utwente.nl
Docenten
Docent
dr.ir. R. Langerak
Contactpersoon van de cursus
dr.ir. R. Langerak
Collegejaar2020
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 and graphs)
  • use and explain elementary algorithms (like sorting algorithms, algorithms for traversing and updating data structures, and optimization algorithms on graphs)
  • analyze complexity of algorithms and operations on data structures (using Master’s Theorem or recursion trees)
Inhoud
Elementary algorithms and datastructures 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, graphs. Algorithm design dealing with: sorting, divide and conquer, greedy methods.
Voorkennis
High school math, programming
Participating study
Master Embedded Systems
Verplicht materiaal
-
Aanbevolen materiaal
Book
Cormen, Introduction to Algorithms, third ed. isbn 9780262533058
Werkvormen
Hoorcollege

Werkcollege

Toetsen
Written examination

SluitenHelpPrint
Switch to English