본 논문에서는 제 7차 교과과정에 의하여 새로운 선택과목으로 선정된 이산수학의 효율적인 교수방안을 논의한다. 이를 위하여 이산수학의 가장 핵심적인 내용인 알고리즘의 개발 필요성 및 목적 등을 강조하기 위하여 행렬 곱셈에 관한 전통적인 방법의 문제점을 분석하며 또한 효율적인 행렬 곱셈 알고리즘을 분석한다.
As the development of computer science discrete mathematics has been developed accordingly. Discrete mathematics is one of the vital element for the development of the computer and IT technologies since it is the theoretical basis for these field of technologies. Currently, according the Seventh Curriculum Standards in Mathematics, high school students may participate in the class of discrete mathematics as one of their optional curriculum. However, discrete mathematics is a new to the most students in high school. Therefore, the teaching methods for the class of discrete mathematics must be carefully designed so that students acknowledge the importance of this new subject. For this purpose, we first show that why the algorithm is needed and then analyze the problem involved in the method of the traditional matrix multiplications. Finally, we suggest two matrix multiplication algorithms which are more efficient than the traditional method.
