Loading...
Loading...
Loading...
Browse any CCS Thesis Abstracts

ccs.sluc@dmmmsu.edu.ph

(072) 687-5990

Details

Simultaneous and Sequential Approaches Using Naive Bayes Algorithm and Nearest Neighbors Algorithm in a Class Scheduling System

Keywords: Algorithm Naive Bayes Nearest-Neighbor

The use of algorithm has been widespread because it offers great potential in the field of Computer Science. This study aims to compare the sequential and simultaneous approaches of the algorithms: Naive Bayes Algorithm to check the duplications, and Nearest-Neighbors Algorithm to allocate thr mot ideal room for the schedule which is implemented in the class scheduling system of Sto. Tomas National High School. Big O notation was also used to assess the time complexity of the approaches. Based on the findings using the algorithms, simultaneous approach was cautious in creating schedule and the checking of the data was repetitive so there is possibility of duplication. As for the sequential approach, it simplifies the generating of schedule because it has lesser phases or steps. Thus, the researchers conclude that using sequential approach is more efficient and faster than the simultaneous approach.

Submitted on 2018-05
97 views
Authors
Lemuel V. Caras
Ricardo C. Bucasas Jr.
Julius Bryan P. Galvan
Ivory M. Laroco
Jerico P. Peralta
Benus M. Pigao
Rica S. Refuerzo
Gladys M. Solomon
Soledad Vanessa A. Viray
Panel Members
Enrico G. Dacanay, MIT
Maria Concepcion G. Balcita, MIT
Ezekiel D. Bacungan
Isidro L. Duran, LPT, MIT Ed. D.
Emely A. Munar, MIT

Popular Links

Get In Touch

DMMMSU CCS Building, Consolacion, Agoo, La Union

ccs.sluc@dmmmsu.edu.ph

(072) 687-5990

Follow Us

© e-CTM 2026. All Rights Reserved.