Data Structures and Algorithms (5 cr)

Evaluation scale

H-5

Content scheduling

Week 36: Course introduction

Session from Weeks 36 - 48
- Algorithms and algorithmic thinking
- Data structures
- Search algorithms
- Sorting algorithms

Contact hours according to lukkari.turkuamk.fi.

Objective

After completing the course the student can:
- explain the most common data structures
- apply the most common data structures and algorithms connected to the use of these structures
- evaluate the efficiency of algorithms.

Content

- lists, stacks, queues, trees, graphs and hash tables
- analysing and evaluating algorithms
- designing algorithms
- sorting methods
- search algorithms

Materials

Material available via the learning environment (ITS).

Teaching methods

Weekly contact 3 hours sessions for theory and practical exercises.
Additionally, if needed weekly 1h sessions for questions and support in exercises.

Exam schedules

No exam, and retake not possible after evaluation grade is published.

International connections

The course has 12 three-hour contact sessions where teacher present theory and examples and students work with practical tasks.
Additionally, students are able to receive extra guidance for exercises.

Electronic materials are used in the course. In addition, guidance is also organized online in order to reduce the carbon footprint caused by movement.

Completion alternatives

Not possible

Student workload

Contact hours
- Course introduction: 3 hours
- 13 times 2h theory: 13 x 2h = 26 hours
- 13 times 1h demo 13 x 1h = 13 hours - Group 1
- 13 times 1h demo 13 x 1h = 13 hours - - Group 2
- FLIP Classroom 10 X 1h = 10h
Home work:
- Working with assignments: approximately 80 hours


Total: approximately 130 hours

Qualifications

Introduction to Programming, or equivalent programming skills

Further information

ITS and Teams.