View Single Post
Old 03-23-2004, 02:40 PM   #13
dar512
dar512 is now Pete Zicato
 
Join Date: May 2003
Location: Chicago suburb
Posts: 4,968
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.
dar512 is offline   Reply With Quote