• 한국경영과학회지
• /
• 제15권2호
• /
• pp.33-44
• /
• 1990

An efficient algorithm is developed for the linear programming relaxation of generalized multiple choice knaspack problem. The generalized multiple choice knaspack problem is an extension of the multiple choice knaspack problem whose relaxed LP problem has been studied extensively. In the worst case, the computational coimplexity of the proposed algorithm is of order 0(n. $n_{max}$)$^{2}$), where n is the total number of variables and $n_{max}$ denotes the cardinality of the largest multiple choice set. The algorithm can be easily embedded in a branch-and-bound procedure for the generalized multiple choice knapsack problem. A numerical example is presented and computational aspects are discussed.sed.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제43권2호
• /
• pp.151-162
• /
• 2004

For the past several years, performance assessment has been widely used by mathematics teachers. The superiority of performance assessment items compare to multiple choice items has been discussed by many researchers, however these discussions tend to be lack of empirical data. Thus, this study aims to examine the effectiveness of tree response items in comparison with multiple choice items. Using the information function in Item Response Theory(IRT), item information of free response items and multiple choice items from the Third International Mathematics and Science Study-Repeat(TIMSS-R) were obtained and compared. Test informations of the whole mathematics area as well as each content area of mathematics were computed. On average, tree response items yielded more information than multiple choice items, especially in measurement and data interpretation. This study also revealed that free response items estimated students' mathematics ability more accurately than multiple choice items with smaller number of items.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.365-375
• /
• 1996

We consider an extension of the multiple choice linear knapsack problem and develop a fast algorithm of order $O(r_{max}n^2)$ by exploiting some new properties, where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm has convenient structures for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• 대한산업공학회지
• /
• 제21권4호
• /
• pp.519-527
• /
• 1995

By finding some new properties, we develop an O($r_{max}n^2$) algorithm for the generalized multiple choice linear knapsack problem where $r_{max}$ is the largest multiple choice number and n is the total number of variables. The proposed algorithm can easily be embedded in a branch-and-bound procedure due to its convenient structure for the post-optimization in changes of the right-hand-side and multiple choice numbers. A numerical example is presented.

• 대한산업공학회지
• /
• 제23권4호
• /
• pp.661-667
• /
• 1997

We consider a generalized problem of the continuous multiple choice knapsack problem and study on the LP relaxation of the candidate problems which are generated in the branch and bound algorithm for solving the generalized problem. The LP relaxed candidate problem is called the generalized continuous multiple choice linear knapsack problem and characterized by some variables which are partitioned into continuous multiple choice constraints and the others which only belong to simple upper bound constraints. An efficient algorithm of order O($n^2logn$) is developed by exploiting some structural properties and applying binary search to ordered solution sets, where n is the total number of variables. A numerical example is presented.

• 한국초등과학교육학회지:초등과학교육
• /
• 제23권4호
• /
• pp.332-343
• /
• 2004

Multiple choice items have been widely used. However the difficulties in understanding and solving the items have not been known well. The purpose of this study is to analyze the difficulties and errors in the process of solving multiple choice items. Twelve multiple choice items were developed based on the Unit 5 Separation of Mixtures in the 4th grade. Four items which students had hardly given the correct answer were selected and six students were chosen for interview. Interview results were analyzed with regard to the errors in the process of solving the multiple choice items. The findings of this study are as follows: I) The students who misread and misunderstand the questions choose the incorrect answers. 2) Most of the students activate daily knowledge in the process of problem solving. 3) The students who have misconception with the daily knowledge or have no experiences choose incorrect answers, while students who activate both daily knowledge and school knowledge choose correct answer. 4) The students of high level commit errors mainly in the latter part of problem solving process, but the students of low level do from early.

• 한국과학교육학회지
• /
• 제31권6호
• /
• pp.887-900
• /
• 2011

생물교사는 자신의 글과 말을 활용하여 지식을 논리적인 과학적 설명의 형태로 변환하여 학생들을 지도한다. 그러므로 생물 예비교사들이 과학적 설명을 구성하는 능력을 확인할 수 있는 개방형 검사가 요구 될 것이다. 하지만 채점자간 일치도, 늦은 피드백과 같은 개방형 검사가 가진 문제로 선택형 검사가 대체 될 수 있을 것이다. 이 연구는 생물 예비교사들의 과학적 진화 설명 구성 능력을 확인함과 동시에 선택형 진화 개념 검사가 개방형 검사 결과를 어느 정도 예측하는지 두 가지를 조사하였다. 생물 예비교사 124명이 참여하였으며 20문항의 진화 개념 선택형 검사도구와 3문항의 실제 사례를 활용한 개방형 검사 문항을 모든 참여자에게 투입하였다. 연구 결과 생물 예비 교사는 선택형 검사 도구에 더 높은 능력을 보였으며 최상위(0 ~ 25%)의 참여자를 제외하고 선택형 검사 도구는 개방형 검사 도구 검사 결과를 예측하지 못하였다. 진화 설명의 일관성, 오개념이 포함되지 않은 순수성, 과학적 설명의 양을 측정한 결과, 선택형 검사 결과는 최상위 집단을 제외하고 다른 집단을 구분하지 못하였다. 또한 이 결과들은 생물 교사들이 과학적 설명의 구성 능력이 지식의 양에 비하여 상대적으로 낮은 것을 확인할 수 있었으며 일부 예비교사들은 오개념과 과학적 개념을 혼합하는 등의 세련되지 못한 과학적 설명을 가지고 있었다. 이 결과는 생물 예비교사들의 개념 평가는 선택형보다 개방형이 더 많은 정보를 제공할 수 있음을 보여주며, 생물 예비교사들을 위한 교사양성 프로그램은 과학적 설명 능력의 신장에 더욱 더 초점을 맞출 것을 제언한다.

• 한국과학교육학회지
• /
• 제18권4호
• /
• pp.643-650
• /
• 1998

본 연구의 3단계 선다형 평가 문항은 과학적 결과와 그 결과가 나온 과정 또 그러한 과정에 관계된 과학적 개념을 함께 물어 봄으로써 과학적 탐구 사고력을 의미있게 평가할 수 있고 객관식 문항형태이지만 객관식 평가의 단점인 추측의 요인을 주관식 응답에 준하여 거의 제거할 수 있다고 판단된다. 오랜 기간동안 1단계 4지선다형 또는 5지 선다형 시험에 익숙해 있던 학생들은 3단계 선다형 문항에 매우 적용하기 어렵겠고 교사들 또한 문항을 제작하는데 많은 시간과 노력이 필요하겠지만 평가가 학생들의 학습에 미치는 영향을 고려한다면 3단계 선다형 문항의 현장 도입은 절실히 필요하다. 이의 도입은 학생들의 탐구사고력의 신장에 큰 기여를 할 것으로 판단된다.

• 한국경영과학회지
• /
• 제17권1호
• /
• pp.31-41
• /
• 1992

An extension of generalized linear multiple choice knapsack problem [1] is presented and an algorithm of order 0([n .n$_{max}$]$_{2}$) is developed by exploiting its extended properties, where n and n$_{max}$ denote the total number of variables and the cardinality of the largest multiple choice set, respectively. A numerical example is presented and computational aspects are discussed.sed.

• 산업경영시스템학회지
• /
• 제21권45호
• /
• pp.291-299
• /
• 1998

We present a variant for the generalized continuous multiple-choice knapsack problem[1], which additionally has the well-known generalized lower bound constraints. The presented problem is characterized by some variables which only belong to the simple upper bound constraints and the others which are partitioned into both the continuous multiple-choice constraints and the generalized lower bound constraints. By exploiting some extended structural properties, an efficient algorithm of order Ο($n^2$1og n) is developed, where n is the total number of variables. A numerical example is presented.