Abstract
The problems raised in this research proposalare how to design a computer programto solve graph coloring, how to visualize the semester examscheduling problems in Binus in graphs, and how the results of graph coloring in solving the problemof determining the semesterexamschedule. This problemcan be solved with the graph pointcoloring concept. Avertex coloring of graph G = (V, E) isan F:V N mappingwhere the neighboring pointsare differentcolors in N, i.e. iftheedge(u, v)arein E, then F (u) is notequalto F (v). The method used inwriting this proposalisaliteraturestudy, theformulation of problems regarding thecomputer programfromBitwise graph coloringwith asmallexperiment, modeling the semester exams in the TI-Stat Department of Binus University in the formof graphs, and the application of the computer programin scheduling the inward semester exams. graph form. Furthermore, the problemsolving is arranged in theformof discussion. Thestepsaretaken in creating acomputer programto solve graph coloring areto create pseudo-codefromBitwise graph coloring then convert it into the Python programming language.