37 ms·
I am confused, this seems more like a general math cheatsheet. The only thing that truly has anything to do with theoretical CS are the definitions for the O-no
by lqet 5y ago
I am confused, this seems more like a general math cheatsheet. The only thing that truly has anything to do with theoretical CS are the definitions for the O-notation on the first page (and most CS students don't need a cheat-sheet for that) and the master theorem. Nothing on P, NP, NP-hardness or completeness, formal languages (Chomsky hierarchy?), finite automata, Turing machines, halting problem, decision problem, reduction proofs, Pumping lemma, Gödels incompleteness theorem, etc. This sheet would have been of very little help in any theoretical computer science exam I ever took. The only cheat sheet I ever needed in theoretical CS was Schönings book "Theoretische Informatik - kurz gefasst" ("A short overview of theoretical CS", well, it has ~180 pages...), which is pretty standard in German universities. It was completely worn out after my first semester + exam of theoretical CS... here is a TOC: http://www.gbv.de/dms/hebis-mainz/toc/094349797.pdf http://www.gbv.de/dms/hebis-mainz/toc/094349797.pdf
- SkeuomorphicBee 5y agoMore of a "Math for CS" cheatsheet. I agree that we can't call it a CS sheet as it has very few actual CS concepts (besides the O notation, I would also consider Graph Theory as CS), but I also wouldn't call it a general math sheet because it encompasses only an arbitrary small subset of math. Having said that, as a Math-for-CS sheet I found the section on matrices a bit light (missing quite a lot of linear algebra), and I missed the Fourier transform.
- emteycz 5y agoIsn't graph theory a very general (and generally used) math concept that is useful in CS, not the other way around?
- whimsicalism 5y agoYes
- zazen 5y agoYes, and so is asymptotic analysis and the associated big-O notation.