• The Journal of the Korea Contents Association
• /
• v.11 no.1
• /
• pp.448-457
• /
• 2011

In this study, the teaching material has been developed based on Polya's Problem Solving Techniques for preparing Korea Information Olympiad qualification and studying principle of computer. the basis of discrete mathematics and data structures were selected as the content of textbooks for students to learn computer programming principles. After the developed textbooks were applied to elementary school students of Science Gifted Education Center of J University, the result of study proves that textbook helps improve problem-solving ability using the testing tool restructured sample questions from previous test. We need guidebook and training course for teachers and realistic conditions for teaching the principles of computer.

• Journal of Digital Contents Society
• /
• v.1 no.1
• /
• pp.89-101
• /
• 2000

Korea Infomatics Olympiad is the kind of promotion program for future's talent in computer part. It is 17th since 1984 - 1st tournament. It must have a great change. That's why it's targets are just primary, middle school and high school students. So it must spread their scopes especially in university student, industrial highschool students and publics as like globalization and business area.

• Journal of The Korean Association of Information Education
• /
• v.16 no.1
• /
• pp.11-20
• /
• 2012

The core of programming learning is based on an algorithm learning and the promotion of problem solving abilities is the purpose of this learning. Then, we need to think about what kind of algorithms in what order we teach and we need to study the effect of this learning. The purpose of this study is development and implementation of algorithm instructional materials and examine the effect of an algorithm learning with conceptual algorithms in KOI(Korea Olympiad in Informatics) final test of elementary students.

• 한국정보교육학회:학술대회논문집
• /
• 2010.01a
• /
• pp.269-275
• /
• 2010

현대사회에서 IT기술이 차지하는 비중이 점점 커짐에 따라 전 세계적으로 IT분야의 인재육성에 관심을 기울인다. 하지만 우리나라의 학교교육과정은 컴퓨터 교과를 배제하고 있으며 그나마 이루어지는 컴퓨터 교육도 컴퓨터의 활용 측면에만 치중되어 있다. IT인재는 컴퓨터 활용 능력만이 아니라 컴퓨터의 기본 원리와 이를 통한 문제해결능력이 함께 강조되어야 하며 이러한 교육은 학교교육과정의 근본인 초등교육에서부터 이루어져야 한다. 본 연구에서는 컴퓨터의 기본 원리와 문제해결 능력을 신장을 위한 한국정보올림피아드 초등부 지역예선 교재를 개발하고자 한다.

• 한국정보교육학회:학술대회논문집
• /
• 2010.01a
• /
• pp.283-288
• /
• 2010

한국정보올림피아드 경시대회 초등부 전국대회를 준비하는 학생들을 위해 본 교재를 개발하고자 한다. 본 교재는 J.S.Bruner의 표상이론에 맞게 알고리즘의 진행 절차를 시각화하여 이해가 쉽고 빠르게 되도록 구성하였으며 이를 실제 코드로 작성하여 자신의 논리를 프로그래밍 언어로 표현할 수 있게 하였다. 또한 기출문제, 확인문제 등을 통하여 배운 알고리즘을 확실하게 익혔는지 확인한다. 이러한 교재 개발이 경시대회를 준비하는 초등학생들에게 관련 도서가 전무하여 기회를 놓치버리는 일 등이나 사교육비를 들여 학원에만 의존해야 하는 최근의 경향에 대한 대안으로 사용되기 바란다.

• The KIPS Transactions:PartA
• /
• v.16A no.6
• /
• pp.453-462
• /
• 2009

Studies on software plagiarism detection, prevention and judgement have become widespread due to the growing of interest and importance for the protection and authentication of software intellectual property. Many previous studies focused on comparing all pairs of submitted codes by using attribute counting, token pattern, program parse tree, and similarity measuring algorithm. It is important to provide a clear-cut model for distinguishing plagiarism and collaboration. This paper proposes a source code clustering algorithm using a probability model on extreme value distribution. First, we propose an asymmetric distance measure pdist($P_a$, $P_b$) to measure the similarity of $P_a$ and $P_b$ Then, we construct the Plagiarism Direction Graph (PDG) for a given program set using pdist($P_a$, $P_b$) as edge weights. And, we transform the PDG into a Gumbel Distance Graph (GDG) model, since we found that the pdist($P_a$, $P_b$) score distribution is similar to a well-known Gumbel distribution. Second, we newly define pseudo-plagiarism which is a sort of virtual plagiarism forced by a very strong functional requirement in the specification. We conducted experiments with 18 groups of programs (more than 700 source codes) collected from the ICPC (International Collegiate Programming Contest) and KOI (Korean Olympiad for Informatics) programming contests. The experiments showed that most plagiarized codes could be detected with high sensitivity and that our algorithm successfully separated real plagiarism from pseudo plagiarism.