Study Guide

Objective

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.

Content

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

Materials

To be announced at the beginning of the course

Teaching methods

Lectures and exercises

Exam schedules

The exam is in the last lesson

Student workload

Lectures 37 %, independent studying 63 %.

Evaluation scale

1-5

Assessment criteria, satisfactory (1)

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

Assessment criteria, good (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.

Assessment criteria, excellent (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.

Assessment methods and criteria

Exam 75 % and exercises 25 %

Qualifications

Basics of programming