Ronnie Sundsten
Compendia on Moodle and open online material
The course is based on lectures, self-study and exercises in a classroom environment. The labs are compulsory, the theory lessons are not
Of the marks of the examination questions, you must obtain at least 30% in order to obtain a grade in the course, irrespective of the total score of the exams. 30% for pass, per exam. In total, 30% is applied for approved and linear scale.
Swedish
22.02.2021 - 02.05.2021
15.11.2020 - 28.02.2021
Faculty of Technology and Seafaring
Kaj Wikman
The course will provide the student with basic skills about data structures, their abstractions and associated algorithms. The course contains theoretical knowledge needed to develop and implement effective and stable programming solutions.
Degree Programme in Electrical Engineering and Automation
Vasa, Wolffskavägen 33
0.00 credits
0.00 credits
H-5
Spring 2021, Vasa
Spring 2021, Vasa
About 50% attendance studies and about 50% self-study.
At least 10p /30p.
Understand the concept and be able to rank common complexity measures and derive these from simple program designs.
At least 18p/30p.
Be able to derive complexity from more complex programs and algorithms, and perform measurements experimentally.Understand the coupling data structure algorithm, how the choice of one partially or completely determines the choice of the other, and how the combination of the two affects time and space complexity.
At least 26p/30p.
Understand how to choose among different solutions and implement optimal solution taking into account the present problems.
Be able to choose from a wide range of data structures and algorithms. Be able to find and use implementations of these in standard libraries, as well as have good skills in implementing them on their own in an efficient and well-structured way.