Knowledge

The student...

has knowledge about types of data structures; major operations; data structure algorithm; introducing abstract data types like linear data structures such as an array, linked list, stack, queue; non-linear data structures such as a tree, graph; and asymptotic analysis.
can understand and be able to apply the basic principles of algorithm analysis to observe the usability of a number of resources.
can be familiar with searching algorithms such as linear search, binary search, and search in binary search trees.
can be familiar with sorting algorithms such as Bubble sort, Quicksort and Merge sort, and know the structure, operation, and use of recursive functions by the Fibonacci series.
can be familiar with traversing graphs with Depth-First and Breadth-First algorithms.
can understand the theory of P, NP, and NP-complete problems.

Skills

The student...

can use the knowledge mentioned in the section above (knowledge objectives) to use existing libraries for algorithms and data structures in a sensible way
can implement familiar data structures such as tabular lists, linked lists, binary search trees, and graphs
can implement well-known algorithms such as Bubble sort, Quicksort and Merge Sort
can assess worst-case resource use for specific computer programs using O notation
masters basic java programming, as well as the use of interfaces and implementations of interfaces, for efficient use of algorithms in code

General competence

The student...

has good understanding about asymptotic analysis of computer programs with O notation
can use existing libraries and self-developed algorithms and data structures in a wise way
has understanding of the 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 will be useful in further computer science studies and working life

Subject description PG4200

Algorithms and Data Structures