Algorithms
Master
In Bergen (Norway)
Description
-
Type
Master
-
Location
Bergen (Norway)
-
Duration
2 Years
-
Start date
Different dates available
A Master's degree in informatics with a specialization in algorithms has a focus on the development and improvements of algorithms and computer programs, so that problems and challenges can be solved in the best and fastest way on computers. The aim is to find the best and most effective methodology, either through analysis, or through practical testing.
This Master's degree programme also includes fundamental aspects of algorithms, such as identification of problems that are hard to solve on computers. In these situations, development of alternative solutions is the main focus.
Programme profile
The members of the Algorithms Research Group are active participants in the international research community, as can be seen from our publication list. We are regularly involved in the main international algorithms conferences, both as participants, members of program committees, and as organizers.
Several of our research projects, both individual and joint, are externally funded.
Facilities
Location
Start date
Start date
About this course
Is able to work independently and in groups with others.
Has a critical and analytical view of his/her own work and that of others.
Is able to evaluate ethical aspects of his/her own projects.
Reviews
This centre's achievements
All courses are up to date
The average rating is higher than 3.7
More than 50 reviews in the last 12 months
This centre has featured on Emagister for 5 years
Subjects
- Algorithms
- International
- Knowledge
- Competence
- Learning
- Analyze
- Bottlenecks
- Polynomial
- Efficient
- Techniques
Course programme
- A candidate who has completed his or her qualification should have the following learning outcomes defined in terms of knowledge skills and general competence:
The candidate
- Can analyze code and algorithms
- Can implement algorithms
- Can assess the suitability of an algorithm
- Can develop efficient algorithms for problems that can be solved in polynomial time
- Can use techniques to handle difficult problems
The candidate
- Can analyze code and algorithms to find bottlenecks, and then know how to handle them.
- Can implement algorithms rapidly and efficiently.
- Can decide if a given algorithm is suitable for its intended purpose.
- Can distinguish between problems that can and those that most likely cannot be solved in polynomial time.
- Can develop efficient algorithms for problems that can be solved in polynomial time.
- Can use the most common techniques for handling difficult problems.
Algorithms