-
Posts
33 -
Joined
Content Type
Profiles
Forums
Blogs
Events
Everything posted by rynosus
-
hi everyone check this link :http://tinyurl.com/78hte and select the "free download" option
-
hi everyone check this link :http://tinyurl.com/78hte
-
NP hard : All L which are complement of NP problems, soon i will post this problems also.
-
P problems : 1. Reachablitity problem 2. Eulers problem 3. whether to DFA are equivalent i.e. Is L(D1) = L(D2) ? where D1,D2 are Deterministic finite state automaton 4. 2-SAT problem NP problems: 1 All P and NP-Complete problems are NP 2 Whether two NDFA are equivalent i.e. Is L(N1) = L(N2) ? Where N1,N2 are Non Deterministic Finite State automaton 3. Whether two Regular Expressions are equivalent i.e. Is L(R1) = L(R2) ? where R1,R2 are regular expressions NP-complete problems 1. Bounded Tiling 2. SAT 3. C-SAT 4. 3-SAT, MAX-SAT 5. Directed Hamiltonian, Undirected Hamiltonian, Hamiltonian Circuit 6 Independent Set 7. Node Covering 8. Knapsack problem 9. Coloring problem 10. Subgraph Isomorphism Still there are lot, but i think i covered most of them.
-
I also agree with you.
-
@angelina you were in the right direction but assumption you took is incorrect, as Recursive Enumerable languages are Semidecidable or Turing Enumerable ,not Undecidable.
-
The answer is E L is infinite TRUE since only regular languages are finite L contains a recursive language TRUE as REC laguges are the proper subset of Recursive Enumerable Languages L' is undecidable TRUE
-
Here are the links : Introduction to automata theory, Hopcroft : http://tinyurl.com/9gfzs Computer Networks, Tanenbaum : http://tinyurl.com/c8ws6 Operating Systems , Galvin : http://tinyurl.com/7r6c2 Introduction to algorithms, Cormen : http://tinyurl.com/dxrqk -rynosus
-
i just downloaded the linke , its working fine Thanks kpp -rynosus
-
Congrats.......... HOw many Rcs you got ?
-
kaushal Excellent post, you covered every aspect but forget to mention any site or link to previous year question papers. -rynosus
-
hi ish :tup: CONGRATULATION:tup: how you feeling now, seems you become very popular, keep it up the good work -rynosus
-
which school
-
thanx guys
-
730 verbal 760 quant 1490 do I stand a chance
rynosus replied to bhavana's topic in Just Finished My GRE
thanx Madhu and Mansi4gre for the nice reply..... -
Thanx, gforce, i read lot of your previous mails, you helped a lot to all of us(means TM). [clap] A big round of applause to u.... Keep it up......
-
hi jigar657 www.grebible.com -rynosus
-
hi ewenty Yes, learning vocab is tough but really worth it. Even it helps you in your writing section. Once i read one message from Erin that inspires me a lot to learn more and more words. Might be Erin also inspires you. Actually i heard that Grebible doesn't have worth as they say. i am and more like me also looking to buy the product. Can you tell us, i mean all Test Magic aspirants who are willing to give GRE. that.how its Verbal section improves our GRE-score. As they say, we can score 750+ in verbal section by Grebible. But some of my friends .who have used it, says it is similar to any next product. Please tell us more how you felt, like its good and bad point, its Rc section, analogy ......etc. Does it really worth to buy the product? It is for all TM who have used GREbible please tell us about Grebible so that we can warn all other TM before buying GREbible. -rynosus
-
Thanx rajiv :tup: Yeah guys it is free and good for learning GRE vocabulary.
-
Thanx rajiv Yeah guys it is free and good for learing GRE vocabulary.
-
hello ewenty ,hi minud Can you tell me that GREbible really worth as he says in their webpage. Please share your experience with us about GREbible.
-
hi guys , check this above wordlist and tell me is this 5000+ word are really good for GRE except BARRON WORD LIST.
-
thanx knok In india, it's not easy so. I already checked all book stores, still hoping for good things to come. thanx again.
-
good rajiv keep it up [clap] soon i will post me sorted secondary word list.