Opinto-opas

Tavoitteet

Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently.

Sisältö

- Lists, stack, queue
- Dictionaries
- Trees
- Sorting
- Searching
- Hashing
- Principles of algorithm analysis
- Collection classes of C#, Java or C++

Oppimateriaalit

Tiedot käytettävästä materiaalista ovat Moodlessa.

Opetusmenetelmät

Lähiopetus ja itsenäinen työskentely.

Opiskelijan ajankäyttö ja kuormitus

4 op * 27 h/op = 108 tuntia, josta on varattu lähiopetukseen noin kolmasosa ja itsenäiseen työskentelyyn noin kaksi kolmasosaa.

Arviointiasteikko

1-5

Arviointikriteerit, tyydyttävä (1)

Student can implement fundamental data structures and algorithms. Student can use lists and dictionaries, and algorithms associated to them.

Arviointikriteerit, hyvä (3)

Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms.

Arviointikriteerit, kiitettävä (5)

Student can implement fundamental data structures and algorithms and compare their properties. Student can use different data structures, such as lists, sets, dictionaries, trees and hashing, and algorithms associated to them. Student can develop applications, which utilizes different kind of data structures and algorithms efficiently. Student can analyze the running time of the algorithms.

Arviointimenetelmät ja arvioinnin perusteet

Aktiviteetit ja tentti.