|
|
|
|
|
by ecshafer
1474 days ago
|
|
I don't believe that is true. As a trivial example, to say that you have never used Discrete Math in your work means that you have never for example write if(a && b) or have never done if(!a && !b) and judged it to be cleaner than if(!(a || b)). This also means that you never used a finite state machine, strings, combinatorics, trees, graphs or modulus. I would believe that you have not explicitly sat down and worked out Discrete Mathematics proofs. But the ideas of Discrete Math are pervasive and unlikely that you have never used them. |
|
There are several algorithms (in for example graphs and crypto) that you can not understand or implement without discrete maths. But even then, only the basic level is required.
Maybe only guy ever needs to know these things in a FAANG? (Meaning, could implementing these algorithms keep more than guy busy?)