Tuesday, March 10, 2020

Algorithm For Efficient Seating Plan For Exam System




Exam seat allocation is one of the major concerns in quality education. With the increasing number of students, subjects, departments and rooms, exam seat management becomes complex. Maintaining a decent exam environment with the proper seating arrangement is one of the difficult jobs for authority. This research offers solution for exam seating arrangement problems that can be achieved through the sequential execution of three proposed algorithms. This research offers a solution for preventing some exam hall cheating by arranging seats for large students and it also finds out the best combination of rooms to be assigned for the exam to organize perfect seating based on the room orientation and size, number of students, differentiation of subjects. To do this research, we have collected data and methods from a university those are being used for their exam seating arrangement. By using university exam information we test our algorithms. It provides better seating plan then the manual system used by the university.

   https://codeshoppy.com/shop/product/

METHODOLOGY
A.System Description
In this research, we are going to offer a model and some algorithm to solve exam seating problem. Our proposed system is applicable for I shape seat allocation system. The system needs two types of data as input, Room information and Exam information. The total number of students must have to be less than or equal to the total seats. For offering an optimum seating solution we followed some steps. These steps will be followed for each slot of examination.
Step 1: Two types of data sets are needed for exam seating, one is room information having room id, size of columns and rows; another is exam information with subject id and number of students. By processing room and exam information it will calculate total number of seats and students. Finally it will calculate the number of extra seats available after seating.
Step 2: When the amount of extra seats is greater than any room capacity, then it may possible of having one or more extra room. In this step it will search those rooms, which will be kept empty at the time of exam.
Step 3: Our main concept is to distribute column to the subject so at first it needs to calculate the number of columns and the capacity or number of rows for each column. To prevent copying from other it tries to ensure at least one column distance among students having same query set. That is why it will also calculate maximum usable column and its capacity for any subject.
Step 4: Then it will allot columns to the subjects. By using a combination of column size (row) we can ascertain the set of columns which will be assigned to subjects. After that it will provide a set of columns for each subject. In best case extra seats are not required, but in worst case it may require to assign some extra seats to subject for getting a set of column for exam seating.
Step 5: We have subject having different column size and number. We have also room identity which is represented by column number and row number as column size. So the common attribute is column size. By using this it assigns room and column number to the subject by maintaining one column distance between the columns having the same subject. After completing the column and room distribution it will provide a complete seating solution for the exam.