FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download PTU B.Tech 2021 Jan IT 7th Sem 71983 Theory Of Computation Question Paper

Download PTU (Punjab Technical University) B.Tech (Bachelor of Technology) / BE (Bachelor of Engineering) 2021 January IT 7th Sem 71983 Theory Of Computation Previous Question Paper

This post was last modified on 26 June 2021

PTU B.Tech 2021 January Previous Question Papers || PTU Punjab Technical University


Total No. of Pages : 02

B.Tech (Information Technology) (Sem.-7)

THEORY OF COMPUTATION

Subject Code: BTIT-904

--- Content provided by⁠ FirstRanker.com ---

M.Code: 71983

Time: 3 Hrs. Max. Marks : 60

INSTRUCTIONS TO CANDIDATES :

  1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
  2. SECTION-B contains FIVE questions carrying FIVE marks each and students have to attempt any FOUR questions.
  3. --- Content provided by‌ FirstRanker.com ---

  4. SECTION-C contains THREE questions carrying TEN marks each and students have to attempt any TWO questions.

SECTION-A

Write briefly :

  1. L ? S*, Justify this formal language expression.
  2. Define the term 'Automation'.
  3. What is acceptability of a string by Finite Automaton?
  4. --- Content provided by​ FirstRanker.com ---

  5. What is left recursion?
  6. What is decidability?
  7. State Arden's theorem.
  8. Write rules for writing CNF grammar.
  9. State pumping lemma for CFG.
  10. --- Content provided by FirstRanker.com ---

  11. What are recursively enumerable languages?
  12. What is meant by halting problem in TM?

SECTION-B

  1. Explain Chomsky classification of Grammars with help of examples of each.
  2. What do you mean by parsing? How left most and right most derivation helps to find out the ambiguity in a grammar?
  3. Explain Chomsky normal form of CFG with the help of example.
  4. --- Content provided by‍ FirstRanker.com ---

  5. Convert the following NDFA to DFA :
  6. Find out whether the language L = {xnynzn | n = 1} is context free or not.

SECTION-C

  1. What is a context free grammar? Explain closure properties of Context free grammar.
  2. What are Turing machines? Explain different ways by which we can represent the Turing machines.
  3. --- Content provided by​ FirstRanker.com ---

  4. Write a short note on
    1. Recursively Enumerable Languages.
    2. LR(K) Grammars

NOTE: Disclosure of Identity by writing Mobile No. or Making of passing request on any page of Answer Sheet will lead to UMC against the Student.

FirstRanker.com

--- Content provided by‍ FirstRanker.com ---



This download link is referred from the post: PTU B.Tech 2021 January Previous Question Papers || PTU Punjab Technical University

--- Content provided by‍ FirstRanker.com ---