Oops! It appears that you have disabled your Javascript. In order for you to see this page as it is meant to appear, we ask that you please re-enable your Javascript!

Theory of Automata and Computation – Past (old) Papers for BSCS/MCS

Theory of Automata and Computation – Past (old) Papers for BSCS/MCS

Here, we are showing you past (old) papers of Theory of Automata and computation for BSCS and MCS classes.

Theory of Automata and Computation – Paper 1 for BSCS

Course Code: ConfidentialCourse Title: Theory of Automata and Computation
Teacher’s Name: ConfidentialTotal Marks: 30
Date & Time: ConfidentialTotal Time:  2 Hours
Student’s Name:Reg. No:

Question #1:                                                                                                               8 marks

Built the CFG   for the language of anb2n

Supported strings like L={abb,aabbbb,aaabbbbbb,……}

Question #2:                                                                                                               8 marks

Built the PDA   for the language of anb4n

Supported strings like L={abbbb,aabbbbbbbb,aaabbbbbbbbbbbb,……}

Question #3:                                                                                                               8 marks

Built the Turing machine for the language of anbn , where a=b.

Supported strings like L={abb,aabbbb,aaabbbbbb,……}

Question #4:                                                                                                               6 marks

Write the regular expression for the language of odd length strings

Supported strings like L={a,aba, aabaa, aabbbab,……}

Theory of Automata and Computation – Paper 2 for MCS

Course Code: ConfidentialCourse Title: Theory of Automata and Computation
Teacher’s Name: ConfidentialTotal Marks: 30
Date & Time: ConfidentialTotal Time:  2 Hours
Student’s Name:Reg. No:

Question #1:                                                                                                               6 marks

Built the CFG   for the language of ambn, Where m<n

Supported strings like L={abb,aabbb,aaabbbbbb,……}

Question #2:                                                                                                               6 marks

Built the PDA   for the language of anb3n

Supported strings like L={abbb,aabbbbbb,aaabbbbbbbbb,……}

Question #3:                                                                                                               6 marks

Built the Turing machine for the language of ambn, Where m>n

Supported strings like L={aab, aaaaabb, aaaaabbb, aaaabb,……}

Question #4:                                                                                                               6 marks

Write the regular expression for the language of even length strings

Supported strings like L={aa,bb, abba, baba,bbbb, ……}

Question #5:                                                                                                               6 marks

Built the PDA for the language of anbn

Supported strings like L={ab, aabb, aaabbb,……..}

Fazal Rehman Shamil Click Here to Know More
Instructor, Researcher, Blogger, SEO Expert, Poet and Publisher of International Journal Of Software, Technology & Science ISSN : 2616 - 5325
Dear Professors and Resarchers!You are welome to Cite these tutorials in your research or slides etc. Please don't forget to mention the reference of website. Copy Paste of text is strcitly forbidden. Images can be reuse because images are protected with watermark.