| Home |
| Me & My Family |
| Projects |
| My Interests |
| Contact |
|
Hello all, I have implemented the Quine-McCulsky Algorithm for the minimization of Boolean Expressions. The implementation has been done using Java Technology. Now i need your help. Please test this program on aa many inputs as you can and send me an email if there are any errors. You can download the files using the links specified below. Instructions 1. Download the class files. qm.class term.class 2. When you run the class files, it will ask for two inputs The first one is the total number of variables you have in your boolean expression, and the second is the expression itself in the SOP form Download the source code here qm.java term.java |
