Jump to content
Urch Forums

crackit

Members
  • Posts

    90
  • Joined

Converted

  • My Tests
    No

crackit's Achievements

Newbie

Newbie (1/14)

1

Reputation

  1. hi kfree i am sure you will come out with flying colors, meanwhile I dont see on Cs-AGRE section. are you writing AGRE?
  2. Regular Sets Context free languages Context sensitive languages Turing machines P NP Regular sets ========= union intersection difference complement homomorpishm inverse homomorphism CFG ============= union language substituion Context sensitive languages ======================= ?????? Turing machines ============ union intersection P == union intersection difference complement kleene star NP === union intersection kleene star difference
  3. hi albaLed, let's take in genreal langaue L={w | w is divisible by n} then we can construct DFA for this language as follows 1) it will have 0 to n-1 states (total n states) 2) state I on input 1 will go to 2*i+1 (mod n) onj input 0 will go to 2*i ( mod n) for example, when n=3 there will be 3 states 0,1,2 state 0 on input 1 will go to 2*0+1 (mod 3) =1 on input 0 will go to 2*0 ( mod 3 )=0 state 2 on input 1 will go to 2* 2 +1 (mod 3) =2 on input 0 it will go to 2*2 +) (mod 3) =1 hope it helps from sas
  4. hi albaled, i think your solution is correct but there is simpler way. since the first two languages are regular. first construct the DFa that accepts that language and then convert that DFA to CFG. for example, for problem I, DFA is 0 1 q0 q0 q1 q1 q2 q0 q2 q1 q2 now to convert this DFA to CFG go as follow, 1) for each state of DFA assign a Nonteminal. let's call nonterminal associated with state b with N(b) 2) For each transition in DFA , we have one production, if DFA in state p goes to state q on input a then corresponding production is N(p) -> a N(q) 3) for each accepting state f . N(f) -> epsilon so, CFG for problem I that follows from DFA is S -> 0S | epsilon S-> 1A A -> 0B | 1S B -> 1 B | 0A hope it helps from sas
  5. I agree with jaideep answer to 2 should be y^z.
  6. hi kfree, answer is (2n C n). Coming to original question. Hi vik, youe are correct. But even the original question can be solved similarly. (n-1)^(m-1) is the answer. I will let you think over this/
  7. hi AlbaLed, thw answer is (n-1)C(m-2) if buckets are distinguishable. explaination lets arrange the spoons as @ @ @ @ ..... @ now lets denote buckets by | | so problems reduce to |@ @ @ ....... @| to place (m-2) "|" in (n-2) places.
  8. hi kfree, nice to meet you again! BEST of luck for GRE. you have got it tomorrow right. yes, the answer for directed graph is nc2 elaborating 1 2 3 . . .... .. n draw edge from each node to all the nodes below it and there are (n-1)+(n-2)+-----1+1 edges so it is(n 2) for undirected it is (n-1) . tree is the example. hope it helps
  9. hi all, hi grefever, Barron is more than enough. For verabl I used kaplan verbal workout. I highly recommend it. Where are you planning to apply? And in what course hi eagle, I will be applying in thoretical computer science. I have not yet finalized unvis!!!!!!!!!!!!!!!! some of the univs I have decided are UIUC, texas austin etc. hi kfree, yes, Just before the exams I went through the barron's math review. I found it very helpful. In quant I did not get problems based on about difficult concepts. All the problems were based on known concepts. BEST OF LUCK TO ALL you GUYS.
  10. hi vinay, i will love to help you. >>>>>>>>thts a gr8 score :-)))))) Thanx for this. I must thank you all you guys for the help I received from you. >>>>>>can you tell me abt your sections? like wht format vqv or qvq, >>>>>>difficulty, pacing or any nice things tht we have to consider to >>>>>>>achieve 800 especially in quants. I got QV no unidentified section. I am pretty sure of the first 15 questions. I remember my 5-10 questions were slightly tough. Ia m bound by ETS pledge so I cant reveal them. I finished the last question on last second. In fact, some windo poped up saying whether I want to record the answer or not. But I got research section at end. It was quant section. I am expecting $50 for it:D >>>>>>also words came frm barron's or any other source and RC's start >>>>>>>at which question and how wer they. At least I got all the words from barron. My first RC caqme after 15 questions. I almost gussed all the RC's. But I did well on all others. May be I was lucky I did not get RC in the begining. in quants, wht was the difficulty level, did you get perm & prob questions, wer they difficult, wht abt stats and coord geom questions. my test is on 22nd so please help me by solving these queries. wer you absolutely confident abt all your answers in quant section, wer you expecting 800 just after finishing the quants section. I sumtimes feel nervous during the prep tests while in the mid of quants section and thus commit stupid mistakes. wht accrding to you should Be mind set at a point when you encounter the most difficult questions. >>>> I think if you get all the first 5-7 questions correct then ETS will throw one or two really difficult questions. If you get them correct, then I think you have crossed the barrier. But if you get them wrong then ETS will repeat the pattern. So get all the first 15 questions correct. DOUBLE CHECK THEM SO THAT you DONT COMMIT STUPID MISTAKE. And the difficult questions will be different from the routine ones. so you have to apply the funds. ONE THING I NOTICED. Dont try to rush through. go slowly but make sure you dont get the initial questions wrong. In verbal I had 10 question in last five minutes but I was lucky I got only short RC's and simple antonyms. i will happy if you want more info
  11. hi ksan04, I) use combination. We are selecting three out of five II) use permutation. Here we are Event A)selecting three out of five first Event B) arraging the selected 3 books By fundamental theorem of counting Event AB can be done in 5c3 * 3! which is 5p3 hope it will help By the way I finished my GRE on 14th oct. I just want to say thanx to kfree and vinay , sonali and eagel. my scores are V 690 and Q 800. If I can be of any use to you guys, I would be happy to help you. I will meet some of you in AGRE (CS) section. Thanx a lot
×
×
  • Create New...