News for hackers. Stuff that matters.
Re:Clearer Conditionals using De Morgan's Laws by RamiK on Friday December 20, 2013 @02:35PM (#6943461)
No need for a full blown electronics class. This subject falls under Switching Theory and can be covered thoroughly in the first (and often a single) semester. Starting with elementary set theory and boolean algebra, you go into the combinatorial logic (that covers De Morgan and Karnaugh), and finish with finite state machines (automata).

There are very few requisites too. Some high schools and trade schools teach the material to 16-18 year-olds in a year or two. I suspect this is partially why it's so often omitted in CS curriculum. It's too easy.

Re:Clearer Conditionals using De Morgan's Laws by dorian-graph on Saturday December 21, 2013 @02:58AM (#6946141)
> Starting with elementary set theory and boolean algebra, you go into the combinatorial logic (that covers De Morgan and Karnaugh), and finish with finite state machines (automata).

Do you happen to have a link to an online course, textbook or other resource that covers this in a combined way that flows to well?

Re:Clearer Conditionals using De Morgan's Laws by mindcrime on Saturday December 21, 2013 @07:05PM (#6948684)
No need for a full blown electronics class. This subject falls under Switching Theory and can be covered thoroughly in the first (and often a single) semester. Starting with elementary set theory and boolean algebra, you go into the combinatorial logic (that covers De Morgan and Karnaugh), and finish with finite state machines (automata).

My Discrete Math 101 course (UNC-Wilmington) covered Karnaugh Maps, along with a heavy dose of Boolean Algebra. For various historical reasons, I've actually taken Discrete Math twice, and have noticed that the content of a class titled such can very dramatically. The other Discrete Math course had much less emphasis on Boolean Algebra and logic, and a lot more on elements of probability and statistics.

Re:Clearer Conditionals using De Morgan's Laws by krisgee on Friday December 20, 2013 @07:15PM (#6945045)
Yeah, K-maps were part of the circuit design course we had to take for our undergrad CS degree.
Re:Clearer Conditionals using De Morgan's Laws by signa11 on Friday December 20, 2013 @07:44PM (#6945145)
yup, zvi-kohavi is a good text...