Data Structures and Algorithms (4 cr)

Evaluation scale

0-5

Content scheduling

Tunneilla käydään läpi koko tietorakenteet ja algoritmit aihealue, kuusi kotitehtäväkertaa, Harjoitustyö käynnistetään ennen itseopiskeluviikkoa. Jakson loppupuolella on mahdollista saada ohjausta harjoitustyön teossa.

Objective

The student is able to describe and analyze algorithms as well as assess their functionality and efficiency in various situations. In addition, the student knows the basic data structures and is able to choose the applicable algorithms regardless of language and platform.

Content

The course introduces various types of algorithms and the most common algorithms. The measurement for the efficiency of algorithms is learned with the help of the most essential algorithms. The algorithm types are discussed starting from basic data structures and delving into the more complex (trees and graphs) implementations. The course focuses on the features of various types of algorithms and data structures regardless of implementation language or platform

Materials

Materials in the e-learning environment.

Teaching methods

- lectures
- independent study
- distance learning
- webinars
- small group learning
- exercises
- learning tasks
- seminars
- pandemic may affect the course management

Exam schedules

The possible date and method of the exam will be announced in the course opening. Pandemic may affect the course management.

Completion alternatives

The admission procedures are described in the degree rule and the study guide. The teacher of the course will give you more information on possible specific course practices.

Student workload

One credit (1 Cr) corresponds to an average of 27 hours of work.

- lectures 36 h
- learning project and seminar 28 h
- independent study 44 h

Total 108 h

Assessment criteria, satisfactory (1)

Excellent 5: The student has wide knowledge on fundamental terms related to data structures and algorithms. The student knows data structures presented during the course and is able to understand their applications. The student is able to create an algorithm with versatile use of data structures. The student is able to analyze the function of an algorithm and assess its performance. The student is able to choose and validate the most applicable algorithm for a problem-solving situation and its data structures.

Very good 4: The student has knowledge on fundamental terms related to data structures and algorithms. The student knows data structures presented during the course and is able to understand their applications. The student is able to create an algorithm with versatile use of data structures. The student is able to analyze the function of algorithm and assess its performance.

Good 3: The student has knowledge on fundamental terms related to data structures and algorithms. The student knows the linear data structures and most of the more complex data structures presented during the course. In addition, the student understands the applications of linear data structures. The student is able to create an algorithm that utilizes some particular data structure. The student is able to analyze the function of algorithm and assess its performance.

Satisfactory 2: The student knows most necessary terms related to data structures and algorithms. The student knows the linear data structures and their applications presented during the course. The student is able to analyze the function of a simple algorithm and assess its performance.

Sufficient 1: The student knows the most necessary terms related to data structures and algorithms. The student knows the fundamental linear data structures and their applications presented during the course. The student is able to analyze the function of a simple algorithm and assess its performance.

Fail 0: The student does not meet the minimum criteria set for the course.

Assessment criteria, good (3)

Good 3: The student has knowledge on fundamental terms related to data structures and algorithms. The student knows the linear data structures and most of the more complex data structures presented during the course. In addition, the student understands the applications of linear data structures. The student is able to create an algorithm that utilizes some particular data structure. The student is able to analyze the function of algorithm and assess its performance.

Very good 4: The student has knowledge on fundamental terms related to data structures and algorithms. The student knows data structures presented during the course and is able to understand their applications. The student is able to create an algorithm with versatile use of data structures. The student is able to analyze the function of algorithm and assess its performance.

Assessment criteria, excellent (5)

Excellent 5: The student has wide knowledge on fundamental terms related to data structures and algorithms. The student knows data structures presented during the course and is able to understand their applications. The student is able to create an algorithm with versatile use of data structures. The student is able to analyze the function of an algorithm and assess its performance. The student is able to choose and validate the most applicable algorithm for a problem-solving situation and its data structures.

Qualifications

Basics of Programming

Further information

Arviointi perustuu kokonaisuuteen, joka koostuu seuraavista osasuorituksista:

- Kotitehtävät 9p
- Harjoitustyö 11p
- Tentti 18p, minimiraja 6 pistettä

Arvosana määräytyy (1-5) lineaarisella jaolla yhteispisteistä välillä:
14 - 38 pistettä, Alle 14p on hylätty suoritus. Tentin minimipisteet on 6 pistettä.Hylätyn suorituksen tapauksessa tentti on mahdollista uusia enintään kaksi kertaa.