The Impact of Educational Marketing on Universities Performance

This paper addresses the results of the various publicity strategies undertaken by selected private management organizations in Vietnam. The study has also investigated the activities of students from BBA and MBA who have been hired by their management college both at home and abroad. The development model for this study comprises with 7ps of a marketing blend designed for schools. 342 students from 9 colleges received self-administered questionnaires. For the analysis of the findings obtained, descriptive figures were used. The study of available information found that the best consideration for BBA and MBA was suggested by mates. Word of mouth, i.e. guidance from friends and relatives, colleges and newspaper ads, has also proved popular. The BBA demand for registration was too heavy, although at the MBA level profiles and teaching methods were high on the agenda, as were the opportunities for future employment and better work. Students, non-school event schemes and library facilities were the subject of the results. The study findings show that a universitys reputation lies deeply in its ability to meet stakeholder expectations; in the present extremely competitive environment, brand credibility management can be considered an important issue for most universities.The research results may be helpful in favor of instructional programs for administrators that create the strategies to encourage success in a university. We conclude that the results of this study clarify the psychology of the students and create adequate outreach campaigns for all colleges, advertising organizations and government departments. It will also help supervise those activities to better respond to the needs of students and service providers and make it more attractive for all potential students in private colleges

CPU scheduling with a round Robin algorithm based on an effective time slice

The round robin algorithm is regarded as one of the most efficient and effective CPU scheduling techniques in computing. It centres on the processing time required for a CPU to execute available jobs. Although there are other CPU scheduling algorithms based on processing time which use different criteria, the round robin algorithm has gained much popularity due to its optimal time-shared environment. The effectiveness of this algorithm depends strongly on the choice of time quantum. This paper presents a new effective round robin CPU scheduling algorithm. The effectiveness here lies in the fact that the proposed algorithm depends on a dynamically allocated time quantum in each round. Its performance is compared with both traditional and enhanced round robin algorithms, and the findings demonstrate an improved performance in terms of average waiting time, average turnaround time and context switching