Data Structures and Algorithms (5 cr)

Objective

The student
• is familiar with the most common data structures and some of the key algorithms used in data processing
• has a practical feel for the design and computational complexity of algorithms
• is familiar with the ready-made data structure implementations offered by libraries in one of the programming languages.

Content

• Abstract data type: interface and implementation
• Iterativeness vs. recursivity
• Time and space requirements
• Linked lists
• Stack and queue
• Trees
• Graphs
• Search techniques
• Sorting algorithms
• Algorithm types
• General purpose data structure libraries (list, map, set)

Evaluation scale

0-5

Assessment criteria, satisfactory (1)

The student
• has achieved the objectives of the course to a satisfactory level
• is able to identify, define and use concepts and models in the subject area of the course
• has completed the learning tasks required for the course to the minimum standard.

Assessment criteria, good (3)

The student
• has achieved the objectives of the course well
• is able to identify, define and use concepts and models in the subject area of the course
• has completed the learning tasks of the course at a good level.

Assessment criteria, excellent (5)

The student
• has achieved the objectives of the course with excellent marks
• is able to identify, define, use and apply concepts and models in the subject area of the course in a variety of ways
• has completed the learning tasks of the course at an excellent level and has put considerable own effort into them.

Assessment criteria, approved/failed

The student
• has achieved the objectives of the course
• is able to identify, define and use concepts and models in the subject area of the course
• has completed the learning tasks required for the course.

Qualifications

Object-oriented Programming