초등 영재 교육에서의 구성주의 교수 · 학습 모형 적용 연구 : 알고리즘 문제를 중심으로

Abstract

The purpose of this paper is to analyze teaching-learning program which can be applied to mathematically gifted students in primary school. Our program is based on constructivist views on teaching and learning of mathematics. Mainly, we study the algorithmic thinking of mathematically gifted students in primary school in connection with the network problems; Eulerian graph problem, the minimum connector problem, and the shortest path problem. The above 3-subjects are not familiar with primary school mathematics, so that we adapt teaching-learning model based on the social constructivism. To achieve the purpose of this study, seventeen students in primary school participated in the study, and video type(observation) and student's mathematical note were used for collecting data while the students studied. The results of our study were summarized as follows: First, network problems based on teaching-learning model of constructivist views help students learn the algorithmic thinking. Second, the teaching-learning model based on constructivist views gives an opportunity of various mathematical thinking experience. Finally, the teaching-learning model based on constructivist views needs more the ability of teacher's research and the time of teaching for students than an ordinary teaching-learning model.