Friday, April 27, 2018

B.Tech Information Technology Theory of computation 2017 Question paper Deemed university

1. Draw Chomsky Hierarchy with grammar, language and automata used.
2. Give description of automata theory.
3. Prove by Mathematical induction 1 + 3 + 5 + 7 + ... + 2n-1 = n2
4. Determine string acceptability of 01100 using transition function for below automata. Draw Transition table.
5. Define alphabet, string, language, grammar. Define Pigeon hole principle.

Section B
(Long Answer Type) 2 questions of 20 marks each (any 1)20
1. Prove by Mathematical induction 12+22+32+42+………+n2 = n(n+1)(2n+1)/6
2. Construct a DFA equivalent to the NFA given below:

Jezlin Marina

B.E Civil Engineer Graduated from Government College of Engineering Tirunelveli in the year 2016. She has developed this website for the welfare of students community not only for students under Anna University Chennai, but for all universities located in India. That's why her website is named as www.IndianUniversityQuestionPapers.com . If you don't find any study materials that you are looking for, you may intimate her through contact page of this website to know her so that it will be useful for providing them as early as possible. You can also share your own study materials and it can be published in this website after verification and reviewing. Thank you!