Algorithms, Data Structures, and Problem Solving

Contact

Lecturer

Masoumeh Taromirad

• Office: E 308
• Telephone 035 16 71 87
• Email: [m.taromiradi@hh.se]

Lab Instructors

Süleyman Savaş

• Office: E 321
• Email: [suleyman.savas@hh.se]

Objectives

On completion of the course students will be able to

• explain how to estimate the execution time of programs
• recognise techniques for algorithm design such as divide and conquer, recursion, dynamic programming
• recognise data structures and algorithms for search and sorting, such as quick sort, binary search trees, hash tables
• identify the need and use data structures as modules to solve larger problems
• use techniques for algorithm design in solving larger problems
• judge how suitable a program is given its execution time
• choose adequate implementations of data structures from program libraries

Assessment

Examination consists of two elements: written examination of the theory, and project results presented as distributable source archives and with a written report.

Course Material and Resources

Slides and Handouts

Lecture	Handouts / Slides	Other Material
Lecture 1: Introduction August 29, 10:15 || Slides ||