Puzzles As Excellent Tool Supporting Graph Problems Understanding

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F62690094%3A18470%2F14%3A50002490" target="_blank" >RIV/62690094:18470/14:50002490 - isvavai.cz</a>

Výsledek na webu

<a href="http://dx.doi.org/10.1016/j.sbspro.2014.04.100" target="_blank" >http://dx.doi.org/10.1016/j.sbspro.2014.04.100</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.sbspro.2014.04.100" target="_blank" >10.1016/j.sbspro.2014.04.100</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Puzzles As Excellent Tool Supporting Graph Problems Understanding

Popis výsledku v původním jazyce

The main aim of the subjects dealing with graph theory and combinatorial optimization is to develop and deepen students? capacity for logical and algorithmic thinking. Usually, after learning of basic graph concepts students are introduced to more complex algorithms with a polynomial time complexity at first. On the one hand, usually, there are more methods, which can be used for solving the same graph-problem, while on the other hand, using effective modifications of one algorithm, methods of solving various other tasks can be devised. To engage students to the subject a particular problem with a real life example or puzzle is introduced as a prototype of the explained concept or algorithm and suitable graph-representation of a problem is discussed. In the paper we devote attention to the role of puzzles as a useful study material supporting understanding of graph algorithms. On a case study we introduce puzzles, going from a simple to more complex one, as an appropriate Breadth-First

Název v anglickém jazyce

Puzzles As Excellent Tool Supporting Graph Problems Understanding

Popis výsledku anglicky

The main aim of the subjects dealing with graph theory and combinatorial optimization is to develop and deepen students? capacity for logical and algorithmic thinking. Usually, after learning of basic graph concepts students are introduced to more complex algorithms with a polynomial time complexity at first. On the one hand, usually, there are more methods, which can be used for solving the same graph-problem, while on the other hand, using effective modifications of one algorithm, methods of solving various other tasks can be devised. To engage students to the subject a particular problem with a real life example or puzzle is introduced as a prototype of the explained concept or algorithm and suitable graph-representation of a problem is discussed. In the paper we devote attention to the role of puzzles as a useful study material supporting understanding of graph algorithms. On a case study we introduce puzzles, going from a simple to more complex one, as an appropriate Breadth-First

Druh

D - Stať ve sborníku

CEP obor

AM - Pedagogika a školství

OECD FORD obor

—

Projekt

—

Návaznosti

S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2014

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

Procedia - social and behavioral sciences

ISBN

—

ISSN

1877-0428

e-ISSN

—

Počet stran výsledku

5

Strana od-do

177-181

Název nakladatele

Elsevier

Místo vydání

Amsterdam

Místo konání akce

Antalya, Turkey

Datum konání akce

7. 11. 2013

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

WRD - Celosvětová akce

Kód UT WoS článku

000341324800032