Abstract
Starting kindergarten is an important milestone in children life. It provides platform for developing early childhood education that combines learning with play. These will develop children’s mind and connecting their brain cells for become creative thinker. However, uncomfortable environment and too packed schedule will lead the children to get tired easily. One of the ways to help the children is by optimize kindergarten schedule in order to increase their motor skills. A graph coloring method were used to develop the new schedule by considering the essential and preferential conditions provided by the organization. The greedy algorithm was used to color the graph and it was supported by the C++ program. The result concludes that only six minimal colors are needed for the graph. The color represents the minimum time slot required for the schedule. Though, the results obtained may be varied and different according to the different essential constraints given.
Metadata
Item Type: | Research Reports |
---|---|
Creators: | Creators Email / ID Num. Salleh Muner, Nur Nabilah UNSPECIFIED |
Subjects: | Q Science > QA Mathematics > Programming languages (Electronic computers) > C (Computer program language). C++ Q Science > QA Mathematics > Instruments and machines > Electronic Computers. Computer Science > Algorithms |
Divisions: | Universiti Teknologi MARA, Perlis > Arau Campus > Faculty of Computer and Mathematical Sciences |
Keywords: | kindergarten schedule ; graph colouring ; algorithm |
Date: | 10 October 2019 |
URI: | https://ir.uitm.edu.my/id/eprint/26090 |
Download
PPb_NUR NABILAH SALLEH MUNER CS R 19_5.pdf
Download (291kB)