TestMagic Forums - GRE Computer Science

Hello all

Ererlyorire — Sun, 15 Nov 2009 02:23:03 GMT

Hi,I am brand-new along this forum and only wanted to sound out hullo to you folks I desire we can experience some fun and interesting talks together Go For to speak to you soon ::::::::::::::::::::::::::::::::::::::::::::::::st artupnation com/profile/Zahnersatzkosten]My blog

Oct 10 2009

Quratulain2009 — Sat, 14 Nov 2009 08:56:42 GMT

How ETS will informed about result of grecs?
either email/send letter.

writing GRE subject test after the application deadline.

logicz — Mon, 09 Nov 2009 20:40:53 GMT

I am applying to rutgers for fall 2010. the dead line is feb 1st. in their website they say subject test is highly recommended. i have a gap of several years after my under graduate degree in Computer Science( though I was working in same field).

Can I apply with my GRE general score and mention in my personal statement that I shall take the subject test in April? Will they still consider my application?

It would be great if someone evaluate my profile and my chances.

I have a good GPA for my computer science undergrad course, worked in top MNCs for four years and then had to take a break for almost 3 years for personal reasons. During this break, I have assisted a Phd student for his thesis work and taken some professional certifications. Will this 3 year break hurt my application. I am really looking forward to going back to school and Rutgers is my only option due to location constraint.

How was AGRE? 7 nov 2009

omkar86 — Sat, 07 Nov 2009 08:04:01 GMT

Hi

just arrived from the test center.... solved ~60 questions and I am happy that I could solve these many questions given the short duration of time i spent on preparing :)

How was the test for others??

previous agre papers - legal ?

blah321 — Thu, 05 Nov 2009 07:08:41 GMT

In the yahoo grecs group
dir.groups.yahoo.com/group/grecs/
under Files, there are links to test questions for years '94 '97 '99 - are these Legal to use?

questions from time complexity

ckbest — Thu, 05 Nov 2009 03:51:31 GMT

any idea about the time complexity of following code?
1)
-------------------------------
i=1;
while(i <=n )
{
x = 2 * x;
i = i +2;
}

1) O(X^2)
2) O(X^n)
3) O(X^2/n)

-------------------------------

2) Let “rest(i)” return a sub array that is an part of array from i+1th elements to the end of original array. Then how many times will the following function be called in worst case?

Int Function( int[] a, int[] b){

Int i=0, j=0;
If( a[i] == b[j])
Return Function( rest(i) , rest(j)) +1;
Else
Return max(function(rest(i), rest(j+1)), function(rest(i+1),rest(j));
}

A. O(N) B. 0(nlogn) C. … D… E. O(2^n)

CS GRE November 7.2009

falp — Tue, 03 Nov 2009 16:42:15 GMT

Hi,

Anyone taking CS GRE on November 7, 2009 in India.
I have taken center as delhi but donno exactly how to get to exam center there.

I anyone with the same center pls reply

time complexity

ckbest — Tue, 03 Nov 2009 04:56:23 GMT

any idea about the time complexity of following code?
-------------------------------
i=1;
while(i <=n )
{
x = 2 * x;
i = i +2;
}

1) O(X^2)
2) O(X^n)
3) O(X^2/n)

-------------------------------

BNF: ets 1999 sample booklet question 26

blah321 — Mon, 02 Nov 2009 04:44:50 GMT

Stuck on these:

Question 26.
Expressions in a certain language can be described in Backus-Naur form as follows:
Expr = Term | Expr op1 Term
Term= Item | Term op2 Item
Item = variable | number

This syntax is most appropriate when the order of evaluation is
(A) from left to right always
(B) from left to right, but op1 takes precedence over op2
(C) from left to right, but op2 takes precedence over op1
(D) in any order, but op1 takes precedence over op2
(E) from right to left always

Answer:

SPOILER: C

----
Question 24.
Deduction in Prolog is based on the concept of unification. Two expressions E and F are said to be unifiable if there are substitutions for the variables of E and F that make the expressions lexically identical. In the following three expressions, only W, X, Y, and Z are variables.
I. f (W, W)
II. f (X, 1)
III. f (Y, g(Z))
Which of these expressions is (are) pairs of unifiable expressions?
(A) (I, II) only
(B) (I, III) only
(C) (II, III) only
(D) (I, II) and (I, III) only
(E) (I, II), (I, III), and (II, III)

Answer:

SPOILER: D

----
Questions 30-32 : Digital logic multiplication / parallel adder ?
Edit - For a similar circuit, see this link:

SPOILER: ecen3233.okstate.edu/PDF/Combinational%20Multiplier.pdf

The '99 booklet can be found in Files section of yahoo grecs group.

Taking the Computer Science Exam twice

atulr — Sun, 01 Nov 2009 18:40:26 GMT

Hi,
I will be taking the Computer Science Gre Exam this Nov. (7/11/09). But,unfortunately I couldn't manage to study for it. :(. So, this time it is just to get a feel for the exam. I plan to take it again in April, 2010(possibly in Sri Lanka). Will it be the right thing to do so? Will both my scores be reported? Thanks!!!

[Req]: Link to old ETS Comp Sci Sample paper

Enigma211 — Sat, 31 Oct 2009 13:36:15 GMT

The current sample paper was published in 02-03. Does anyone have a link to the older sample paper published by ETS ?

Thanks