|
Title:
|
PROBLEMS IN LEARNING GRAPH ALGORITHMS |
|
Author(s):
|
Maryam Mustafa , Khurram Qadeer , M. Ashraf Iqbal , Yasser Hashmi |
|
ISBN:
|
972-8924-05-4 |
|
Editors:
|
Kinshuk, Demetrios Sampson and Pedro Isaías |
|
Year:
|
2005 |
|
Edition:
|
Single |
|
Keywords:
|
Meaningful learning, spanning tree, rote learning. |
|
Type:
|
Short Paper |
|
First Page:
|
401 |
|
Last Page:
|
404 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
The creation of meaningful knowledge is essential for all areas of academic work but doubly so for the subject of graph theory - a fundamental building block of most subjects in computer science. With the recent advances in various branches of science dealing with the mind and brain it is possible to better understand the process of learning. In this paper we look towards uncovering the difficulties students face in learning the basics of graph theory and analyzing the reasons for these problems in learning. The focus is to analyze and test the assimilation of concepts of graph theory and algorithms, and to try and understand why learning might not be taking place. The research aims at finding the problems and obstacles that students face in assimilating and using concepts of graph theory with the help of cognitive psychology and the learning theories put forth by researchers. |
|
|
|
|
|
|
