Data Structures and Algorithms (3 cr)
Code: TT00CD83-3006
General information
- Timing
-
25.08.2025 - 23.11.2025
The implementation has not yet started.
- Number of ECTS credits allocated
- 3 cr
- Local portion
- 3 cr
- Mode of delivery
- Face-to-face
- Unit
- School of Technology
- Campus
- Lutakko Campus
- Teaching languages
- English
- Seats
- 0 - 35
- Degree programmes
- Bachelor's Degree Programme in Information and Communications Technology
- Teachers
- Juha Peltomäki
- Groups
-
TIC24S2Bachelor's Degree Programme in Information and Communications Technology
- Course
- TT00CD83
Evaluation scale
0-5
Objective
The course provides a strong foundation for knowing and analyzing algorithms and data structures. You will learn search and sorting algorithms and abstract data structures, such as lists, tables, queues, and stacks.
EUR-ACE Knowledge and Understanding
You know the key concepts related to algorithms and their implementation. You know the most central abstract data structures.
EUR-ACE Engineering practice
You know how to choose the data structures suitable for the implementation of the algorithm. You know how to evaluate the implementation and efficiency of an algorithm.
Content
This course will give you a strong foundation in the knowledge and analysis of algorithms and data structures. You will learn about key search and ordering algorithms and abstract data structures such as lists, tables, queues and stacks. You will be able to select the appropriate data structures for an algorithm implementation and evaluate their performance. This course will give you the skills to solve complex problems efficiently and creatively.
algorithm types
efficiency classification and analysis of algorithms
search and sorting algorithms
abstract data structures
lists and arrays
queue and stack
linked list
trees
Location and time
The course will be implemented in the autumn semester of 2025.
Materials
Materials in the e-learning environment.
Teaching methods
- lectures
- independent study
- distance learning
- assignments
- optional project
Completion alternatives
The admission procedures are described in the degree rule and the study guide. The teacher of the course will give you more information on possible specific course practices.
Student workload
One credit (1 Cr) corresponds to an average of 27 hours of work.
- lectures 20 h
- assignments 46 h
- independent study 15 h
Total 81 h
Assessment criteria, satisfactory (1)
Sufficient (1)
You know the algorithm concept. You recognize abstract data structures. You know how to implement an algorithm with some data structure.
Satisfactory (2)
You know concepts related to algorithms and their implementation. You know the most common linear data structures. You know how to implement an algorithm with some data structure. You can evaluate the implementation of a simple algorithm.
Assessment criteria, good (3)
Good (3)
You know the key concepts related to algorithms and their implementation. You are familiar with the most central abstract data structures. You can implement the algorithm with the selected data structure. You know how to evaluate algorithm implementation and measure efficiency.
Very good (4)
You know the concepts related to algorithms and their implementation. You are familiar with the operating principles of abstract data structures. You recognize the data structures that are well suited to the implementation of the algorithm. You can analyze the implementation and efficiency of the algorithm.
Assessment criteria, excellent (5)
Excellent (5)
You know the concepts related to algorithms and their implementation. You can recommend abstract data structures suitable for the problem. You know how to choose the data structures best suited to the implementation of the algorithm. You know how to analyze the implementation of the algorithm and, if necessary, improve its efficiency.
Qualifications
Basics of Programming
Further information
The evaluation is based on a set of the following assignment types:
- Assignments
- Practice Work