Trending ▼   ResFinder  

TAMIL NADU OPEN UNIVERSITY MCA - I (SEM 2) JUN 2009 : Theory Of Computer Science

2 pages, 14 questions, 0 questions with responses, 0 total responses,    0    0
mca_india
  
+Fave Message
 Home > mca_india >

Formatting page ...

Ws 6 MCA 420 MCA 10/ PGDCA 08 M.C.A. DEGREE/P.G.D.C.A. EXAMINATION JUNE 2009. Second Semester / First Year THEORY OF COMPUTER SCIENCE Time : 3 hours Maximum marks : 75 PART A (5 5 = 25 marks) Answer any FIVE questions. 1. Prove that R (S T) RS 2. Show that the language L regular. RT . 0 m1m ; m 0 is not 3. Write short note on non-context free language. 4. Explain briefly universal turing machine. 5. Show that plus-prod is primitive recursive. 6. Show that n 2 7. f (x) 3 log n O (n 2 ) . x 2 3x 1, g( x ) 2x 3 find f g, g f , f f , g g . Ws 6 PART B (5 10 = 50 marks) Answer any FIVE questions. 8. If the string automata? Justify. abab accepted by the finite state 9. Construct NDFA for the regular expression r a / b ab and convert it into DFA. 10. Construct the grammar for the language L(G ) { a n ba n / n 1} . 11. Design Turing machine to accept the language L { b n d n / n 1} . 12. Explain various types of problems. 13. Discuss about pushdown automata. 14. Discuss about the application of context free grammar. 2 MCA 420

Formatting page ...

 

  Print intermediate debugging step

Show debugging info


 

Additional Info : Mca - I (sem 2) June 2009 Question Paper - Theory Of Computer Science
Tags : mca exam papers, mca question papers, ignou mca question papers, ptu mca question papers, mca sample question paper, mca mumbai university question papers, mca exam syllabus, mca exam question paper, online mca exam papers, online mca exam preparation, mumbai university mca question papers, ignou university mca question papers  


© 2010 - 2025 ResPaper. Terms of ServiceContact Us Advertise with us

 

mca_india chat