Customizable algorithm for university timetabling and scheduling

University course timetable problem is considered to be Np hard problem which increases exponentially with the size of problem. In this paper we have introduced algorithm which is made in accordance with Mehran Uet (Pakistan) Timetable. Timetabling is a sort of issue in which events (slots, teachers, courses, and so on) must be organized into various slots to such an extent that conflicts must be avoided for given resources. New functions are introduced in accordance with soft and hard constraints to be satisfied accordance with Mehran Uet Pakistan.