1,399 research outputs found
RANDOMIZATION OF MULTIPLE CHOICE QUESTIONS FOR COMPUTER ASSISTED TEST (CAT) IN STUDENT SELECTION
Computer Assisted Test (CAT) is a computer application designed to help selection process, particularly to examine multiple choice questions. This application requires random questions and answer choices derived from a question bank. One of the random number generator is computational algorithms, or the so-called pseudo-random number generators. In this research, the model and randomized algorithm had been developed to generate the initial development of Computer Assisted Test. Linear congruential was used as the method to generate random number. One-sample Chi-Square test was applied to test the model and algorithm for randomness of question items. The statistic test result show χ2 = 206 and critical values χ20.05,199 = 232.19, while the number of answer choices for randomness tests statistically obtained χ2= 4.0 and the critical value χ20.05,8 = 15:51. From both the results of these tests concluded that the randomness of questions and answer choices produce a number of questions and answer choices that number has an equal chance of being selected
Ideologies of computer scientists and technologists (Correctness beyond reason)
Ideologies of computer scientists and technologist
Methodology of Algorithm Engineering
Research on algorithms has drastically increased in recent years. Various
sub-disciplines of computer science investigate algorithms according to
different objectives and standards. This plurality of the field has led to
various methodological advances that have not yet been transferred to
neighboring sub-disciplines. The central roadblock for a better knowledge
exchange is the lack of a common methodological framework integrating the
perspectives of these sub-disciplines. It is the objective of this paper to
develop a research framework for algorithm engineering. Our framework builds on
three areas discussed in the philosophy of science: ontology, epistemology and
methodology. In essence, ontology describes algorithm engineering as being
concerned with algorithmic problems, algorithmic tasks, algorithm designs and
algorithm implementations. Epistemology describes the body of knowledge of
algorithm engineering as a collection of prescriptive and descriptive
knowledge, residing in World 3 of Popper's Three Worlds model. Methodology
refers to the steps how we can systematically enhance our knowledge of specific
algorithms. The framework helps us to identify and discuss various validity
concerns relevant to any algorithm engineering contribution. In this way, our
framework has important implications for researching algorithms in various
areas of computer science
Corporate influence and the academic computer science discipline.
Prosopography of a major academic center for computer science
- …