Computer Science

[torkell]

I have a deep suspicion that I have been set trick questions for Foundations of Computer Science. The fact that one long regular expression appears to boil down to "(a+b)*" (translates as any string made up of zero or more a's and b's) means that I've either been set trick questions, or I've gone very wrong somewhere.

Let's hope it's the former.

Comments

[olego.livejournal.com]

Not as bad as my CS midterm:

"Prove that then number of connected components tends to 0."

It doesn't. And I proved that it tends to infinity. But dude!

[ladysparrow.livejournal.com]

Well, I'm completely and utterly computer/technology illiterate, so I won't even bother trying to understand that! Lol.