Course: Graph Algorithms in MAPLE

« Back
Course title Graph Algorithms in MAPLE
Course code KIN/XGAM
Organizational form of instruction no contact
Level of course Doctoral
Year of study not specified
Semester Winter and summer
Number of ECTS credits 10
Language of instruction Czech
Status of course Compulsory-optional
Form of instruction unspecified
Work placements unspecified
Recommended optional programme components None
Lecturer(s)
  • Vaníček Jiří, doc. PaedDr. Ph.D.
Course content
- Basic principles of MAPLE software, - MAPLE pseudocode, - the COMBINAT package, - the NETWORKS package, - graph algorithms; - individual project proposal - project development - project finalization.

Learning activities and teaching methods
Monologic (reading, lecture, briefing), Dialogic (discussion, interview, brainstorming), Work with text (with textbook, with book)
Learning outcomes
MAPLE, one of the international standards of mathematics software, also offers two special packages for the work in discrete mathemtics. Moreover a simple pseudocode for MAPLE programming is available. The area of combinatorial algorithms is very rich and a lot of groups of algorithms are possible to select. The student will choose such a group and deal with it, both teoretical and practical level.
The student will be able to use MAPLE in the area of discrete mathematics, including MAPLE pseudocode programming.
Prerequisites
Basic knowledge of programming, algorithm theory and discrete mathematics.

Assessment methods and criteria
Combined exam

Basic knowledge of programming, algorithm theory and discrete mathematics.
Recommended literature
  • KREHER, L. D. a kol.:. Combinatorial Algorithms. New York: CRC Press, 1999.
  • KUČERA, L.:. Kombinatorické algoritmy. Praha: SNTL, 1983.
  • MATOUŠEK, J., NEŠETŘIL, J.:. Kapitoly z diskrétní matematiky, Praha: Karolinum, 2000.
  • MONAGAN, M. B. a kol.:. Maple V Programming Guide. , New York: Springer, 1996.
  • PLESNÍK, J.:. Grafové algoritmy, Bratislava: Veda, 1983.
  • ROSEN, K. H.:. Discrete Mathematics and Its Applications. , New York: McGraw-Hill, 2000.
  • ROSEN, K. H.:. Exploring Discrete Mathematics with MAPLE. New York: McGraw-Hill, 1997.


Study plans that include the course
Faculty Study plan (Version) Category of Branch/Specialization Recommended year of study Recommended semester
Faculty: Faculty of Education Study plan (Version): Information and communication technology in education (1) Category: Pedagogy, teacher training and social care - Recommended year of study:-, Recommended semester: -
Faculty: Faculty of Education Study plan (Version): Information and communication technology in education (1) Category: Pedagogy, teacher training and social care - Recommended year of study:-, Recommended semester: -