Student-supervisor matching using stable marriage algorithm / Siti Farahana Nodzari
Matching problems involving sets of participants, where some or all of the participants express preferences over the partner is used in large scale practical situations. In Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, final year students have to face problem of finding s...
Saved in:
| Main Author: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2007
|
| Subjects: | |
| Online Access: | https://ir.uitm.edu.my/id/eprint/98218/1/98218.PDF https://ir.uitm.edu.my/id/eprint/98218/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Matching problems involving sets of participants, where some or all of the participants express preferences over the partner is used in large scale practical situations. In Faculty of Computer and Mathematical Sciences, Universiti Teknologi MARA, final year students have to face problem of finding suitable supervisor for their projects. Since they solve the problem manually, this situation usually consumes a lot of time and students need to be patient until meet with suitable lecturer. Beside that, lecturers fields of expertise are vague to the student's knowledge and are not made known in advance for the students to decide which project area that they want to embark in. Therefore, the main objective of this project is to develop a system that is able to match student to the supervisor using Stable Marriage Algorithm. Students who do not know lecturers area and which lecturer is suitable for their project can use this system in order to find lecturer's in the same area using this matching system. So, the problem face by students to find supervisor can be solve by using this system. At the analysis phase, students are assigned to the lecturer according to their area as preference list. |
|---|