The Algorithms and Data Structures course multicomponent complexity and interdisciplinary connections

Gregory Korotenko and Leonid Korotenko
Additional contact information
Gregory Korotenko: Dnipro University of Technology, Ukraine
Leonid Korotenko: Dnipro University of Technology, Ukraine

Technium, 2020, vol. 2, issue 5, 161-171

Abstract: The experience of modern education shows that the trajectory of preparing students is extremely important for their further adaptation in the structure of widespread digitalization, digital transformations and the accumulation of experience with digital platforms of business and production. At the same time, there continue to be reports of a constant (catastrophic) lack of personnel in this area. The basis of the competencies of specialists in the field of computing is the ability to solve algorithmic problems that they have not been encountered before. Therefore, this paper proposes to consider the features of teaching the course Algorithms and Data Structures and possible ways to reduce the level of complexity in its study

Date: 2020
References: Add references at CitEc
Citations:

Downloads: (external link)
https://techniumscience.com/index.php/technium/article/view/1310 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:tec:techni:ojs:1310

DOI: 10.47577/technium.v2i5.1310

Access Statistics for this article

Technium is currently edited by Scurtu Ionut Cristian

More articles in Technium from Technium Science
Bibliographic data for series maintained by Ana Maria Golita ().