Knowledge

The student...

is familiar with key abstract data types such as lists, stacks, queues, sets, collections, maps, trees and graphs.
is familiar with the characteristics of central data structures such as arrays, linked lists, heaps, trees, hash tables and graphs.
knows about Generics and Streams.
knows central search algorithms such as linear search, binary search, binary search tree search, hash table search.
is familiar with key sorting algorithms such as Bubble Sort, Quicksort and Merge Sort.
is familiar with graph traverse methods, as well as Depth-First and Breadth-First search.
is familiar with the structure, operation and use of recursive functions.
is familiar with issues related to measuring runtime for computer programs.
knows about P, NP and NP complete problems.
is familiar with Regular Expressions.

Skills

The student...

is able to use the knowledge mentioned in the section above (knowledge goals) to use existing libraries for algorithms and data structures in a sensible way.
is able to implement known data structures such as table lists, linked lists, binary search trees, heaps, hash tables and graphs.
is able to implement known algorithms such as Bubble Sort, Quicksort and Merge Sort.
is able to judge worst-case scenarios for specific computer programs using Big O notation.
masters basic generic programming, as well as the use of interfaces and interface implementations, for efficient use of code algorithms.
is able to compare empirical measurements of resource use with theoretical estimates, with a view to assessing whether the estimates are correct, to identify interesting deviations and to estimate the magnitude of unknown factors in the estimates.

General competence

The student...

masters classical asymptotic analysis of computer programs with Big O notation.
is able to use existing libraries and proprietary algorithms and data structures wisely.
master terminology that makes it possible to discuss resource use in computer programs in a sufficiently precise manner.
possesses knowledge of algorithms and data structures that are useful in further informatics studies and working life.

Subject description PG4200

Algorithms and Data Structures