microkernel

Hi Calm, Just thought of updating my final status. Finally, I got 5 acceptances, Arizona State, SUNY-Buffalo, UNCC, UFL-Gainesville, Ohio State University-Columbus. And I am going to Ohio State University. And, thanks a lot for all the help and so many informative posts of yours here. Good work :) - Microkernel

Hi Deepak, Firstly, textese is strictly prohibited in this forum, so I would like to advise you to edit your post as soon as possible, before a moderator issues you infraction. Now coming to your queries, here is my opinion. I believe you are referring to subject test GRE (AGRE) and not the general test here. See, AGRE is never a supplement to research experience or publications. Subjective, Coming from not so renowned university/known university (atleast I am/was unaware of this university), a good score would make your profile stronger. But again, graduate school admissions varies between universities and could be very unpredictable. So, you really can't say which school would give how much importance to your score. But in general, good AGRE scores help you. Be warned, AGRE and GATE are very different ball games. If you search well, you can see posts here mentioning people who score in upper 90%les in GATE unable to manage decent scores in AGRE. Please look at (2), adding to that, no university takes students solely on the basis of AGRE, but in my personal opinion, I believe, UFL, University of Texas-Austin, Rutgers value good AGRE score(Again personal opinion though). Again, Please never use textese in this forum, it hurts my eyes (and also strictly banned in this forum). Regards, Microkernel

As far as I know, Saarland is a very good university for Computer Science. But I am not sure how it is for Visual Computing. If its the only admit you have, then I would say there is no point in asking this question :D. So, tell us where all you have admits and then someone can give their opinion on your final destination.

They do count. The thing is, what the research paper was about (was it just some survey or some original research), where was it accepted and presented etc will be looked at when evaluating your profile. While giving admit your entire profile is looked at, so everything is important, and stress put on each factor vary among universities, so can't really tell if they make up for GPA, GRE etc (Again, how bad GRE and GPA are matters). In short, I can say, Good research papers give you many positive points and bad GPA, GRE give less positive or negative points and finally for your admit, total score matters. For funding, relevant research experience do give an advantage over others as Professors will be willing to fund someone with research experience in their field of research (with TA, RA etc). All the best :)

Hi Parin, Text books, Wikipedia, Titanium bits would be the way to go. (Check Calmlogic's signature for many useful links). You can also use some GATE study material for practice. All the best. :)

Hi unknownuser, Did we speak sometime back on Edulix? I go by the same name on edulix too. Anyways, I believe this is the best way you have to make it to the graduate school for Computer Science. Regarding your query on high score, You are the best person to answer this query :), all I can tell you is that, the exam is NOT going to be easy. So, go through the syllabus required and see how much time you have and if you can do it. when are you planning to take the exam by the way? If its October/November, with "full time" study, I see good chances of "decent" score... All the best :) Regarding, Microkernel

Good suggestion, I would take that too ;) I am applying to USC and UNCC as safes... Hoping atleast them to give me an admit. :)

Hi Calm, This is my profile Edulix For me UTD replied that I have low GPA as reason!!! I feel UTD is an erratic school because this season I have seen them giving admits to some not so good (or (below)mediocre) profiles but at the same time rejecting some good ones... And all the best with your prep... :)

True Calm, but I am looking at giving it in Nepal or Srilanka... because of travel component I am not sure yet... If I get admit with 740 score (58%le), I would drop the plan or else will continue... And sadly, UTD has rejected me and I now stand with 1 reject 0 accepts...

Just pay your tuition with it? You could have paid mine and hundreds of deserving people like "me"... ;)

Hi, This forum seems to be bit inactive after last November test. No one for April test? I am considering to take again, not sure though... Regards, Microkernel :)

Hmm, Got my scores by phone. Its 740, 58%le :| Guess reporting it would not hurt my chances. (Will it still not hurt in places like UCSD??? And yeah, NCSU tells 720 as guideline score. Am applying there ;) Anyways, thanks to everyone on the forum, especially Calm for all the help.

I am in... "Atleast" one for me please :)

Thanks Calm... :) I was just wondering if CS departments consider AGRE-Mathematics seriously, as CS departments put lot of emphasis on Mathematics background. But I agree with you, for me AGRE-CS will be the best option.

Hi guys, Do Admission committees for CS admission take into account your Subject test score in MATHEMATICS? No, I haven't given AGRE in Mathematics :). Out of curiousity I was looking at AGRE Mathematics sample paper, and it seemed quite easy to prepare (Unlike CS one :( ). And, as many Computer Science departments put lot of emphasis on your mathematics background (atleast this is what I have felt), I am just wondering if a AGRE-Mathematics score help you in your admissions? Regards, Microkernel

For Question-52, I guess Mergesort is the best choice, because, in selection sort, after running through the sublist to find the largest element, if you find the element to be in the right place, you are not required to swap. So, this reduces the runtime. But in Mergesort, u will decompose the list till its one element in length, and start merging the lists. Here being already sorted or not doesn't really make any difference in splitting and merging operations... This is my opinion. What do you guys say??? Regards, Microkernel

Hi guys, While preparing for my GRE, I found a site particularly helpful with my prep. Here is the link to it. RC Practice Utility By Lagnajeet Pradhan Thought this might help in your prep. All the best for your exams :tup: Regards, Microkernel

Hi Dhruv, I came to know from a friend that you can actually find 7th largest element in Linear time O(n)!!! This is how its done, Construct Max-heap out of Min-heap array - This takes O(n) And find the 7th largest in the Max-Heap - This takes O(logn) So, you end up doing it in O(n)+O(logn) = O(n)... Linear time!!! In the process you just destroyed your datastructure, congratulations... he he he :) But for the exam it may work!!! What do you say? Any comments, everyone?

Hmm, apart from ETS sample papers and Titanium bits, you can use Gate materials and MCQS in Computer Science for this. Please check Calmlogic's signature for many links that might help you. Also look at this thread http://www.www.urch.com/forums/gre-computer-science/12251-does-anyone-knows-link-gre-computer-science-1996-a-2.html

Hmm, sorted array has O(1) but it can still be bounded by O(nlogn), I agree, but isn't it weird to say that? Because then most of the algorithms can be bounded by O(n^n) or how about O(n^infinity)!!! Honestly, I would have had rejected the sorted array option here saying worst case is O(1)... Of course if you can do in O(1) you can do in O(nlogn), but how do you gauge this? Is it normal to test people this way? (I am not from Computer Science background, so this looks really weird).... My answer for each Data structure given are, 1) Min Heap - O(n*logn) (Finding kth smallest takes O(k*log-n), right?). 2) Sorted array - O(1) 3) Binary Search Tree - O(log-n) Are they right? Thanks, Microkernel

Wow, really motivating... ! [w00t]:crazy: :eek: Thanks Calm, I have started to put 1 extra hour everyday after reading this post... :)

No. Regular languages are subset of CFL. ex- Language like (a^n b^n) is CFL but not Regular. No this is not BNF. I think this is the restriction on CFG as a whole. Atleast thats what I could makeout of it. Look at point 3 here Context-free grammar - Wikipedia, the free encyclopedia. Somebody please confirm.

No, CFGs strictly have to be of the form (NON-TERMINAL)->(WHATEVER) So, I don't think its in CFG form, but not sure if you can deduce one from this or there is an equivalent CFG for this language. Regards, Microkernel

Thanks a lot Calm :)

Tuned in... :) Thanks a lot Calm [clap]