Search

Algorithms and Data Structures I

Field	Work language	Acad. cycle	ECTS credits	Semester	Course code
Computer Sciences	LV ENG	Bachelor	3	Spring	DatZ2881

Subject Aim

To provide knowledge about the most frequently used data structures, their processing algorithms and methods of implementation on a computer.

Subject Content

During the course the knowledge of the most used data structures and its processing algorithms are provided. In a theoretical part of the course the linear (list, stack, queue) and non-linear (binary tree, binary search tree) data structures are considered. Practical training is devoted to development programming skills in C ++ language using the knowledge received in the theoretical part.

Expected Results

Completing the course students will:

•      Will know in level of use about elementary data structures and their processing algorithms;

•      Will be able to write code and debug the program;

•      Will be able to project algorithms and data structures;

•      Will be able to work independently;

•      Will be able to write code within constructing algorithms;

•      • Will be able to write code while reading and analyzing extraneous program texts (code)

Requirements to gain ECTS

Test

Practical works are done independently, within the defined terms and submitted to the teacher (40%)

2 tests per semester (40%)

At the end of the semester there is a test concerning topics covered by the course (20%)