Algorithms and Complexity

About this programme

In this course you will learn to develop and implement algorithms and analyze them with respect to correctness and efficiency; define the concepts P, NP, NP-completeness, undecidability, etc, to be able to identify and attack problems that are unrealistically resource demanding or not possible to solve, and to construct computer programs that use time and memory efficiently. The course consists of three elements; theory, individual assignment and practical exercises. The course is assessed through written examination, written and oral presentation of the practical exercises, and a home assignment and oral presentation of the assignment. To follow your passion. To be close to international career opportunities. To explore city and countryside. In Stockholm you can really get the best of both worlds. Here we explain all the different steps you need to go through when applying to a course or programme. Stockholm University arranges regular webinars and participates in educational fairs and events virtually and around the world to meet students and inform them about our study programmes. Every year Stockholm University welcomes thousands of international students from all over the world. Each bringing their own backpack full of experiences, expectations and dreams. Education and research are closely linked at Stockholm University. As a student, you will have direct contact with leading researchers in your field and access to the most recent scientific findings. Are you wondering what former students thought about your programme? Are you curious about what your education