Banca de DEFESA: MARCILIO DANIEL DE CASTRO PEREIRA

Uma banca de DEFESA de MESTRADO foi cadastrada pelo programa.
STUDENT : MARCILIO DANIEL DE CASTRO PEREIRA
DATE: 10/02/2022
TIME: 14:00
LOCAL: Ambiente Remoto
TITLE:

Graph and the shortest path problem: algorithm and programming in Pascal.

KEY WORDS:

Mathematics, High School, Graphs Theory, Shortest Paths, Algorithm, Pascal, Dijkstra, Bellman-Ford

PAGES: 151
BIG AREA: Ciências Exatas e da Terra
AREA: Matemática
SUMMARY:

This work aims to bring a teaching proposal to high school classes addressing a
specific topic of Graph Theory that deals with shortest paths and the Dijkstra and
Bellman-Ford algorithms used to determine them. As algorithms are something
abstract, it was decided to bring to the present work notions of the Pascal
programming language, a language of easy understanding for beginning
programmers. In this work, students will have contact with the Pascal programming
language, will know the origin and importance of Graph Theory and will have access
to the theory's basic notion, presuppositions for the study of shortest paths, their
algorithms and related Pascal programs. Activities related to the daily lives of
students were proposed, in order to provide mastery of the basic concepts of both
the Pascal programming language and Graph theory, in particular, algorithms aimed
at solving problems involving shortest paths. Finally, a change in the behavior of the
student is expected in the search for the new.

BANKING MEMBERS:
Presidente - 2620902 - VINICIUS LEAL DO FORTE
Interno - 1633341 - MONTAUBAN MOREIRA DE OLIVEIRA JUNIOR
Externa à Instituição - MARILIS BAHR KARAM VENCESLAU - CPII