An Explanatory Comparison of Brute Force and Dynamic Programming Techniques to Solve the 0-1 Knapsack Problem

During examination periods in schools, the demand on the use of examination rooms usually increases thus necessitating an optimal allocation of such rooms. This work seeks to explore an optimal way of allocating examination rooms by modeling the problem as a 0-1 Knapsack problem. Two approaches namely the Brute force and Dynamic programming techniques are used and implemented in Excel® and NetBeans® environments. The obtained results showed that dynamic programming approach yields a more optimal result than the Brute force implementation