• Title/Summary/Keyword: Pair programming

Search Result 65, Processing Time 0.021 seconds

The Effects of a Peer Agent on Achievement and Self-Efficacy in Programming Education (프로그래밍 교육에서 동료 에이전트가 학업성취도와 자기효능감에 미치는 영향)

  • Han, Keun-Woo;Lee, Eun-Kyoung;Lee, Young-Jun
    • The Journal of Korean Association of Computer Education
    • /
    • v.10 no.5
    • /
    • pp.43-51
    • /
    • 2007
  • We have developed a peer agent to support programming learning and analyzed its educational effects in a programming course. The agent acts as a tutor or a tutee. The role of a tutor/tutee is like the role of a navigator/driver in pair programming. While students are learning with the peer agent, the students' programming abilities are modeled. Based on the student's model, the peer agent provides appropriate feedbacks and contents to the learner. The peer agent gives positive effects on learners' achievement and self-efficacy in a programming course. It means that the peer agent system helps the learner in an affective domain as well as a cognitive domain.

  • PDF

A Study on Pair Programming Applications in Education Implications Reviews (교육에서의 짝 프로그래밍(Pair Programming) 적용사례 분석 및 시사점 고찰)

  • Joung, Eun-Woo;Yi, So-yul;Lee, Young-Jun
    • Proceedings of The KACE
    • /
    • 2018.01a
    • /
    • pp.55-56
    • /
    • 2018
  • 산업현장에서 각광받고 있는 짝 프로그래밍 기법을 교육에 적용한 사례를 분석하고, 이를 통해 정보 교과 역량 요소 중 컴퓨팅 사고력과 협력적 문제해결력에서 가질 수 있는 시사점에 대해 서술하였다. 그러나 현재 짝 프로그래밍에 대해 선행연구가 부족하기 때문에, 차후 이를 확장하여 다양한 분야에서의 연구를 필요로 하는 한계점을 지니고 있다.

  • PDF

MULTIOBJECTIVE FRACTIONAL SYMMETRIC DUALITY INVOLVING CONES

  • Ahmad, I.;Sharma, Sarita
    • Journal of applied mathematics & informatics
    • /
    • v.26 no.1_2
    • /
    • pp.151-160
    • /
    • 2008
  • A pair of multiobjective fractional symmetric dual programs is formulated over arbitrary cones. Weak, strong and converse duality theorems are proved under pseudoinvexity assumptions. A self duality theorem is also discussed.

  • PDF

SYMMETRIC DUALITY FOR FRACTIONAL VARIATIONAL PROBLEMS WITH CONE CONSTRAINTS

  • Ahmad, I.;Yaqub, Mohd.;Ahmed, A.
    • Journal of applied mathematics & informatics
    • /
    • v.23 no.1_2
    • /
    • pp.281-292
    • /
    • 2007
  • A pair of symmetric fractional variational programming problems is formulated over cones. Weak, strong, converse and self duality theorems are discussed under pseudoinvexity. Static symmetric dual fractional programs are included as special case and corresponding symmetric duality results are merely stated.

A Study of Development Process for PDA Programming (PDA 프로그래밍을 위한 개발 프로세스에 관한 연구)

  • 이향숙;김종완;오기욱;박용팔;류성열
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.556-558
    • /
    • 2001
  • 프로젝트를 수행할 때 고객이 원하는 소프트웨어를 고객이 원하는 시간에 인도하는 것은 중요하다. 개발 기간의 엄수가 중요요소로서 각광을 받는 이유는 개발 기간의 엄수가 프로젝트의 성패를 좌우하기 때문이다. Extreme Programming 은 개발 주기의 단위를 작게 나누어 소프트웨어를 단기간에 개발하기 위한 방법론으로 현재 PDA 개발에 Pair Programming이라는 기법으로 자리잡아가고 있다. 본 논문에서는 PDA 프로그램을 고객인 원하는 품질로 단 기간에 개발하여 프로젝트의 성패에 중요 요소로 자리잡고 있는 개발 기간 엄수를 지킴으로써 PDA 개발 환경에 효과적으로 적용할 수 있는 PDA 프로그래밍을 위한 개발 프로세스를 제시하고자 한다.

  • PDF

Fixed Charge Transportation Problem and Its Uncertain Programming Model

  • Sheng, Yuhong;Yao, Kai
    • Industrial Engineering and Management Systems
    • /
    • v.11 no.2
    • /
    • pp.183-187
    • /
    • 2012
  • In this paper, we study the fixed charge transportation problem with uncertain variables. The fixed charge transportation problem has two kinds of costs: direct cost and fixed charge. The direct cost is the cost associated with each source-destination pair, and the fixed charge occurs when the transportation activity takes place in the corresponding source-destination pair. The uncertain fixed charge transportation problem is modeled on the basis of uncertainty theory. According to inverse uncertainty distribution, the model can be transformed into a deterministic form. Finally, in order to solve the uncertain fixed charge transportation problem, a numerical example is given to show the application of the model and algorithm.

Application Plan of Pair Programming in Algorithm Education (알고리즘 교육에서 짝 프로그래밍의 활용방안)

  • Joung, Eun-Woo;Lee, Young-Jun
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2018.01a
    • /
    • pp.105-106
    • /
    • 2018
  • 세계 여러 나라에서 시대적 요구와 국가 경쟁력을 높이기 위해 국가차원의 소프트웨어 교육을 실시하고 있다. 현재 소프트웨어 교육과 관련된 다양한 교수방법들이 나왔으나, 실제 산업현장에서 쓰이고 있는 짝 프로그래밍을 교육적 목적으로 활용한 예는 아직 적다. 본 논문에서는 알고리즘 교육에서 짝 프로그래밍의 활용방안을 제안한다. 짝 프로그래밍을 알고리즘 교육에 활용함으로써, 2015 개정 정보 교육과정에서 요구로 하는 협력적 문제해결력을 기르고 효율적인 교수 방법에 대해 연구하였다.

  • PDF

Analysis of a Two Stable Multi-Vibrator using a Tunnel Diode Pair Circuit (2안정 멀티바이브레이터 터널 다이오우드 대회로의 해석)

  • 이광형
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.8 no.1
    • /
    • pp.38-42
    • /
    • 1983
  • The characteristic of a Tunnel Diode(TD) is approximated by the summation of two exponential terms, obtained from the haracteristic curves displayed on the curve tracer. Using this result, static characteristic of a TD pair was plotted by a computer programming. From these static characteristic curves, the triggering behavior of TC pair multi-vibrators was described graphically. Two stable characteristics were analyzed by piecewise linear Method. Theoritical switching Theoritical switching times of a TD pair flip-flop(F-F) circuits were compared with experimental results.

  • PDF

NONDIFFERENTIABLE SECOND-ORDER MINIMAX MIXED INTEGER SYMMETRIC DUALITY

  • Gulati, Tilak Raj;Gupta, Shiv Kumar
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.1
    • /
    • pp.13-21
    • /
    • 2011
  • In this paper, a pair of Wolfe type nondifferentiable sec-ond order symmetric minimax mixed integer dual problems is formu-lated. Symmetric and self-duality theorems are established under $\eta_1$-bonvexity/$\eta_2$-boncavity assumptions. Several known results are obtained as special cases. Examples of such primal and dual problems are also given.

Extraction of Corresponding Points of Stereo Images Based on Dynamic Programming (동적계획법 기반의 스테레오영상의 대응점 탐색)

  • Lee, Ki-Yong;Lee, Joon-Woong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.5
    • /
    • pp.397-404
    • /
    • 2011
  • This paper proposes an algorithm capable of extracting corresponding points between a pair of stereo images based on dynamic programming. The purpose of extracting the corresponding points is to provide the stereo disparity data to a road-slope estimation algorithm with high accuracy and in real-time. As the road-slope estimation algorithm does not require dense disparity data, the proposed stereo matching algorithm aims at extracting corresponding points accurately and quickly. In order to realize this contradictory goal, this paper exploits dynamic programming, and minimizes matching candidates using vertical components of color edges. Furthermore, the typical occlusion problem in stereo vision is solved. The proposed algorithm is proven to be effective through experiments with various images captured on the roads.