Write a C++ program which implements the Q-M algorithm and the Espresso algorithm. The algorithms should be modular. Input will come from a text file which contains the number of literals and product terms in the expression to be minimized. Assume that any number of expressions can be input.
The statement above is the description of my homework.
These two programs must be done before 10/27/03.
1) Complete and fully-functional working program(s) in executable form as well as complete source code of all work done.
2) Installation package that will install the software (in ready-to-run condition) on the platform(s) specified in this bid request.
3) Exclusive and complete copyrights to all work purchased. (No GPL, 3rd party components, etc. unless all copyright ramifications are explained AND AGREED TO by the buyer on the site).