• Title/Summary/Keyword: Education of Algorithm

Search Result 1,524, Processing Time 0.027 seconds

Pedagogical effectiveness of algorithm visualizations in teaching the data structures and algorithms in elementary schools (초등학교의 자료구조와 알고리즘 수업에서 알고리즘 시각화의 교육적 효과)

  • Chun, Seok-Ju
    • Journal of The Korean Association of Information Education
    • /
    • v.16 no.2
    • /
    • pp.255-263
    • /
    • 2012
  • Early algorithm education is very important in order to nurture excellent S/W developers in an information society. However a algorithm learning is a great challenge to elementary school students since understanding what a computer algorithm written in a static text format meant to do is difficult. It is expected that a student can easily visualize a algorithm through animations. In this study, we evaluate the pedagogical effectiveness of algorithm visualizations in teaching the fundamental data structures and algorithms in elementary schools. Thus we defined a new measure called 'Algorithm Visualization Factor(AVF)' and developed both text-oriented and animation-oriented PPTs of algorithm education elements, that is, Stack, Queue, Bubble Sort, Heap Sort, BDF, and DFS. We have conducted experiments and evaluations on diverse students groups. Extensive experiment results show that the average score of the student groups using animation-orirented PPT is greater(22%) than the one of the student groups using text-orirented PPT.

  • PDF

Analysis of Appropriateness in Information Curriculum for Algorithm and Programming Education (알고리즘과 프로그래밍 교육을 위한 정보과 교육내용체계에 대한 적절성 분석)

  • Jeong, Young-Sik;Shin, Soo-Bum;Sung, Young-Hoon
    • Journal of The Korean Association of Information Education
    • /
    • v.20 no.6
    • /
    • pp.575-584
    • /
    • 2016
  • We compared domestic computer science curriculum with foreign curriculums in order to develop content for algorithm and programming education in elementary and secondary schools. The results show that the levels and ranges of information included in the practical arts and information subjects of the 2015 Revised Curriculum are insufficient when compared with those of England, India, and America. In this paper, we surveyed experts about the importance of content and the age-appropriate time to begin teaching algorithm and programming in schools. The surveys were conducted using questionnaires used in KAIE's software standard model. Except for algorithm evaluation, the experts largely believe all content areas of algorithm education are important. However, they had differing opinions about the best time to begin teaching this subject matter.

Development of Aging Diagnosis Algorithm for Photovoltaic Modules by Considering Electric Characteristics and Environment Factors (전기적특성과 환경인자를 고려한 태양광모듈의 열화진단 알고리즘 개발)

  • Lee, Kye-Ho;Choi, Sung-Sik;Kim, Byung-Ki;Jung, Jong-Yun;Kim, Chan-Hyeok;Rho, Dae-Seok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.64 no.10
    • /
    • pp.1411-1417
    • /
    • 2015
  • The installation of PV system to the power distribution system is being increased as one of solutions for environmental pollution and energy crisis. However, the efficiency of PV system is getting decreased because of the aging phenomenon and several operation obstacles. Therefore, The technology development of aging diagnosis of PV modules are required in order to improve operation performance of PV modules. This paper proposes evaluation algorithm for aging state in PV modules by using the electrical characteristics of PV modules and environmental factors. And also, this paper presents a operation evaluation system of PV modules based on the proposed aging diagnosis algorithm of PV modules. From the simulation results of proposed evaluation system, it is confirmed that the proposed algorithm is a useful tool for aging diagnosis of PV systems.

The Development of A Basic Golf Swing Analysis Algorithm using a Motion Analysis System (동작분석 시스템을 이용한 골프 스윙 분석 기초 알고리즘 개발)

  • Seo, Jae-Moon;Lee, Hae-Dong;Lee, Sung-Cheol
    • Korean Journal of Applied Biomechanics
    • /
    • v.21 no.1
    • /
    • pp.85-95
    • /
    • 2011
  • Three-dimensional(3D) motion analysis is a useful tool for analyzing sports performance. During the last few decades, advances in motion analysis equipment have enabled us to perform more and more complicated biomechanical analyses. Nevertheless, considering the complexity of biomechanical models and the amount of data recorded from the motion analysis system, subsequent processing of these data is required for event-specific motion analysis. The purpose of this study was to develop a basic golf swing analysis algorithm using a state-of-the-art VICON motion analysis system. The algorithm was developed to facilitate golf swing analysis, with special emphasis on 3D motion analysis and high-speed motion capture, which are not easily available from typical video camera systems. Furthermore, the developed algorithm generates golf swing-specific kinematic and kinetic variables that can easily be used by golfers and coaches who do not have advanced biomechanical knowledge. We provide a basic algorithm to convert massive and complicated VICON data to common golf swing-related variables. Future development is necessary for more practical and efficient golf swing analysis.

Design and Validation of Education Contents of Algorithm for the Gifted Elementary Students of Computer Science (초등정보과학영재를 위한 알고리즘 교육내용의 설계 및 검증)

  • Lee, Jae-Ho;Oh, Hyeon-Jong
    • Journal of Gifted/Talented Education
    • /
    • v.19 no.2
    • /
    • pp.353-380
    • /
    • 2009
  • The significant reason for studying computer science lies in the efficient resolution of various problems which can arise in actual life. Consequently, algorithm education is very important in the computer science and plays a great part in helping to enhance the creative ability to solve problems and to improve the programming ability. However, the current algorithm education at an computer science educational institute for the gifted has inadequate systematic quality and is only treated as a part of programming education. From this perspective, this paper carried out following studies in order to design the algorithm education for elementary computer science prodigies. First, the core educational contents was selected by extracting the common elements from existing books related to algorithm education, common study contents on algorithm lesson websites and the study area of ACM's computer algorithm. Second, using the development criteria and selected educational contents, the educational theme for the If weeks load was set. Additionally, the algorithm educational contents were designed for the elementary computer science prodigy based on such theme. Third, the activity site for the use of prodigy educational institute was developed with the background in the educational contents for the elementary computer science prodigy. Fourth, the Delphi analysis technique was used to verify the appropriateness of contents and activity site developed in this paper. It was carried out in 2 separate processes where the first process verified the design of educational contents, and the second process verified the appropriateness of developed activity site.

Examination Questions Selection Algorithm in Web-based Engineer Test Education System (웹 기반 기사시험 학습 시스템에서의 문제 출제 알고리즘)

  • Kim Eun-Jung
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.9 no.3
    • /
    • pp.11-18
    • /
    • 2004
  • It is making researches in questions selection method for examination in web-based education system. Most questions made for these remote examinations use methods of making questions using fixed questions or randomly using item pools or automatically using degree of difficulty. This paper proposes a new examination questions selection algorithm in web-based education system for engineer test. Generally, Engineer test is characterized by adequate examination questions selection for degree of difficulty and equally between all units. Therefore this algorithm selected examination questions equally well as regards degree of difficulty and distribution between all units. This algorithm providers more effective education examination method as compared with previous algorithm.

  • PDF

A Study on Algorithm Composition Patterns of Learners in Elementary Software Education (초등학교 소프트웨어교육에서 학습자의 알고리즘 구성 패턴 연구)

  • Kim, Jeongrang
    • Journal of The Korean Association of Information Education
    • /
    • v.24 no.1
    • /
    • pp.11-19
    • /
    • 2020
  • Software education is provided for 6th grade students. This study explored the algorithmic composition patterns of elementary school students. After investigating the algorithm for the 6th grade students, the algorithmic pattern of the learner was explored by calculating the cyclomatic complexity of MacCabe based on the structural programming technique. Students often use one or two choice structures to solve problems, which tend to be biased towards the starting and ending points of the problem. It is also passive in the use of selection structures. Algorithm composition depends on visible objects and one's own background. Therefore, in elementary school software education, it is necessary to present the task of thinking about the algorithm structure in the context of the algorithm and the students' experiences in accordance with the algorithm composition pattern.

Pedagogical Methodology of Teaching Activity-based Flow Chart for Elementary School Students (초등학생 대상의 활동 중심 순서도 교육 방법)

  • Lee, Yong-Bae;Park, Ji-Eun
    • Journal of The Korean Association of Information Education
    • /
    • v.16 no.4
    • /
    • pp.489-502
    • /
    • 2012
  • Today computer education puts an emphasis on algorithm education. There are little researches about how to express the given problem in algorithm and how to interpret the expressed algorithm. In this study play-based learning methods dealing with flow chart which is one of the expressing tools of algorithm are developed for lower graders of elementary school. Then we diagnosed the learning possibility of the tool after applying the methods in a classroom environment. There are four types of learning game activities; sequential play, selective play, repetitive play and puzzle play. Puzzle play is a game that students need to reconstruct the learned content to a real flow chart by using flow chart cards. The result of an achievement test after teaching students flow chart showed that the group who took the play-based lesson got their average score with about 7.5% higher than the group who took the ICT-based lesson. Both the groups got their average scroe of more than 9 out of 10 after the lesson. This result shows that flow chart lessons are adaptable for the lower graders of elementary school. It also shows that play-based education can be exceptionally effective.

  • PDF

Analysis and Improvement of the Bacterial Foraging Optimization Algorithm

  • Li, Jun;Dang, Jianwu;Bu, Feng;Wang, Jiansheng
    • Journal of Computing Science and Engineering
    • /
    • v.8 no.1
    • /
    • pp.1-10
    • /
    • 2014
  • The Bacterial Foraging Optimization Algorithm is a swarm intelligence optimization algorithm. This paper first analyzes the chemotaxis, as well as elimination and dispersal operation, based on the basic Bacterial Foraging Optimization Algorithm. The elimination and dispersal operation makes a bacterium which has found or nearly found an optimal position escape away from that position, which greatly affects the convergence speed of the algorithm. In order to avoid this escape, the sphere of action of the elimination and dispersal operation can be altered in accordance with the generations of evolution. Secondly, we put forward an algorithm of an adaptive adjustment of step length we called improved bacterial foraging optimization (IBFO) after making a detailed analysis of the impacts of the step length on the efficiency and accuracy of the algorithm, based on chemotaxis operation. The classic test functions show that the convergence speed and accuracy of the IBFO algorithm is much better than the original algorithm.