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 CSE 5th Sem 78321 Formal Language And Automata Theory Question Paper

Download PTU (Punjab Technical University) B.Tech (Bachelor of Technology) / BE (Bachelor of Engineering) 2021 January CSE 5th Sem 78321 Formal Language And Automata Theory Previous Question Paper

This post was last modified on 26 June 2021

This download link is referred from the post: PTU B.Tech 5th Semester Last 10 Years 2011-2021 Previous Question Papers|| Punjab Technical University


FirstRanker.com

Roll No. | | Total No. of Pages : 02
Total No. of Questions : 18

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

B.Tech. (CSE) (Sem.-5)

FORMAL LANGUAGE & AUTOMATA THEORY
Subject Code : BTCS-502-18
M.Code : 78321
Time : 3 Hrs. Max. Marks : 60

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

INSTRUCTION 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 has to attempt any FOUR questions.
  3. SECTION-C contains THREE questions carrying TEN marks each and students has to attempt any TWO questions.

SECTION-A

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

Answer briefly :

  1. If A={a, b} and B={a, c}, Find A* U B*.
  2. State Kleene’s Theorem.
  3. Find Regular Expression over {a,b} having set of all string containing exactly two a’s.
  4. Differentiate between typel and type2 grammar.
  5. --- Content provided by FirstRanker.com ---

  6. State Arden’s Theorem.
  7. Describe PDA.
  8. Differentiate between Injective and Surjective functions in a set.
  9. Write the steps needed for proving that a given set is not regular.
  10. Define Derivation Tree.
  11. --- Content provided by FirstRanker.com ---

  12. State Ambiguous grammar with example.

SECTION-B

  1. Describe pumping lemma for regular set with the help of an example.
  2. Prove that string represented by following transition system is (a+a(b +aa)*b)* a(b + aa)*a.
    a b
    S T A
  3. --- Content provided by FirstRanker.com ---

  4. Find a reduced grammar equivalent to the given grammar.
    S— AB A—a B—b B—C E—c
  5. What are the different types of Grammars and Languages associated with it.
  6. Discuss the Universality of Cellular Automata.

SECTION-C

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

  1. Find a grammar in GNF equivalent to the grammar.
    E—-E+T|T T=T*F|F F—(E)|a
  2. Discuss the various representations of Turing Machine.
  3. Design PDA for {wew'|w = {a,b}*}.

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.

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

FirstRanker.com



This download link is referred from the post: PTU B.Tech 5th Semester Last 10 Years 2011-2021 Previous Question Papers|| Punjab Technical University

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