Please use this identifier to cite or link to this item: http://dspace.unimap.edu.my:80/xmlui/handle/123456789/9078
Title: Linear programming model for distribution of test allocation marks
Authors: Ahmad Kadri, Junoh
Mohd. Syafarudy, Abu
Wan Nor Munirah, Ariffin
Keywords: Bloom taxonomy
Model test
Linear programming
Test questions
Malaysian Technical Universities Conference on Engineering and Technology (MUCEET)
Issue Date: 20-Jun-2009
Publisher: Universiti Malaysia Pahang (UMP)
Series/Report no.: Proceedings of the Malaysian Technical Universities Conference on Engineering and Technology (MUCEET) 2009
Abstract: Test and examination questions are very important to educators to determine the quality of learning process. Thus, a good tool which might give correct and exact evaluation to the test and examination questions is needed and very important to the educational process. This paper presents a model to assist mathematics lecturers in preparing test questions. The objective of this study is to allocate the optimal marks for each subject in each chapter by satisfying the requirements of Bloom’s taxonomy. Linear programming method is used in developing the model to determine and analyze the appropriate percentage of questions in each subtopic. The results show that the optimal distributions of allocation marks are obtained for each subtopic and at the same time it satisfies the requirements of percentage of complexity cognitive levels in Bloom’s taxonomy.
Description: MUCEET 2009 is organized by Malaysian Technical Universities Network (MTUN) comprising of Universiti Malaysia Perlis (UniMAP), Universiti Tun Hussein Onn (UTHM), Universiti Teknikal Melaka (UTeM) and Universiti Malaysia Pahang (UMP), 20th - 22nd June 2009 at M. S. Garden Hotel, Kuantan, Pahang.
URI: http://dspace.unimap.edu.my/123456789/9078
Appears in Collections:Conference Papers

Files in This Item:
File Description SizeFormat 
642-647.pdfAccess is limited to UniMAP community148.12 kBAdobe PDFView/Open


Items in UniMAP Library Digital Repository are protected by copyright, with all rights reserved, unless otherwise indicated.