Timeline for Most difficult subject/theory in Computer Science?
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 1, 2011 at 3:03 | history | made wiki | Post Made Community Wiki | ||
| Jan 31, 2011 at 18:08 | comment | added | David Thornley | DFAs and NFAs are chicken feed. Wait until you have to do LALR(1) parsing. | |
| Jan 31, 2011 at 15:07 | comment | added | Peter Turner | Yeah, I'd have had a harder time with Compilers if I hadn't taken Theory of Computation first. | |
| Jan 31, 2011 at 6:45 | history | edited | Yuva | CC BY-SA 2.5 | deleted 378 characters in body |
| Jan 31, 2011 at 5:41 | history | answered | Yuva | CC BY-SA 2.5 |