Undergraduate Students’ Solutions of Modeling Problems in Algorithmic Graph Theory

Janka Medová, Kitti Páleníková, Ľubomír Rybanský and Zuzana Naštická
Additional contact information
Janka Medová: Department of Mathematics, Constantine the Philosopher University in Nitra, Tr. A. Hlinku, 194974 Nitra, Slovakia
Kitti Páleníková: Department of Mathematics, Constantine the Philosopher University in Nitra, Tr. A. Hlinku, 194974 Nitra, Slovakia
Ľubomír Rybanský: Department of Mathematics, Constantine the Philosopher University in Nitra, Tr. A. Hlinku, 194974 Nitra, Slovakia
Zuzana Naštická: Stredná priemyselná škola strojnícka a elektrotechnická, Ulica Fraňa Kráľa, 2094901 Nitra, Slovakia

Mathematics, 2019, vol. 7, issue 7, 1-16

Abstract: Graphs can be considered as useful mathematical models. Graph algorithms are a common part of undergraduate courses in discrete mathematics. Even though they have been successfully implemented in secondary curricula, little research has been dedicated to the analysis of students’ work. Within a discrete mathematics course for university students, several graph algorithms were introduced via their applications. At the end of the course, the students took a test focused, inter alia, on applications of the algorithms. The mistakes that occurred in 127 students’ solutions of three problems (the Chinese postman problem, the shortest path problem, and the minimum spanning tree problem) were categorized and compared. Surprisingly, no mistakes were identified in the mathematization of situations or in the interpretation of results with respect to the wording of the problem. The categories of errors varied regardless of the problem types. Hierarchical cluster analysis grouped together the students’ solutions for the Chinese postman problem and the minimum spanning tree problem. By means of nonparametric item response theory analysis, the Chinese postman problem was identified as the most problematic for students. Possible sources of this difficulty are discussed in more detail herein.

Keywords: mathematics education; discrete mathematics; graph theory; graph algorithms; error pattern analysis (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/7/572/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/7/572/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:7:p:572-:d:243179

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().