1. PROBLEM 1 Training Examples: Class 1 Training Examples: Class 2
You have to discriminate between Class 1 and Class 2.
Design a classifier that will find to which class the given below example belong.
Use any known to you Image processing methods to find features.
Illustrate the space of the problem using Karnaugh or Marquant charts or any other representation that you want.
Use any known to you Machine Learning method to classify the images.
Test example: Class = ?

2. PROBLEM 2 Training Examples: Class 2 Training Examples: Class 1
You have to discriminate between Class 1 and Class 2.
Design a classifier that will find to which class the given below example belong.
Use any known to you Image processing methods to find features.
Concentrate on a good preprocessing method to find features.
Continue doing the same as in Problem 1.
Test example: Class = ?

3. Problem 3 Given is function on the left.--
Given is function on the left.
Find all minimum SOP classifiers. Draw a Kmap for each.
Use voting to find the classifier based on all SOPs.
Find Decision Trees for five orders of variables. Draw a Kmap for each.
Use voting to find the classifier based on all Decision Trees. Draw a Kmap for final solution.
Use clustering method to find the classifier.

4. Problem 4 Given is function on the left.--
Given is function on the left.
Find the minimum SOP for the function.
Remove minterm and find all the minimum SOPs
Remove minterm and find all the minimum SOPs
Remove minterm and find all the minimum SOPs
Remove minterm and find all the minimum SOPs
The points above corresponded to the validation method “all but one”.
What did you learn from this experiment?
Calculate the accuracy of the method. Create the confusion matrix. Calculate false positive and false negative.
Repeat points 1-8 removing two points, which means 50% of data.
Draw conclusions from the entire experiment. - - -- 1 --

5. Problem 5 Given is function on the left.1 --
Given is function on the left.
Assume c,d to be the bound set. Assume a,b as a free set and disjoint decomposition.
Find the compatible columns using graph coloring.
Find the complete Ashenhurst/Curtis Decomposition.
Draw the Kmap of the learned function.
Draw the circuit learned.
Compare with SOP
Draw conclusions.
Can you find another decompositions? You will get additional points for each reasonable decomposition found. - -- 1 1 --