basantikaveeru

I got my caltech acceptance letter in snailmail. A wait of 1 month after the interview, received it today. Hopefully you will get it soon too..:)

Hey Wood Rutgers is a nice school. Considering that you are a very committed and motivated fellow, you will make a great researcher. All the best in your future endeavors. May be we will get to see each other in some conference..:)

Wood I agree with you that it sounds very eerie. I know reagrding medical residency propsective doctors and hospitals create their own preference lists i.e. doctors specify their preferred hospitals list and hospitals specify preferred doctor's list. After that some physicians council match these lists and allot a hospital to a doctor. This as you can see could lead to some very distasteful results, but it is good for hospitals as they do not have to grapple with uncertainties. This sounded totally insane to me but its the way it is practiced in medical world. Back to grad schools. Now that you have put a question on my assumptions:p I did some mucking around and found this on coucil's resolution page http://www.cgsnet.org/PublicationsPolicyRes/resolutions.htm . Seems like universities can place an offer after 15th April but the student will have to show in writing that he has released the admission at the previously accepted school. Check the link and the details. See if you can make any conclusions...

Rafi Caltech invited bunch (around 11) of ppl for interview over the 26-27th Feb weekend. I was called for the interview but haven't heard back, will probably ping them next week. I am yet to hear from CMU (ECE), UTexas and UIUC (ECE). In my wisconsin admit letter professor had mentioned about some college graduate council. It seems most of the major universities subscribe to this council and share the prospective students information. The document says that a person can only confirm one financially supported position in US and this has to be done by April 15th. My guess is most of the universties come to know who all had been picked and had accepted the admissions on or after 15th April. After that, probably they send out the letters to the persons who are on the waiting list and had not accepted admission at any other place. Again this is only a conjecture. Hope this helps.

Congratulations! May all your dreamz come true..

Thanks Again Everyone! csquest# I only have bachelors degree. UCLA is considered a 'networking school', and I have a decent background in networking and distributed systems. This could be one reason of my selection.

Thanks everybody! I am admitted into CS deptt. Randhawa, Caltech had not put the offer on the table yet. I am meeting the prof on 27th then I will come to know if it flies. At caltech they put students into specific research group form the very first year where as at other places ppl decide after one year which research area to pick. Both systems had there own advantages. I will keep ppl updated about my details. Profile: BE CS from a top-tier college in India '97. I was 2nd in class. GRE: 790 Q 800 A 740 V TOFEL: 293 TSE:50 Experience: 6.5 yrs in industry in bay area start-ups. CS AGRE: 780 My AGRE and reccomendations were not all that great as I left college long back. Also I had no specific research done in acadaemic setting which was somewhat compensated by industry exp. Just to put things in prespective I did get regret emails from Berkeley and Stanford, but I guess I am not feeling all that bad..:)

Got the PhD admission letter from UCLA today and had been invited to join an info session at Caltech on Feb 27th. Hopefully I will be able to secure a place there too. Which one is better UCLA or Caltech? Update: Got admission fron UWisconsin Madison today (03/05) into their PhD program. 26-27th March is the welcome weekend. Went to Wisconsin welcome weekend. It is a very nice place with some really top notch faculty. Really tempted to join there, but having lived in India and california all my life, winters are scaring me off...:shy: Got accpetance letter from caltech today(04/02). Caltech took some time in accpeting me, but finally I got it. Grant is generous at Caltech. Rejects at: Berkeley, Stanford, UCSD (considered it as my safe school), GeorgiaTech. Waiting still: UIUC, Carnegie Mellon

Kinda late of replying to this thread but anyway.. eraoul, your first approach sounds right. Infinite sets are not very intutive. In your second approach, odd + even and even + odd are same considering '+' is a commutative operation, so 0+1 and 1+0 represents one operation. This means question posed by 'bb' in decimal system is still valid in binary system, which it should be.

Charlieboy, just to let you know, everybody wrting the paper signs a memo saying do not share the questions. Paper was cancelled last two times in china and india just because of this sharing, effecting people who prepared honestly. Please do not ask for questions.

Well, my paper was quite different than practice ones, makes one wonders why ETS even bothers to send out a practice test. On top of it quite a few questions were with those confusingly near answers, but over all difficulty-wise paper was OK. Wood, I think you should be able to get a decent score. Its a very good chance what you marked were all correct answers, 59-60 should put you in quite a comfortable position. Noevent is right, its time to get cranking on SOP and reccos. GRE scores are just one variable of the whole process. Finally I am also glad that this is over. Ohh....revising 4 years courses and all the changes since my undergrad (5 yrs back) in 4 weeks was enuff of an ordeal.

Updated my post above, on second thots I think for g(n) O(n^p) is tighter (a simple application of master's theorm).

Seems like some typo, f and g definition require 2 params but while calling only one param is being passed. Assuming single parameter functions, I am getting different answers: runtime = O(n) f(n) = f(n-p)+n^p f(n) = n^p + (n-p)^p + (n-2p)^p+.....+1 ------->(n/p terms) = O(n^(p+1)) for all p>=1 runtime= O(logpn) g(n) = n^p+(n/p)^p+....+1 ------>(lognp terms) value = O(logpn*n^p) for all p>=1

Q1) What machine recognizes regular languages? What machine recognizes context free languages? What machine recognizes recursively enumerable languages? Is there a strict hierarchy, and if so, what is it? RE - DFA/NDFA CFL - PDA REL - Turing machine RE Q2) If X is a CFL and Y is regular, is X intersect Y regular? How about CFL? How about recursively enumerable? CFL intersect RE = CFL Q3) How do "recursively enumerable" and "recursive" differ? RE Recursive langugaes can be generated and recognized by an algorithm. REL can also be generated by an algorithm, but may not be recognizable by one i.e. algo can run forever while trying to recognize one. Q4) What does "reducibility" mean? Who cares (in the context of recursiveness, and also NP-completeness)? One NP complete problem can be "reduced" to another one, by a ploynomial time algo. Recursiveness?? Q5) What is the Church-Turing thesis, and who cares? All computable functions can be computed on Turing machine. Q7) Give an example of a set for which no CFG exists. a^nb^nc^n where n>0 Q8) Give an example of a left-associative grammar. S->E+T T->E+T|E Q9) What are LL and LR grammars, and who cares? LL - left to right scan, leftmost reduction LR - left to right scan, rightmost reduction (corrected by wood) Q10) What is "tape"? Does adding more "tape" to a Turing Machine increase its power? Why or why not? (This is an intentionally ambiguous question. Take it where you will.) Not sure, I guess more tape more power. Q11) What is "stack"? Does adding more "stack" to a CFG-recognizing machine increase its power? Why or why not? (Ditto) adds more power, can become CFG recognizing m/c to TM Q16) If L is recursive, then, mark T or F for each one of the statements below: (T) L is recursively enumerable (T) L is decidable (T) L is infinite (T) L' is recursive ( T) L' is recursively enumerable ( T) L' is decidable ( T) L' is infinite (T) Could L represent all the prime numbers?

I tend to agree with noevent and wood. I think exam would not be a magnitude level different than practice one. Give and take on few sections, and over all might be around at same level. More important is the preparation and expectations on a section. Also over the years, the test takers have become much smarter. In 99 test booklet 800 is shown as 90 percentile, in the latest GRE report it has dropped to 77 ( ftp://ftp.ets.org/pub/gre/01210.pdf this is scaring the hell out of me:(, all top institutes want 90 percentile), though percentile calculation is not linear so 830 might mean 85-90 (I hope so:o).