thermis

I was screwed up by the test, guess many many of them and left 6 unanswered, however, this forum help did really help.

"It ends tomorrow". --Neo.

I've searched google with GRE "Subject test" "Computer Science" "recommened" I saw many universities mention about "670+ cs subj. recommened", some of them require "615+", but I saw only one says "800+ (77%ile) recommend", others usually mention only "cs subject test recommend". So, I think if your %ile is upper than 50, it might helpful !? ps. i'm looking for CS you rank 100+ to no name.. :D

What is your raw score ?

oh I get it, thnks.

t(n) = 2 t(n/2) + n log n should fit in the third rule of master method, since n ^ lg 2 Why they say it doesn't fit the rule 3 of master theory !?

my GPA is sux (below 2.5) my GRE general test is sux (q730, v350, awa 3.5) and not plan to retake it my TOEFL is also sux (243 com-based test, writing 5) and not plan to retake it I'm betting on the CS subject test in this 13 DEC, aiming for 80%ile + Please suggest some CS Universities that count on CS subject test more than GPA or other credentials. I don't want top universities, but universities that won't make my money waste on applying. -thanks

I think it is C,

I've been reading the old posts and confused with the solution below ---------------------------------- from nonevent99 ---------------------------------------------------------- Q11) If a system stores arrays in row-major order, and an array of 4-byte words A[100][200] starts at location 0x8000, give a formula for the location of element A[x][y]. How about if it's in column-major order? [orange] In row-major order, each row contains 200 elements. Each element is 4B. So each row is 800 bytes. I should have mentioned that these arrays are indexed from 0, as in C and Java (but not old-style Basic!) With that assumption, the location of A[x][y] would be 0x8000 + 800*rownum + 4*colnum, which is 0x8000 + 800*y + 4*x. In column major order, each column contains 100 elements, or 400 bytes per column. So the location is 0x8000 + 400*colnum + 4*rownum = 0x8000 + 400*x + 4*y -------------------------------------------------------------------------------------------------------------- >In row-major order, each row contains 200 elements. Each element is 4B. So each >row is 800 bytes. I agree, but >With that assumption, the location of A[x][y] would be 0x8000 + 800*rownum + >4*colnum, which is 0x8000 + 800*y + 4*x. I think it should be 0x8000 + 800*x + 4*y since in row-major order subscriptions in the right increase more radpidly than the left so the memory layout should be like this: !? [0 0][0 1][0 2]...[0 199] [1 0][1 1][1 2]...[1 199] [3 0][3 1][3 2]...[3 199] ... which is reverse with column-major order ---- >In column major order, each column contains 100 elements, or 400 bytes per > column. So the location is 0x8000 + 400*colnum + 4*rownum = 0x8000 + 400*x + 4*y so I believe should be 0x8000 + 400*y + 4*x instead !? Am I wrong !?

#18 1024*3 + 514 !?

BTW, 0! == 1

X1 & -Y1 tells us that if the X1 > Y1 (ie 10) the output is true since X1,Y1 is the most significant bit, in this case we can conclude that X > Y -(X1 xor Y1) tells us that if X1 == Y1 (ie 00,11) the result depends on the least significant bit in the last case if X1 Guessically, the logic should be used to compare X > Y

> 500ns * 50 + 2000ns * 1 = 25000ns + 2000ns = 27000ns 500ns * 49 + 2000ns *1 = 26500ns !?