Have a personal or library account? Click to login
Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms Cover

Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms

By: M. Premalatha and  V. Viswanathan  
Open Access
|Sep 2019

Abstract

Choice Based Course Selection (CBCS) allows students to select courses based on their preferred sequence. This preference in selection is normally bounded by constraints set by a university like pre-requisite(s), minimum and maximum number of credits registered per semester. Unplanned course sequence selection affects the performance of the students and may prolong the time to complete the degree. Course Difficulty Index (DI) also contributes to the decline in the performance of the students. To overcome these difficulties, we propose a new Subset Sum Approximation Problem (SSAP) aims to distribute courses to each semester with approximately equal difficulty level using Maximum Prerequisite Weightage (MPW) Algorithm, Difficulty Approximation (DA) algorithm and Adaptive Genetic Algorithm (AGA). The three algorithms have been tested using our university academic dataset and DA algorithm outperforms with 98% accuracy than the MPW and AGA algorithm during course distribution.

DOI: https://doi.org/10.2478/cait-2019-0024 | Journal eISSN: 1314-4081 | Journal ISSN: 1311-9702
Language: English
Page range: 25 - 44
Submitted on: Apr 11, 2019
|
Accepted on: Aug 22, 2019
|
Published on: Sep 26, 2019
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2019 M. Premalatha, V. Viswanathan, published by Bulgarian Academy of Sciences, Institute of Information and Communication Technologies
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.