Algorithms and Data Structures in Software Development
level of course unit
Bachlor
Learning outcomes of course unit
Students are able to,
- Use algorithms appropriately depending on the application,
- Apply algorithms independently for problems,
- Compare algorithms in terms of their complexity,
- Select suitable data structures for given problems
- Create data structures independently,
- Apply algorithms to different data structures and
- Use libraries for standard algorithms and data structures
prerequisites and co-requisites
Successfully completed courses of the previous semester.
course contents
- Students can differentiate between algorithms and data structures with regard to their complexities
- Students are familiar with sorting algorithms and can choose suitable ones for their problems
- Students are familiar with search algorithms and can choose suitable ones for their problems
- Students are able to create their own efficient algorithms and data structures
- Students know standard libraries for algorithms and data structures and are able to use them
recommended or required reading
- Sedgewick, R.; Wayne, K.: Algorithmen: Algorithmen und Datenstrukturen - Pearson Studium - IT, 2014.
- Cormen, T.; Leiserson, C.; Rivest, R.; Stein, C.; Molitor, P.: Algorithmen - Eine Einführung - De Gruyter, 2013.
- Saake, G.; Sattler, K.-U.: Algorithmen und Datenstrukturen: Eine Einführung mit Java - dpunkt.verlag GmbH, 2013.
assessment methods and criteria
Portfolio assessment
language of instruction
German
number of ECTS credits allocated
5
eLearning quota in percent
30
course-hours-per-week (chw)
3
planned learning activities and teaching methods
Lecture, group work, presentation and discussion of (practical) tasks
semester/trimester when the course unit is delivered
2
name of lecturer(s)
Prof (FH) Lukas Demetz, PhD
course unit code
ENG3
type of course unit
integrated lecture
mode of delivery
Compulsory