Abstract: Bloom’s Taxonomy is a classification of learning objectives within education that educators set for students. The cognitive domain within this taxonomy is designed to verify a student’s cognitive level during a written examination. Educators may sometimes face the challenge in analysing whether their examination questions comply within the requirements of the Bloom’s taxonomy at different cognitive levels. This paper proposes an automated analysis of the exam questions to determine the appropriate category based on this taxonomy. This rule based approach applies Natural Language Processing (NLP) techniques to identify important keywords and verbs, which may assist in the identification of the category of a question. This work focuses on the computer programming subject domain. At present, a set of 100 questions (70 training set and 30 test set) is used in the research. Preliminary results indicate that the rules may successfully assist in the identification of the Bloom’s taxonomy category correctly in the exam questions. Automatic question paper generation using Bloom’s taxonomy is a technique that leverages the hierarchical structure of Bloom’s cognitive domain to create questions of varying complexity and cognitive levels. The system uses algorithms and natural language processing to analyse the learning objectives or content and then generates appropriate questions that align with Bloom’s taxonomy levels, such as knowledge, comprehension, application, analysis, synthesis, and evaluation. This approach helps educators to create well-balanced and comprehensive assessments for students, promoting deeper understanding and critical thinking.

Keywords: Bloom’s Taxonomy, Natural Language Processing (NLP)

Tejal Deokar, Ruchita Chaudhari, Ashwin Sapkale, Krishna Patil, Prof. Snehal Dongare,"Automatic Question Paper Generation and Weightage Using Blooms’s Taxonomy", IJARCCE International Journal of Advanced Research in Computer and Communication Engineering, vol. 13, no. 2, 2024, Crossref https://doi.org/10.17148/IJARCCE.2024.13212.

PDF | DOI: 10.17148/IJARCCE.2024.13212

Open chat
Chat with IJARCCE