Automated Study Plan Generator using Rule-based and Knapsack Problem

Undergraduate students are given the flexibility of arranging courses throughout their study duration especially when they are eligible for credit exemption for the courses taken during their diploma study. Issues arise when students arrange their studies manually. Improper course arrangement in the study plan may be resulting some of the selected courses do not correspond to the courses offered, and imbalance credit hours. Hence, this study aims to propose an algorithm to generate an automated and accurate study plan throughout the study duration. A combination of rule-based and knapsack problem were proposed to generate an automated study plan. A quantitative methodology through expert’s reviews and questionnaire survey was conducted to evaluate the accuracy of the proposed algorithm. The proposed algorithm shows high accuracy. In conclusion, the combination of rule-based and knapsack problem is appropriate to generate an automated and accurate study plan. The automated study plan generator can help students generate an effective study plan.

@article{Mustapa2022,
  title     = {Automated Study Plan Generator using Rule-based and Knapsack Problem},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {13},
  number    = {8},
  year      = {2022},
  publisher = {The Science and Information Organization},
  author    = {Muhammad Amin Mustapa and Lizawati Salahuddin and Ummi Rabaah Hashim},
  doi       = {10.14569/IJACSA.2022.0130847},
  url       = {https://doi.org/10.14569/IJACSA.2022.0130847}
}