Data structures and algorithms
Structure Type: | Course |
Code: | KL04BT51010 |
Level: | Bachelor |
Credits: | 4.0 points |
Responsible Teacher: | Mäkelä, Petteri |
---|
Language of Instruction: | Finnish |
Course Implementations, Planned Year of Study and Semester
Curriculum   | Semester   | Credits   | Start of Semester   | End of Semester |
TITE-2013   |
2 spring   |
4.0   |
2015-01-02   |
2015-07-31   |
TITE-2014   |
2 spring   |
4.0   |
2016-01-01   |
2016-07-31   |
TITE-2015   |
2 spring   |
4.0   |
2017-01-01   |
2017-07-31   |
TITE-2016   |
2 spring   |
4.0   |
2018-01-01   |
2018-07-31   |
Learning Outcomes
Students can utilize the data structures and algorithms in software engineering.
Student's Workload
Sceduled studies 52 h, autonomous studies 52 h
Prerequisites / Recommended Optional Courses
Basics of programming
Contents
- Array, ring buffer, linked list, queue, stack, tree structures
- Sorting and search algorithms
- Collection classes in C# or Java
Recommended or Required Reading
Lecture materials.
Vesterholm M. and Kyppö J. 2008 or later edition. Java-ohjelmointi. Talentum Media Oy.
Additional reading: Lafore R. Data structures and algorithms in Java. Sams Publishing. ISBN 0-672-32453-9
Mode of Delivery / Planned Learning Activities and Teaching Methods
Lectures and exercises
Assessment Criteria
- excellent (5): The student can utilize the learned skills in demanding project assignment
- good (3-4) The student can apply the most important data structures and algorthms in his assignments
- satisfactory (1-2) The student knows the basics
Assessment Methods
Exercises, assignment and an examination
Back