4 ms·
If you want to get good at clarifying conditionals, take an electronics class and revel in the Karnaugh maps.
by batbomb 13y ago
If you want to get good at clarifying conditionals, take an electronics class and revel in the Karnaugh maps.
- bcbrown 13y agoThat was a very painful module to take, but it was incredibly useful.
- tsmith 13y ago+1 I transferred midway through my undergraduate degree, and was surprised to discover that Karnaugh maps weren't taught at my destination school - they are such an intuitive and straightforward mechanism for whittling down complex logic into its simplest form.
- nollidge 13y agoAlways go back to the K-maps.
- RamiK 13y agoNo 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.
- krisgee 13y agoYeah, K-maps were part of the circuit design course we had to take for our undergrad CS degree.
- signa11 13y agoyup, zvi-kohavi is a good text...
- dorian-graph 13y ago> 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?
- mindcrime 13y agoNo 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.
- baddox 13y agoA digital electronics class, more specifically.
- flpgr 13y agoI don't think this is necessary. I never wrote a conditional complicated enough to make me even think about getting down to K maps and I believe such a thing would be actually a smell and better be refactored as a whole. Knowing some boolean algebra is nice, though
- dugmartin 13y agoThey were covered when I took my first CS math class (discrete math) - I'd imagine they are still part of the standard basic CS core (that was 24 years ago so it might have changed)
- zerohp 13y agoI am at a highly ranked school right now and they are not covered in any CS class. Computer Engineering majors learn them in their introductory course.