Graph Theory at Czech Grammar Schools

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F11%3A10109893" target="_blank" >RIV/00216208:11320/11:10109893 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Graph Theory at Czech Grammar Schools

Popis výsledku v původním jazyce

Graph theory is not being taught on Czech grammar schools, just as Computer science. The reasons seem to be rather historical than rational. In this contribution, we discuss the usefulness of elementary Graph theory for grammar school students. Then we formulate possible targets and objectives of this education. Core of this contribution is topological sorting. It is an example of an advanced topic in graph theory, which is still comprehensible for grammar school students. Moreover, it is potentially useful in their life also out of school. We explain the problem, its applications, and three approaches to the solution along with comments regarding introduction of such topic into grammar schools. Last part of this contribution explains the critical pathmethod, another advanced topic strongly bond to the idea of representing tasks as graphs.

Název v anglickém jazyce

Graph Theory at Czech Grammar Schools

Popis výsledku anglicky

Graph theory is not being taught on Czech grammar schools, just as Computer science. The reasons seem to be rather historical than rational. In this contribution, we discuss the usefulness of elementary Graph theory for grammar school students. Then we formulate possible targets and objectives of this education. Core of this contribution is topological sorting. It is an example of an advanced topic in graph theory, which is still comprehensible for grammar school students. Moreover, it is potentially useful in their life also out of school. We explain the problem, its applications, and three approaches to the solution along with comments regarding introduction of such topic into grammar schools. Last part of this contribution explains the critical pathmethod, another advanced topic strongly bond to the idea of representing tasks as graphs.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

—

Návaznosti

V - Vyzkumna aktivita podporovana z jinych verejnych zdroju

Rok uplatnění

2011

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

WDS'11 Proceedings of Contributed Papers: Part I ? Mathematics and Computer Sciences

ISBN

978-80-7378-184-2

ISSN

—

e-ISSN

—

Počet stran výsledku

6

Strana od-do

78-84

Název nakladatele

Matfyzpress

Místo vydání

Praha

Místo konání akce

Praha

Datum konání akce

31. 5. 2011

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

CST - Celostátní akce

Kód UT WoS článku

—