Computer Science GRE Study Guide, Appendix

Table of Contents

IV. Other Topics – 5%

A.    Example areas include numerical analysis, artificial intelligence, computer graphics, cryptography, security, and social issues.

1.      Cryptography is the study of using encrypting information. Integer factorization has an average case time complexity that is very long.

 

Note: Students are assumed to have mathematical background in the areas of calculus and linear algebra as applied to computer science.

Appendix

Further study

No study guide can cover all topics. I highly recommend taking time to break down blocks of code that you have not seen before. Being able to see how a piece of code works will help you on the exam.

 

I would also study more algorithms than I presented here. There were at least 4 algorithms on the test that I was not expecting to see.

 

Study your math. I know I say it 3 times in this document, but those questions can be easy if you take the time to refresh your math skills.

Greek letters

Name

Symbol

Meaning

Alpha

a

 

Beta

b

 

Epsilon

Î

Member of a set or an empty string

Lambda

λ

Empty string

Theta

Q

Average case of complexity

Omicron

O

Worst case of complexity, usually just called Big-O

Omega

W

Least case of complexity

⇒ Next section

Liked it? Take a second to support Hunter Hogan on Patreon!
Become a patron at Patreon!

I’m disabled & homeless.

I must earn money from advertisements.

Please whitelist my website and YouTube channel in your ad blocker or cookie blocker, such as Privacy Badger.

Thank you.