Fast and Rigorous Assignment Algorithm Multiple Preference and Calculation

Main Article Content

Ümit ÇİFTÇİ, Oğuz ATA, Hasan BALIK

Abstract

The goal of paper is to develop an algorithm that evaluates students then places them depending on their desired choices according to dependant preferences. The developed algorithm is also used to implement software. The success and accuracy of the software as well as the algorithm are tested by applying it to ability test at Beykent University. This ability test is repeated several times in order to fill all available places at Fine Art Faculty departments in every academic year. It has been shown that this algorithm is very fast and rigorous after application of 2008-2009 and 2009-20010 academic years.

Article Details

Section
Articles