Skip to main content

Data Structures and AlgorithmsLaajuus (5 cr)

Code: 5G00EU64

Credits

5 op

Objectives

The students become familiar with the basic concepts and methods of the course. He will be familiar with the basic data structures and algorithms going through the course.

Content

Basic concepts related to data structures and algorithms. Basic information structures: stacks, queues, lists, trees and nets. The key search and sorting algorithms as well as algorithms related to tree and network utilization are discussed. Devolution.

Assessment criteria, satisfactory (1-2)

Student
-Knows some algorithms
- Is able to identify some of the basic data structures such as stacks, queues, lists, trees and nets
- can apply the course subjects with help

Assessment criteria, good (3-4)

Student
- Knows Algorithms such as Key Search and Sort Algorithms and Algorithms for Tree and Net Exploitation
- Is able to identify basic data structures such as stacks, queues, lists, trees and nets
-The Principles of Decentralization
- can apply course subjects

Assessment criteria, excellent (5)

The student
- Knows the above mentioned things at an excellent level and fluently. In addition, the student
- -Is able to apply the pathway structures and algorithms smoothly and appropriately in the construction of information systems
- Has the ability to develop your own variants of data structures as needed and find the most suitable data structures / algorithms

Enrolment period

24.11.2024 - 12.01.2025

Timing

01.01.2025 - 30.04.2025

Credits

5 op

Mode of delivery

Contact teaching

Unit

ICT Engineering

Campus

TAMK Main Campus

Teaching languages
  • Finnish
Degree programmes
  • Degree Programme in ICT Engineering
Teachers
  • Erkki Hietalahti
Person in charge

Erkki Hietalahti

Groups
  • 23I224

Objectives (course unit)

The students become familiar with the basic concepts and methods of the course. He will be familiar with the basic data structures and algorithms going through the course.

Content (course unit)

Basic concepts related to data structures and algorithms. Basic information structures: stacks, queues, lists, trees and nets. The key search and sorting algorithms as well as algorithms related to tree and network utilization are discussed. Devolution.

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

Student
-Knows some algorithms
- Is able to identify some of the basic data structures such as stacks, queues, lists, trees and nets
- can apply the course subjects with help

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

Student
- Knows Algorithms such as Key Search and Sort Algorithms and Algorithms for Tree and Net Exploitation
- Is able to identify basic data structures such as stacks, queues, lists, trees and nets
-The Principles of Decentralization
- can apply course subjects

Assessment criteria, excellent (5) (course unit)

The student
- Knows the above mentioned things at an excellent level and fluently. In addition, the student
- -Is able to apply the pathway structures and algorithms smoothly and appropriately in the construction of information systems
- Has the ability to develop your own variants of data structures as needed and find the most suitable data structures / algorithms

Assessment scale

0-5

Enrolment period

22.11.2023 - 12.01.2024

Timing

08.01.2024 - 30.04.2024

Credits

5 op

Mode of delivery

Contact teaching

Unit

ICT Engineering

Campus

TAMK Main Campus

Teaching languages
  • Finnish
Degree programmes
  • Degree Programme in ICT Engineering
Teachers
  • Erkki Hietalahti
Person in charge

Erkki Hietalahti

Groups
  • 22I224

Objectives (course unit)

The students become familiar with the basic concepts and methods of the course. He will be familiar with the basic data structures and algorithms going through the course.

Content (course unit)

Basic concepts related to data structures and algorithms. Basic information structures: stacks, queues, lists, trees and nets. The key search and sorting algorithms as well as algorithms related to tree and network utilization are discussed. Devolution.

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

Student
-Knows some algorithms
- Is able to identify some of the basic data structures such as stacks, queues, lists, trees and nets
- can apply the course subjects with help

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

Student
- Knows Algorithms such as Key Search and Sort Algorithms and Algorithms for Tree and Net Exploitation
- Is able to identify basic data structures such as stacks, queues, lists, trees and nets
-The Principles of Decentralization
- can apply course subjects

Assessment criteria, excellent (5) (course unit)

The student
- Knows the above mentioned things at an excellent level and fluently. In addition, the student
- -Is able to apply the pathway structures and algorithms smoothly and appropriately in the construction of information systems
- Has the ability to develop your own variants of data structures as needed and find the most suitable data structures / algorithms

Assessment scale

0-5

Enrolment period

15.12.2022 - 22.01.2023

Timing

09.01.2023 - 28.04.2023

Credits

5 op

Mode of delivery

Contact teaching

Unit

ICT Engineering

Campus

TAMK Main Campus

Teaching languages
  • Finnish
Seats

0 - 50

Degree programmes
  • Degree Programme in ICT Engineering
Teachers
  • Erkki Hietalahti
Person in charge

Erkki Hietalahti

Groups
  • 21I224

Objectives (course unit)

The students become familiar with the basic concepts and methods of the course. He will be familiar with the basic data structures and algorithms going through the course.

Content (course unit)

Basic concepts related to data structures and algorithms. Basic information structures: stacks, queues, lists, trees and nets. The key search and sorting algorithms as well as algorithms related to tree and network utilization are discussed. Devolution.

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

Student
-Knows some algorithms
- Is able to identify some of the basic data structures such as stacks, queues, lists, trees and nets
- can apply the course subjects with help

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

Student
- Knows Algorithms such as Key Search and Sort Algorithms and Algorithms for Tree and Net Exploitation
- Is able to identify basic data structures such as stacks, queues, lists, trees and nets
-The Principles of Decentralization
- can apply course subjects

Assessment criteria, excellent (5) (course unit)

The student
- Knows the above mentioned things at an excellent level and fluently. In addition, the student
- -Is able to apply the pathway structures and algorithms smoothly and appropriately in the construction of information systems
- Has the ability to develop your own variants of data structures as needed and find the most suitable data structures / algorithms

Assessment scale

0-5

Enrolment period

15.11.2021 - 16.01.2022

Timing

03.01.2022 - 29.04.2022

Credits

5 op

Mode of delivery

Contact teaching

Unit

ICT Engineering

Campus

TAMK Main Campus

Teaching languages
  • Finnish
Degree programmes
  • Degree Programme in ICT Engineering
Teachers
  • Erkki Hietalahti
Person in charge

Erkki Hietalahti

Groups
  • 20I224

Objectives (course unit)

The students become familiar with the basic concepts and methods of the course. He will be familiar with the basic data structures and algorithms going through the course.

Content (course unit)

Basic concepts related to data structures and algorithms. Basic information structures: stacks, queues, lists, trees and nets. The key search and sorting algorithms as well as algorithms related to tree and network utilization are discussed. Devolution.

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

Student
-Knows some algorithms
- Is able to identify some of the basic data structures such as stacks, queues, lists, trees and nets
- can apply the course subjects with help

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

Student
- Knows Algorithms such as Key Search and Sort Algorithms and Algorithms for Tree and Net Exploitation
- Is able to identify basic data structures such as stacks, queues, lists, trees and nets
-The Principles of Decentralization
- can apply course subjects

Assessment criteria, excellent (5) (course unit)

The student
- Knows the above mentioned things at an excellent level and fluently. In addition, the student
- -Is able to apply the pathway structures and algorithms smoothly and appropriately in the construction of information systems
- Has the ability to develop your own variants of data structures as needed and find the most suitable data structures / algorithms

Assessment scale

0-5