| 
	
		
		
		
		 
			
			If you're trying to equate Karnaugh map with well-trained CS, then I think you're off-base. 
 
I have a mid-90s CS degree - systems programming track (Magna Cum Laude - pats self on back).  I just did a quick check of Introduction to Algorithms by Cormen, Leiserson, and Rivest, as well as Algorithms in C by Sedgewick.  Neither one mentions Karnaugh. 
 
I think an understanding of NP Completeness, or knowledge of the backpack problem or some such would be a better differentiator. 
 
But all that aside, I didn't get what you're trying to prove with this test.
		 
		
		
		
		
		
		
		
	 |