Identifying Difficult exercises in an eTextbook Using Item Response Theory and Logged Data Analysis

October 11, 2022 Β· Declared Dead Β· πŸ› 2022 10th International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Ahmed Abd Elrahman, Ahmed I. Taloba, Mohammed F. Farghally, Taysir Hassan A Soliman arXiv ID 2210.05294 Category cs.DS: Data Structures & Algorithms Cross-listed cs.LO Citations 0 Venue 2022 10th International Japan-Africa Conference on Electronics, Communications, and Computations (JAC-ECC) Last Checked 5 months ago
Abstract
The growing dependence on eTextbooks and Massive Open Online Courses (MOOCs) has led to an increase in the amount of students' learning data. By carefully analyzing this data, educators can identify difficult exercises, and evaluate the quality of the exercises when teaching a particular topic. In this study, an analysis of log data from the semester usage of the OpenDSA eTextbook was offered to identify the most difficult data structure course exercises and to evaluate the quality of the course exercises. Our study is based on analyzing students' responses to the course exercises. We applied item response theory (IRT) analysis and a latent trait mode (LTM) to identify the most difficult exercises .To evaluate the quality of the course exercises we applied IRT theory. Our findings showed that the exercises that related to algorithm analysis topics represented the most difficult exercises, and there existing six exercises were classified as poor exercises which could be improved or need some attention.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Data Structures & Algorithms

Died the same way β€” πŸ‘» Ghosted