Study Guide

Objectives (course unit)

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.

Content (course unit)

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

Prerequisites (course unit)

Programming Languages 1

Assessment criteria, satisfactory (1-2) (course unit)

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.

Assessment criteria, good (3-4) (course unit)

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.

Assessment criteria, excellent (5) (course unit)

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.

Location and time

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

Exam schedules

No exam

Assessment methods and criteria

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

Assessment scale

0-5

Teaching methods

Lectures, exercises, small project.

Learning materials

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

Student workload

1 op corresponds 27h student work.

Content scheduling

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

Assessment criteria - fail (0) (Not in use, Look at the Assessment criteria above)

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

Assessment criteria - satisfactory (1-2) (Not in use, Look at the Assessment criteria above)

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

Assessment criteria - good (3-4) (Not in use, Look at the Assessment criteria above)

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

Assessment criteria - excellent (5) (Not in use, Look at the Assessment criteria above)

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.