Abstract

Admission exercise has been a crucial activity that is performed almost every year by Universities. One of the challenges confronting these institutions during the admission exercise is the selection of the most qualified candidates who supposed to be given admissions in order to undergo studies with less difficulties. Some researchers have been able to develop admission support systems in order to assist to mitigate this challenge. In order to improve the standard of candidates to be admitted, this research work has developed a knapsack problem approach system titled, “Admission Decision Support System for Nigerian Universities.” Which screens and ranks the qualified candidates and offered them admissions based on their aggregate points obtained from their UTME and O-level results. NetBeans7.2.1, Jboss4.2.2GA, My SQL and Macromedia Dreamweaver 8.0 were used in designing the system.

References

• Judith E.A and Yusuf L.A (2007) “Admissions into Tertiary institutions un Nigeria”, paper presentation at the 33rd annual conference of the international Association for Educational Assessments (IAEA), Baku, Azerbaijan.
• Derya Turfan, Cagdan H.A and Ozgur Yeniay (2012)” A New Genetic Algorithm to Solve Knapsack Problem”, journal of Social and Economic Statistics, Vol.1, No.2, pp 40-47
• Eliman A.A (1991) “A Decission Support System for University Admission Policies”, European Journal of Operational Research, Vol.50, issue 2, pp 140-156
• Owoloko E.A and Sagoe E.T (2010) “Optimal Advert Placement Slot – Using the Knapsack Problem Model”, American Journal of Scientific and Industrial Research, 2010, Vol. 1, issue 1, pp 51-55
• Hamdy A. Taha (2017) “ Operations Research: An Introduction” 10th edition, Prentice Hall, 2017, ISBN -10: 0134444019.
• Guidelines for Admissions into Nigerian Universities 2007/2008.
• Mikailu Habila, Wajiga G.M and Zirra P.B (2014) “Students Admission Placement in Nigerian Universities Using Artificial Neural Network”, International Journal of Engineering and Science (IJES),Vol.3, issue 4, 2014, pp 31-40.
• Viska D.F, Senot Sangadji and Sholihin As’ad (2017) “Integer 0/1 Knapsack Problem Dynamic Programming Approach in Building Maintenace Optimization”, International Journal of Science and Applied Science: Conference series, Vol. 2, No.1, 2017.
• Ulrich Pferschy and Rosario Scattamacchia (2017) “ Improved Dynamic Programming and Approximation Results for the Knapsack Problems with setups”, Interntional Transactions in Operational Research, Vol.25, pp 667-680.