A Practical Approach to the Time Complexity of Algorithms

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18450%2F19%3A50015953" target="_blank" >RIV/62690094:18450/19:50015953 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1109/EAEEIE46886.2019.9000428" target="_blank" >http://dx.doi.org/10.1109/EAEEIE46886.2019.9000428</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1109/EAEEIE46886.2019.9000428" target="_blank" >10.1109/EAEEIE46886.2019.9000428</a>

Result language
angličtina
Original language name
A Practical Approach to the Time Complexity of Algorithms
Original language description
Rapid development of information technology brings along the constant need for inclusion of new and attractive modules into ICT specialist curricula and there quite common attempts to reduce less attractive parts of ICT curricula and, unfortunately, theoretical subjects are very often among the candidates for possible cuts or even replacements by something more applicable. We believe that the theoretical foundations of computer science are very important and that there is a possibility to persuade our students that they must be aware of the theoretical principles in order to become a real specialist in this field. This paper describes our approach taken to teaching the module of algorithms complexity with a special focus on the types of practical examples utilized to demonstrate the usefulness and applicability of the theory of algorithms complexity.
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year
2019
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)