Backtracking for Timetable Planning
| Author(s) | : | Mohammed Motasim, Mohammed Siddiq |
| Institution | : | Student, Computer Science Engineering, RNSIT, Bangalore |
| Published In | : | Vol. 3, Issue 8 — August 2016 |
| Page No. | : | 9-13 |
| Domain | : | Engineering |
| Type | : | Research Paper |
| ISSN (Online) | : | 2348-4470 |
| ISSN (Print) | : | 2348-6406 |
Timetable for any institution is as important as the institution itself. Since, it’s the timetable that defines andcontrols the day to day working of the institution. For years now, Timetable has been planned manually and considered to bea daunting task. This paper attempts to digitize the whole process of planning the timetable. Timetable planning falls underthe category of combinatorial problems. We try solving this problem using a very popular technique used for combinatorialproblems-Backtracking. If implemented efficiently this technique can provide effective results. We have implemented ourapproach and at last we present our results and analysis.
Mohammed Motasim, Mohammed Siddiq, “Backtracking for Timetable Planning”, International Journal of Advance Engineering and Research Development (IJAERD), Vol. 3, Issue 8, pp. 9-13, August 2016.
