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)
|
|
|
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.
|
|