A multitasking operating system allows many programs to run at the same time. We need to schedule our Central Processing Units (CPUs) efficiently to handle these services. CPU scheduling algorithms come in a score of forms and any strategy has advantages and disadvantages. We implemented a Multi-Level Feedback Queue (MLFQ) algorithm with static time quantum for the first queue, making an efficient scheduling algorithm of MLFQ dynamic time quantum used in the second queue. Other than that, we compared both results and observed which dynamic time quantum delivers the best result. In the first queue, we used the Round Robin (RR) algorithm with less quantum time for processes that have a short burst time. The process that had more burst time than the defined quantum in the first queue was allowed to move into the second queue. Here, we calculated the average burst time of all remaining processes and defined that burst time as a quantum for the second queue after the Shortest Job First (SJF) scheme was applied in this queue. As a result, 70% of the processes in the second queue was received CPU. Other processes moved into the lower queue (the last queue). Hence, this technique prevented the starvation problem for those processes which have large burst times.