CloseHelpPrint
Kies de Nederlandse taal
Course module: 202001183
202001183
Algorithms, Datastructures and Complexity for EMSYS
Course infoSchedule
Course module202001183
Credits (ECTS)4
Course typeCourse
Language of instructionEnglish
Contact persondr.ir. R. Langerak
E-mailr.langerak@utwente.nl
Lecturer(s)
Lecturer
dr.ir. R. Langerak
Contactperson for the course
dr.ir. R. Langerak
Academic year2020
Starting block
1B
Application procedureYou apply via OSIRIS Student
Registration using OSIRISYes
Aims
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)
Content
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.
Assumed previous knowledge
High school math, programming
Participating study
Master Embedded Systems
Required materials
-
Recommended materials
Book
Cormen, Introduction to Algorithms, third ed. isbn 9780262533058
Instructional modes
Lecture

Tutorial

Tests
Written examination

CloseHelpPrint
Kies de Nederlandse taal