Programming Languages 3 (5 op)

Osaamistavoitteet (Opintojakso)

1. Student understands the basic nature of data structure and algorithms. 2. Student is able to use ready made data structures and algorithms. 3. Student is able to construct their own data structures and algorithms for more specific needs.

Sisältö (Opintojakso)

Data structures and algorithm design and implementation with Java programming language.

Esitietovaatimukset (Opintojakso)

Programming Languages 1

Arviointikriteerit, tyydyttävä (1-2) (Opintojakso)

Student knows the basics of data structures and algorithms. Student is able to use
readymade data structures and algorithms with guidance. Student is able to construct their own data structures and algorithms independently with guidance.

Arviointikriteerit, hyvä (3-4) (Opintojakso)

Student understands the basic nature of data structure and algorithms. Student is able to use
readymade data structures and algorithms. Student is able to construct their own data structures and algorithms independently for more specific needs.

Arviointikriteerit, kiitettävä (5) (Opintojakso)

Student understands in depth the basic nature of data structure and algorithms. Student is able to use readymade data structures and algorithms diversely in various situations. Student is able to construct their own data structures and algorithms independently for more specific needs diversely.

Aika ja paikka

This is shown in pakki (weekly schedule) and in lukkarikone.

Tenttien ja uusintatenttien ajankohdat

No exam

Arviointimenetelmät ja arvioinnin perusteet

Exercise activity and project will be graded between 0 – 5
Limits for exercise activity: 0% => 0p, 20% => 1p, 35% => 2p, 50% => 3p, 65% => 4p, 80% => 5p.

Total grade is the average of above weighted on how many weeks we spent both of them. Initial values for weights:
- exercise activity: 11
- small project: 4

Arviointiasteikko

0-5

Opiskelumuodot ja opetusmenetelmät

Lectures, exercises, small project.

Oppimateriaalit

John Lewis and Joseph Chase: Java Software Structures. Designing and Using Data Structures. 4th edition. Pearson 2014

Opiskelijan ajankäyttö ja kuormitus

1 op corresponds 27h student work.

Sisällön jaksotus

Introduction, Analysis of Algorithms
Introduction to Collections - Stacks
Linked Structures - Stacks
Queues: Queue ADT -> linked own queue + own array based queue
Lists: own lists (array based, linked version) 
Iterators
Recursion
Searching
Sorting: Selection, Insertion, Bubble
Sorting: Quick, Merge, Radix
Small project: searching and sorting test ped

Arviointikriteerit - hylätty (0) (Ei käytössä, kts Opintojakson Arviointikriteerit ylempänä)

Student knows very few of the things from the course and cannot apply them.

Arviointikriteerit - tyydyttävä (1-2) (Ei käytössä, kts Opintojakson Arviointikriteerit ylempänä)

Student knows some of the things from the course and can apply them with someone helping in it.

Arviointikriteerit - hyvä (3-4) (Ei käytössä, kts Opintojakson Arviointikriteerit ylempänä)

Student knows most of the things from the course and can apply them individually.

Arviointikriteerit - kiitettävä (5) (Ei käytössä, kts Opintojakson Arviointikriteerit ylempänä)

Student knows nearly all things from the course and can apply them in a creative and individual way. He/she can see new connections coming from the topics of this course and is active in thinking about applying them. He/she also is able to work actively in groups for the topics.