• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.191-201
• /
• 2014

The purpose of this study is to propose strategies of puzzle-based learning for Informatics gifted education through analyzing Informatics gifted elementary students' computational problem solving approaches in puzzle-based learning contexts. Six types of educational puzzles, which are constraints, optimization, probability, statistically speaking, pattern recognition, and strategy, were used in teaching 14 Informatics gifted students for 8 sessions. The results of pre and post test and each students' answers were analyzed to identify why students were not able to solve the puzzles. We also analysed what essential computational strategies are needed to solve each type of puzzles, and what students did not know in solving puzzle problems. We identified some problems caused by puzzle representation methods, and various students' intuitions that disturb puzzle solving. Also, we identified essential computational strategies to solve puzzles: backtracking, dynamic programming, abstraction, modeling, and reduction of big problem. However, students had difficulties in applying these strategies to solve their puzzle problems. We proposed the revised puzzle-based learning strategies, which is based on the improved problem representation, just-in-time cognitive feedbacks, and web-based learning system.

• The KIPS Transactions:PartD
• /
• v.19D no.1
• /
• pp.95-104
• /
• 2012

The main purpose of this paper is to propose the direction of financial IT development in macro-perspective. And it also shows a theoretical basis on the financial IT system that will be progressed with regard to an empirical model on the basis of the transformation process of the domestic financial IT environment for the future. In the process, this research produces and analyzes the meaningful patterns that have a significant influence on the financial IT development for 40 years, and attempts to backtrack the life-cycle of the core-banking model. This paper can be summarized as follows: Firstly, I analyzed the life-cycle of financial IT system in Korea per 10years. Secondly. The life-cycle of core-banking model is analyzed by 11years on the average and the one of the long term model by 33years. Thirdly, from the earlier days, the models of a long-term survival core-banking have been designed and developed through the objective analysis and bench-marketing. Lastly, the financial IT field should be developed into the integrated industry, and systematization of core-banking model studies and more professionals need to be extended. This research has contributed to provide the new frameworks through the analysis of the core-banking model that has not studied obviously for a long time. The paper involves two related sections, the first section deals with the significance of backtracking in core-banking model and also focuses on the key components from the perspective of financial IT management strategies. Based on the process, the second section figures out the life-cycles of actual core-banking model.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.4
• /
• pp.87-94
• /
• 2022

This paper researched a study to find a combination of acquisition scores for 9 dart throws, which is the minimum number of dart tactile throws in 501 point dart games. The maximum score that can be obtained by throwing once in a dart game is 60 points, which can end the perfect dart game with 60 points eight times according to 60×8+21×1=501, and if you earn 21 points once, you can finish the game with 9 throws. This is called 9-dart finish. As such, only 18 and 14 studies on the combination of scores that can obtain 501 points with 9 throws are known, and no studies have been conducted applying the exhaustive search algorithm. This paper proposed a division branch-and-bound algorithm as a method of simplifying the O(2ⁿ) exponential time performance complexity of the typical branch-and-bound method of a exhaustive search method, to polynomial time complexity. The proposed method limited the level to 8, jumped to a quotient level of 501/60, and backtracked to explore only possible score combinations in the previous level. The possible score combinations of the nine perfect games found with the proposed algorithm were 90(101 cases).