Abstract:By virtue of associating and improving the graph coloring algorithm and maximal matching algorithm,a coloringmatching algorithm is proposed to solve the examarrangement problem.The algorithm has been used for the University of Shanghai for Science and Technology (USST) and shows its validity.