"Discrete Mathematics"

as i'm currently studying for my discrete math final i find myself wondering once again what's the application of any of this in programming?

here are some keywords to give you a quick refresher: truth tables, logical equivalences, propositional logic, predicate logic, relations vs. functions, equivalence relations, proof by contraposition/contradiction/induction

give me some god damn motivation

>>40
They ask mostly for help with assignments, which implies they undergo some university education

>>40
They don't. The teenagers from fagbook do.

I use truth tables and karnaugh maps every day while programming to optimise binary expressions and improve query performance. Proof by induction is another name for recursion.

>>42
What do you mean they don't? How do you explain their abuse of the quote function? Are you seriously defending /g/?

It's best not to talk about discreet math.

dont remember euclid needing your truth tables..

>>45 yes, you'll make it shy ^^
>>1 i aced that class (was sitting on a high B because i was slack with the homework.. then caned the exam ;) it's probably more useful than something like calculus for general programming, though calc has it's niches

>>30
I do not know what dictionary you are reading, but:
http://oxforddictionaries.com/definition/english/application?q=application
5 (also application program)  Computing a program or piece of software designed to fulfil a particular purpose:
a database application


>>43,47
THANK YOU!