| Course title |
Algorithms and Data Structures |
| Acronym |
IR2ASP |
| Study programme |
Electrical Engineering and Computing |
| Module |
Computer Engineering and Informatics |
| Type of study |
bachelor academic studies |
| Lecturer (for classes) |
|
| Lecturer/Associate (for practice) |
|
| Lecturer/Associate (for OTC) |
|
| ESPB |
6.0 |
Status |
mandatory |
| Condition |
|
| The goal |
Teaching students the logic organization and memory representation of linear and non - linear data structures, basic operations and their typical application.
Teaching students the algorithms and corresponding data structures used for searching and sorting and their implementation in a particular programming language |
| The outcome |
This course should learn the student to implement the linear and nonlinear data structures as well as the algorithms that use them in typical applications. In addition, the student should also be able for program implementation of searching and sorting algrithms and for solving of the pratical problems. |
