Full material
₦ 5,000 $(29)
| Pages | 50 |
| Delivery | Instant, after payment |
Project Details
| Department | Computer Science |
| Type | Project |
| Pages | 50 |
| Chapters | 5 |
| Format | MS Word & PDF |
| Reference No. | CPU0327 |
Abstract
This paper presents a graph-coloring-based algorithm for the exam scheduling application, with the objective of achieving fairness, accuracy, and optimal exam time period. Through the work, we consider few assumptions and constraints, closely related to the general exam scheduling problem, and mainly driven from accumulated experience at various collages. The performance of the algorithm is also a major concern of this paper. CHAPTER ONE 1.1INTRODUCTION An undirected graph G is an ordered pair (V, E) where V is a set of nodes and E is a set of non-directed edges between nodes. Two nodes are …
This is a preview.Unlock the full abstract, all chapters and references.
Unlock Full Material
Full material
₦ 5,000 $(29)
| Pages | 50 |
| Delivery | Instant, after payment |