Study Guide

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