A Practical Approach to the Time Complexity of Algorithms

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

A Practical Approach to the Time Complexity of Algorithms

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

A Practical Approach to the Time Complexity of Algorithms

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2019

Kód důvěrnosti údajů

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

Název statě ve sborníku

2019 29th EAEEIE Annual Conference, EAEEIE 2019

ISBN

978-1-72813-222-8

ISSN

2376-4198

e-ISSN

2472-7687

Počet stran výsledku

5

Strana od-do

"Article number 9000428"

Název nakladatele

IEEE

Místo vydání

Piscataway

Místo konání akce

Ruse, Bulgaria

Datum konání akce

4. 9. 2019

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—