Mid terms IMPs for ToC GTU Computers Semester 6
- Ishita Raikar
- Mar 30
- 1 min read
TOC (Theory of Computation) explores the mathematical foundations of computing, including automata, formal languages, and computability. It helps in understanding the limits of what machines can compute.
Out of 30+ question banks, here are the top 10 questions from all the modules👇. (For additional resources, be sure to check out the website.)
Discuss chomsky hierarchy.
Discuss - universal Turing machine.
What important points do we derive from the Church-Turing thesis?
Discuss primitive recursive function using proper examples.
Discuss - recursively enumerable languages. OR Describe recursive languages and recursively enumerable languages.
Explain Moore machine and Mealy machine. Give an example of two equivalent machines of each type performing similar functions.
Draw DFA for the the language accepting strings ending with ’01’ over input alphabets ∑ = {0, 1}.
Draw NFA-Λ for ((0+1)*10 + (00)*(11)*)*.
What is an Ambiguous CFG? Explain with reference to dangling else problems.
Conversion from finite automata to grammar.
These important questions are your guide—study them well, practice consistently, and approach your exams with confidence. Success follows preparation!!
For answers, check out the new BH website!! Plus, here are all the other resources BH has to offer:
Bh.Papers-Highly Analyzed Past Year Question Papers
Bh.How to Pass- IMP plans to clean a subject
Bh.Questionbanks-IMP* Questions per module
Bh.Solutions (soon)-Past Paper’s Solutions
Bh.Notes-Q/A format module wise notes
Bh.Library-References and Textbooks
Bh.VIVAs-Q/A format VIVA/Oral Kit
Bh.Sample Papers-IMPs for mid terms & unit tests
Keep learning, keep growing with BrainHeaters!!
Comments