angelina24

i agree with whyworryin, nice explanation

yeah answer is E L' can be undecidable

The answer is B As L is undecidable , take any case like Recursive Enumerable languages RE can be infinite , so statement I is true Recursive languges are the proper subset of RE, so statement II is true If Complement of RE is also Undecidable then RE becomes Recursive that makes RE as Decidable languages which is not true. So statement III is false So statement I and II are true but III is false Others Opinions are welcome -angelina

The answer is C : 2 to the power N Since we are talking about every NFA to DFA type not any particular instance of NFA to DFA, so its the min as well as the max states required. Others opinions are welcome

The dates are: NOv 12, 2005 Dec 10, 2005 and April 1, 2006

Hi guys Anybody has solution of Discrete Mathematics by Kenneth H. Rosen (T.M.H Publication) Why don't we share the solutions of standard books of agre CS : Networking : Tanenbaum Digital Design : Moris Manu Computer Architecture : Moris Manu Computer Organization: J.P.Hayes Discrete Mathematics: Kenneth.H.Rosen Introduction to Algorithm : cormen ( already posted by "kpp" , see previous post) Operating System: Galvin Operating System: William Stalling Data Base : Navathe DataBase Management : Korth Fundamental of data Structure : Tanenbaum Compilers Tools and technique : Ullman Introduction to Automata theory languages and computation : Ullman,John Hopcroft This post also helps those looking for good books for agre CS If i miss any one then please tell me

Thanks a lot kpp kool dude

nice website for SOP

Nice score chap. Could you tell us how did you prepare and the difficulty level of exam

hi everyone Nice Collection of books but where do we get the previous year questions for practice