Anyone take the GRE Computer Science subject test?

[jman19]

Just wondering if anyone knows any good materials for studying for this test or if you could lend some insight into it. Thanks.

 

[Ameesh]

from my friends who have taken it, there are a lot of theory of computing questions so make sure you bone up on that.

 

[DaveSimmons]

It's been over a decade for me, but yes back then there were a lot of theory questions and also questions about / using non-procedural langauges (functional, logic, and symbolic programming). By now they've probably also added modeling / UML and patterns.

That test was work. I did well on it, but my brain was hurting after taking both the general and CS GRE tests on the same day.

 

[badmouse]

I took it about a million years ago. I think it still had questions about vaccuum tube cooling on it. It's probably changed a lot since then.

 

[Ameesh]

Originally posted by: badmouse
I took it about a million years ago. I think it still had questions about vaccuum tube cooling on it. It's probably changed a lot since then.

arent you a girl!? :shocked:

 

[ggavinmoss]

Originally posted by: Ameesh
from my friends who have taken it, there are a lot of theory of computing questions so make sure you bone up on that.

CS GRE: Revenge of the Pumping Lemma!

:shocked:

-geoff

 

[johnjbruin]

Originally posted by: ggavinmoss

Originally posted by: Ameesh
from my friends who have taken it, there are a lot of theory of computing questions so make sure you bone up on that.

CS GRE: Revenge of the Pumping Lemma!

:shocked:

-geoff

LAMO - pumping lemma - brings back memories

 

[Ameesh]

Originally posted by: johnjbruin

Originally posted by: ggavinmoss

Originally posted by: Ameesh
from my friends who have taken it, there are a lot of theory of computing questions so make sure you bone up on that.

CS GRE: Revenge of the Pumping Lemma!

:shocked:

-geoff

LAMO - pumping lemma - brings back memories

The Pumping Lemma

Any regular language L has a magic number p
And any long-enough word in L has the following property:
Amongst its first p symbols is a segment you can find
Whose repetition or omission leaves x amongst its kind.

So if you find a language L which fails this acid test,
And some long word you pump becomes distinct from all the rest,
By contradiction you have shown that language L is not
A regular guy, resiliant to the damage you have wrought.

But if, upon the other hand, x stays within its L,
Then either L is regular, or else you chose not well.
For w is xyz, and y cannot be null,
And y must come before p symbols have been read in full.

the pumping lemma makes baby jesus cry

 

[johnjbruin]

Originally posted by: Ameesh

Originally posted by: johnjbruin

Originally posted by: ggavinmoss

Originally posted by: Ameesh
from my friends who have taken it, there are a lot of theory of computing questions so make sure you bone up on that.

CS GRE: Revenge of the Pumping Lemma!

:shocked:

-geoff

LAMO - pumping lemma - brings back memories

The Pumping Lemma

Any regular language L has a magic number p
And any long-enough word in L has the following property:
Amongst its first p symbols is a segment you can find
Whose repetition or omission leaves x amongst its kind.

So if you find a language L which fails this acid test,
And some long word you pump becomes distinct from all the rest,
By contradiction you have shown that language L is not
A regular guy, resiliant to the damage you have wrought.

But if, upon the other hand, x stays within its L,
Then either L is regular, or else you chose not well.
For w is xyz, and y cannot be null,
And y must come before p symbols have been read in full.

the pumping lemma makes baby jesus cry

interesting description - haha

i so hated that class - lol - i dont think i remember any of it