SlideShare uma empresa Scribd logo
1 de 4
Baixar para ler offline
EXPECTED QUESTIONS
BRANCH: CSE SEMESTER: 5TH
SUB: THEORY OF COMPUTATION
PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH
Short questions:
1. What is the difference between DFA and NFA?
2. Design a NFA which accepts set of all binary strings 1100 or 1010 as substring.
3. Write the regular expression over alphabet Ʃ ={a,b,c}, containing atleast one a and atleast one b.
4. State the difference between Moore machine and Mealy machine? What is the length of the
output string for Moore machine for input string of length k?
5. Design a DFA for the language containing all strings on which leftmost symbol differs from
rightmost symbol over Ʃ ={a,b}?
6. Define the meaning of terminals and non-terminals.
7. What do you understand by decidable?
8. Design PDA for the grammar given below:
S->aS|a|c
9. State Chomsky normal form with an example.
10. Describe Chomsky’s classification of language of automata theory.
11. What is the difference between language and grammar?
12. Write at least two difference between natural language and formal language.
13. Distinguish between context free context sensitive language.
14. State the difference between NP-complete and NP- hard problems.
15. Explain what it means for a language to be class P ? Give two examples of class P problem.
16. What do you mean by recursive and recursively enumerable language?
17. What is the difference between finite automata and turing machine.
18. What is theory of computation?
19. Define linear bounded automata with an example.
20. Explain decidability concept of CFG.
21. What do you understand by a language accepted by PDA by empty stack.
22. Design a DFA for even number of 1’s over Ʃ ={0,1}.
23. What is a useless symbol and how can they be removed from a grammar?
EXPECTED QUESTIONS
BRANCH: CSE SEMESTER: 5TH
SUB: THEORY OF COMPUTATION
PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH
24. What is maximum number of states in a DFA that is converted from an NFA of n number of
states.
25. What is ambiguity in CFG? Explain with an example.
26. What is Church Turing hypothesis?
27. What Clique problem? Explain with an example.
28. Define PCP(post correspondence problem).
29. What is muti-tape and multi-head turing machine.
30. Define the ID(instantaneous description) of PDA.
31. Differentiate between positive closure and kleen closure .
32. What is transition system? Explain with example.
33. Design an NFA which accept set of all binary strings containing the 3rd
symbol from the left end
is 1 and 2nd
symbol from left end is 0 .
34. What is –closure of a set? Explain with an example.
35. What is godel number?
36. Consider the following grammar
S->a|abSb|aAb
A->bS|aAAb| ϵ
And derive the string abababb by using rm (rightmost) derivation.
Long questions:
1. Construct a DFA equivalent to M=({q0,q1}, {0,1}, δ, q0, { q0 }) Where δ is defined by
its state table as follows.
__________________________________________________
State/Alphabet 0 1
__________________________________________________
 q0 q0 q1
q1 q1 q0, q1
___________________________________________________
2. Define pumping lemma. Show that L={an
| n is prime } is not regular.
3. State and prove Arden’s theorem ?
EXPECTED QUESTIONS
BRANCH: CSE SEMESTER: 5TH
SUB: THEORY OF COMPUTATION
PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH
Find out the regular expression for the following transition diagram.
0 1 1 0,1
1 1 0
4. Define Griebach normal form. Convert the following grammar to Griebach normal form
S ->AA|a, A->SS|b
5. Let P be the set of all palindromes over {a,b}. Construct the grammar that generates P.
6. Design a turing machine to find 1’s complement of a binary number.
7. Costruct NFA for the following regular expression
i) a(ab)*aa
ii) (ab+bb)*
8. Show that P is closed under a) union, b) concatenation and c)complementation
9. What is the difference between moore machine and mealy machine ?
10. Design a DFA for the language which will accept all binary strings divisible by 3 .
11. Show that the language L={an
cbn
|n≥ 1} is accepted by a PDA.
12. Prove that for every NFA ,if L is the step accepted by NFA, then there exists a DFA which also
accepts L.
13. State and prove undecidability of post correspondence problem.
14. State and prove Arden’s theorem.
15. Write short notes on:
a) Universal turing machine
b) Church turing hypothesis
c) Normal form
d) Counter machine
16. Prove or disprove the following regular expression r,s
a) (R+S)*=R*+S*
b) (rs+r)*=r*+(sr+r)*
17. Give a context free grammar that generates the language L={w|{a,b}*:w contains atleast three a’s}
18. Find the language generated by the following
q3
q2q1
EXPECTED QUESTIONS
BRANCH: CSE SEMESTER: 5TH
SUB: THEORY OF COMPUTATION
PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH
a) S->0S1|0A, A->1A|1
b) S->0S1|0A|0|1B|1A
19. What is Ackermann’s function.
Compute the value of A(1,1), A(2,1) using Ackermann’s function.

Mais conteúdo relacionado

Mais procurados

Deterministic Finite Automata (DFA)
Deterministic Finite Automata (DFA)Deterministic Finite Automata (DFA)
Deterministic Finite Automata (DFA)Animesh Chaturvedi
 
Theory of computing presentation
Theory of computing presentationTheory of computing presentation
Theory of computing presentationMd. Touhidur Rahman
 
Formal Languages and Automata Theory unit 4
Formal Languages and Automata Theory unit 4Formal Languages and Automata Theory unit 4
Formal Languages and Automata Theory unit 4Srimatre K
 
Lec 13. Introduction to Pointers
Lec 13. Introduction to PointersLec 13. Introduction to Pointers
Lec 13. Introduction to PointersRushdi Shams
 
Introduction TO Finite Automata
Introduction TO Finite AutomataIntroduction TO Finite Automata
Introduction TO Finite AutomataRatnakar Mikkili
 
Formal Languages and Automata Theory unit 5
Formal Languages and Automata Theory unit 5Formal Languages and Automata Theory unit 5
Formal Languages and Automata Theory unit 5Srimatre K
 
NFA Non Deterministic Finite Automata by Mudasir khushik
NFA Non Deterministic Finite Automata by Mudasir khushikNFA Non Deterministic Finite Automata by Mudasir khushik
NFA Non Deterministic Finite Automata by Mudasir khushikMudsaraliKhushik
 
Crypto theory to practice
Crypto theory to practiceCrypto theory to practice
Crypto theory to practiceHarry Potter
 

Mais procurados (15)

Deterministic Finite Automata (DFA)
Deterministic Finite Automata (DFA)Deterministic Finite Automata (DFA)
Deterministic Finite Automata (DFA)
 
Dfa basics
Dfa basicsDfa basics
Dfa basics
 
Theory of computing presentation
Theory of computing presentationTheory of computing presentation
Theory of computing presentation
 
Formal Languages and Automata Theory unit 4
Formal Languages and Automata Theory unit 4Formal Languages and Automata Theory unit 4
Formal Languages and Automata Theory unit 4
 
Lesson 10
Lesson 10Lesson 10
Lesson 10
 
Lec 13. Introduction to Pointers
Lec 13. Introduction to PointersLec 13. Introduction to Pointers
Lec 13. Introduction to Pointers
 
Introduction TO Finite Automata
Introduction TO Finite AutomataIntroduction TO Finite Automata
Introduction TO Finite Automata
 
Finite Automata
Finite AutomataFinite Automata
Finite Automata
 
Fafl notes [2010] (sjbit)
Fafl notes [2010] (sjbit)Fafl notes [2010] (sjbit)
Fafl notes [2010] (sjbit)
 
C# p5
C# p5C# p5
C# p5
 
Lesson 08
Lesson 08Lesson 08
Lesson 08
 
Formal Languages and Automata Theory unit 5
Formal Languages and Automata Theory unit 5Formal Languages and Automata Theory unit 5
Formal Languages and Automata Theory unit 5
 
Pumming Lemma
Pumming LemmaPumming Lemma
Pumming Lemma
 
NFA Non Deterministic Finite Automata by Mudasir khushik
NFA Non Deterministic Finite Automata by Mudasir khushikNFA Non Deterministic Finite Automata by Mudasir khushik
NFA Non Deterministic Finite Automata by Mudasir khushik
 
Crypto theory to practice
Crypto theory to practiceCrypto theory to practice
Crypto theory to practice
 

Destaque

Expected questions tc
Expected questions tcExpected questions tc
Expected questions tcSANTOSH RATH
 
Oops model question
Oops model questionOops model question
Oops model questionSANTOSH RATH
 
( Becs 2208 ) database management system
( Becs 2208 ) database management system( Becs 2208 ) database management system
( Becs 2208 ) database management systemSANTOSH RATH
 
Expected questions for dbms
Expected questions for dbmsExpected questions for dbms
Expected questions for dbmsSANTOSH RATH
 
Expected questions tc
Expected questions tcExpected questions tc
Expected questions tcSANTOSH RATH
 
Lesson plan proforma progrmming in c
Lesson plan proforma progrmming in cLesson plan proforma progrmming in c
Lesson plan proforma progrmming in cSANTOSH RATH
 
Module wise format oops questions
Module wise format oops questionsModule wise format oops questions
Module wise format oops questionsSANTOSH RATH
 
System Programming Unit II
System Programming Unit IISystem Programming Unit II
System Programming Unit IIManoj Patil
 
Data structure using c bcse 3102 pcs 1002
Data structure using c bcse 3102 pcs 1002Data structure using c bcse 3102 pcs 1002
Data structure using c bcse 3102 pcs 1002SANTOSH RATH
 
Expected questions for dbms
Expected questions for dbmsExpected questions for dbms
Expected questions for dbmsSANTOSH RATH
 
Loaders ( system programming )
Loaders ( system programming ) Loaders ( system programming )
Loaders ( system programming ) Adarsh Patel
 
Lesson plan proforma database management system
Lesson plan proforma database management systemLesson plan proforma database management system
Lesson plan proforma database management systemSANTOSH RATH
 
System programming note
System programming noteSystem programming note
System programming noteSANTOSH RATH
 

Destaque (20)

2011dbms
2011dbms2011dbms
2011dbms
 
Expected questions tc
Expected questions tcExpected questions tc
Expected questions tc
 
Progr1
Progr1Progr1
Progr1
 
Oops model question
Oops model questionOops model question
Oops model question
 
Rdbms2010
Rdbms2010Rdbms2010
Rdbms2010
 
( Becs 2208 ) database management system
( Becs 2208 ) database management system( Becs 2208 ) database management system
( Becs 2208 ) database management system
 
Expected questions for dbms
Expected questions for dbmsExpected questions for dbms
Expected questions for dbms
 
Expected questions tc
Expected questions tcExpected questions tc
Expected questions tc
 
Ds using c 2009
Ds using c 2009Ds using c 2009
Ds using c 2009
 
2006dbms
2006dbms2006dbms
2006dbms
 
Smqa unit iv
Smqa unit iv Smqa unit iv
Smqa unit iv
 
Smqa unit v
Smqa unit v Smqa unit v
Smqa unit v
 
Lesson plan proforma progrmming in c
Lesson plan proforma progrmming in cLesson plan proforma progrmming in c
Lesson plan proforma progrmming in c
 
Module wise format oops questions
Module wise format oops questionsModule wise format oops questions
Module wise format oops questions
 
System Programming Unit II
System Programming Unit IISystem Programming Unit II
System Programming Unit II
 
Data structure using c bcse 3102 pcs 1002
Data structure using c bcse 3102 pcs 1002Data structure using c bcse 3102 pcs 1002
Data structure using c bcse 3102 pcs 1002
 
Expected questions for dbms
Expected questions for dbmsExpected questions for dbms
Expected questions for dbms
 
Loaders ( system programming )
Loaders ( system programming ) Loaders ( system programming )
Loaders ( system programming )
 
Lesson plan proforma database management system
Lesson plan proforma database management systemLesson plan proforma database management system
Lesson plan proforma database management system
 
System programming note
System programming noteSystem programming note
System programming note
 

Semelhante a Expected questions tc

TOC Solutions-Adi.pdf
TOC Solutions-Adi.pdfTOC Solutions-Adi.pdf
TOC Solutions-Adi.pdfAdiseshaK
 
TOC_Solutions-Adi.pdf
TOC_Solutions-Adi.pdfTOC_Solutions-Adi.pdf
TOC_Solutions-Adi.pdfAdiseshaK
 
Cs2303 theory of computation all anna University question papers
Cs2303 theory of computation all anna University question papersCs2303 theory of computation all anna University question papers
Cs2303 theory of computation all anna University question papersappasami
 
V cse cs6503 model qb1 1
V  cse cs6503  model qb1 1V  cse cs6503  model qb1 1
V cse cs6503 model qb1 1Ezhumalai p
 
Cs6503 theory of computation november december 2016
Cs6503 theory of computation november december 2016Cs6503 theory of computation november december 2016
Cs6503 theory of computation november december 2016appasami
 
Cs6503 theory of computation may june 2016 be cse anna university question paper
Cs6503 theory of computation may june 2016 be cse anna university question paperCs6503 theory of computation may june 2016 be cse anna university question paper
Cs6503 theory of computation may june 2016 be cse anna university question paperappasami
 
Cs2303 theory of computation november december 2015
Cs2303 theory of computation november december 2015Cs2303 theory of computation november december 2015
Cs2303 theory of computation november december 2015appasami
 
Cs2303 theory of computation may june 2016
Cs2303 theory of computation may june 2016Cs2303 theory of computation may june 2016
Cs2303 theory of computation may june 2016appasami
 
Theory of computing
Theory of computingTheory of computing
Theory of computingRanjan Kumar
 
Information Theory and Coding Question Bank
Information Theory and Coding Question BankInformation Theory and Coding Question Bank
Information Theory and Coding Question Bankmiraclebabu
 
finite_automata.ppt
finite_automata.pptfinite_automata.ppt
finite_automata.pptAkhlasHashim
 
Ch 2.pptx
Ch 2.pptxCh 2.pptx
Ch 2.pptxwoldu2
 

Semelhante a Expected questions tc (20)

TOC question bank.pdf
TOC question bank.pdfTOC question bank.pdf
TOC question bank.pdf
 
Question bank toafl
Question bank toaflQuestion bank toafl
Question bank toafl
 
TOC_Solutions-Adi.pdf
TOC_Solutions-Adi.pdfTOC_Solutions-Adi.pdf
TOC_Solutions-Adi.pdf
 
TOC Solutions-Adi.pdf
TOC Solutions-Adi.pdfTOC Solutions-Adi.pdf
TOC Solutions-Adi.pdf
 
TOC_Solutions-Adi.pdf
TOC_Solutions-Adi.pdfTOC_Solutions-Adi.pdf
TOC_Solutions-Adi.pdf
 
Cs2303 theory of computation all anna University question papers
Cs2303 theory of computation all anna University question papersCs2303 theory of computation all anna University question papers
Cs2303 theory of computation all anna University question papers
 
V cse cs6503 model qb1 1
V  cse cs6503  model qb1 1V  cse cs6503  model qb1 1
V cse cs6503 model qb1 1
 
Cs6503 theory of computation november december 2016
Cs6503 theory of computation november december 2016Cs6503 theory of computation november december 2016
Cs6503 theory of computation november december 2016
 
Cs6503 theory of computation may june 2016 be cse anna university question paper
Cs6503 theory of computation may june 2016 be cse anna university question paperCs6503 theory of computation may june 2016 be cse anna university question paper
Cs6503 theory of computation may june 2016 be cse anna university question paper
 
Cs2303 theory of computation november december 2015
Cs2303 theory of computation november december 2015Cs2303 theory of computation november december 2015
Cs2303 theory of computation november december 2015
 
UNIT 2.pdf
UNIT 2.pdfUNIT 2.pdf
UNIT 2.pdf
 
Model toc
Model tocModel toc
Model toc
 
Cs2303 theory of computation may june 2016
Cs2303 theory of computation may june 2016Cs2303 theory of computation may june 2016
Cs2303 theory of computation may june 2016
 
Theory of computing
Theory of computingTheory of computing
Theory of computing
 
toc_model_qp2-.pdf
toc_model_qp2-.pdftoc_model_qp2-.pdf
toc_model_qp2-.pdf
 
QB104545.pdf
QB104545.pdfQB104545.pdf
QB104545.pdf
 
SS UI Lecture 6
SS UI Lecture 6SS UI Lecture 6
SS UI Lecture 6
 
Information Theory and Coding Question Bank
Information Theory and Coding Question BankInformation Theory and Coding Question Bank
Information Theory and Coding Question Bank
 
finite_automata.ppt
finite_automata.pptfinite_automata.ppt
finite_automata.ppt
 
Ch 2.pptx
Ch 2.pptxCh 2.pptx
Ch 2.pptx
 

Mais de SANTOSH RATH

Mais de SANTOSH RATH (14)

Operating system notes
Operating system notesOperating system notes
Operating system notes
 
Os notes
Os notesOs notes
Os notes
 
OS ASSIGNMENT 2
OS ASSIGNMENT 2OS ASSIGNMENT 2
OS ASSIGNMENT 2
 
OS ASSIGNMENT-1
OS ASSIGNMENT-1OS ASSIGNMENT-1
OS ASSIGNMENT-1
 
OS ASSIGNMENT 3
OS ASSIGNMENT 3OS ASSIGNMENT 3
OS ASSIGNMENT 3
 
Btech 2nd ds_2008.ppt
Btech 2nd ds_2008.pptBtech 2nd ds_2008.ppt
Btech 2nd ds_2008.ppt
 
Btech 2nd ds_2007.ppt
Btech 2nd ds_2007.pptBtech 2nd ds_2007.ppt
Btech 2nd ds_2007.ppt
 
Btech 2nd ds_2005.ppt
Btech 2nd ds_2005.pptBtech 2nd ds_2005.ppt
Btech 2nd ds_2005.ppt
 
Ds using c 2011
Ds using c 2011Ds using c 2011
Ds using c 2011
 
Co question 2009
Co question 2009Co question 2009
Co question 2009
 
Co question 2008
Co question 2008Co question 2008
Co question 2008
 
Co question 2006
Co question 2006Co question 2006
Co question 2006
 
Co question 2010
Co question 2010Co question 2010
Co question 2010
 
Ds lab manual by s.k.rath
Ds lab manual by s.k.rathDs lab manual by s.k.rath
Ds lab manual by s.k.rath
 

Último

cloud computing notes for anna university syllabus
cloud computing notes for anna university syllabuscloud computing notes for anna university syllabus
cloud computing notes for anna university syllabusViolet Violet
 
GENERAL CONDITIONS FOR CONTRACTS OF CIVIL ENGINEERING WORKS
GENERAL CONDITIONS  FOR  CONTRACTS OF CIVIL ENGINEERING WORKS GENERAL CONDITIONS  FOR  CONTRACTS OF CIVIL ENGINEERING WORKS
GENERAL CONDITIONS FOR CONTRACTS OF CIVIL ENGINEERING WORKS Bahzad5
 
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfRenewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfodunowoeminence2019
 
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...soginsider
 
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....santhyamuthu1
 
Summer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdf
Summer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdfSummer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdf
Summer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdfNaveenVerma126
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesDIPIKA83
 
Technical Management of cement industry.pdf
Technical Management of cement industry.pdfTechnical Management of cement industry.pdf
Technical Management of cement industry.pdfMadan Karki
 
Basic Principle of Electrochemical Sensor
Basic Principle of  Electrochemical SensorBasic Principle of  Electrochemical Sensor
Basic Principle of Electrochemical SensorTanvir Moin
 
Power System electrical and electronics .pptx
Power System electrical and electronics .pptxPower System electrical and electronics .pptx
Power System electrical and electronics .pptxMUKULKUMAR210
 
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxIT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxSAJITHABANUS
 
Oracle_PLSQL_basic_tutorial_with_workon_Exercises.ppt
Oracle_PLSQL_basic_tutorial_with_workon_Exercises.pptOracle_PLSQL_basic_tutorial_with_workon_Exercises.ppt
Oracle_PLSQL_basic_tutorial_with_workon_Exercises.pptDheerajKashnyal
 
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...amrabdallah9
 
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxVertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxLMW Machine Tool Division
 
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxUNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxrealme6igamerr
 
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxSUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxNaveenVerma126
 
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchrohitcse52
 

Último (20)

Lecture 4 .pdf
Lecture 4                              .pdfLecture 4                              .pdf
Lecture 4 .pdf
 
cloud computing notes for anna university syllabus
cloud computing notes for anna university syllabuscloud computing notes for anna university syllabus
cloud computing notes for anna university syllabus
 
GENERAL CONDITIONS FOR CONTRACTS OF CIVIL ENGINEERING WORKS
GENERAL CONDITIONS  FOR  CONTRACTS OF CIVIL ENGINEERING WORKS GENERAL CONDITIONS  FOR  CONTRACTS OF CIVIL ENGINEERING WORKS
GENERAL CONDITIONS FOR CONTRACTS OF CIVIL ENGINEERING WORKS
 
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdfRenewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
Renewable Energy & Entrepreneurship Workshop_21Feb2024.pdf
 
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...Transforming Process Safety Management: Challenges, Benefits, and Transition ...
Transforming Process Safety Management: Challenges, Benefits, and Transition ...
 
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
SATELITE COMMUNICATION UNIT 1 CEC352 REGULATION 2021 PPT BASICS OF SATELITE ....
 
Summer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdf
Summer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdfSummer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdf
Summer training report on BUILDING CONSTRUCTION for DIPLOMA Students.pdf
 
Présentation IIRB 2024 Chloe Dufrane.pdf
Présentation IIRB 2024 Chloe Dufrane.pdfPrésentation IIRB 2024 Chloe Dufrane.pdf
Présentation IIRB 2024 Chloe Dufrane.pdf
 
Graphics Primitives and CG Display Devices
Graphics Primitives and CG Display DevicesGraphics Primitives and CG Display Devices
Graphics Primitives and CG Display Devices
 
Technical Management of cement industry.pdf
Technical Management of cement industry.pdfTechnical Management of cement industry.pdf
Technical Management of cement industry.pdf
 
Basic Principle of Electrochemical Sensor
Basic Principle of  Electrochemical SensorBasic Principle of  Electrochemical Sensor
Basic Principle of Electrochemical Sensor
 
Power System electrical and electronics .pptx
Power System electrical and electronics .pptxPower System electrical and electronics .pptx
Power System electrical and electronics .pptx
 
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptxIT3401-WEB ESSENTIALS PRESENTATIONS.pptx
IT3401-WEB ESSENTIALS PRESENTATIONS.pptx
 
Lecture 2 .pdf
Lecture 2                           .pdfLecture 2                           .pdf
Lecture 2 .pdf
 
Oracle_PLSQL_basic_tutorial_with_workon_Exercises.ppt
Oracle_PLSQL_basic_tutorial_with_workon_Exercises.pptOracle_PLSQL_basic_tutorial_with_workon_Exercises.ppt
Oracle_PLSQL_basic_tutorial_with_workon_Exercises.ppt
 
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
Strategies of Urban Morphologyfor Improving Outdoor Thermal Comfort and Susta...
 
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptxVertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
Vertical- Machining - Center - VMC -LMW-Machine-Tool-Division.pptx
 
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptxUNIT4_ESD_wfffffggggggggggggith_ARM.pptx
UNIT4_ESD_wfffffggggggggggggith_ARM.pptx
 
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docxSUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
SUMMER TRAINING REPORT ON BUILDING CONSTRUCTION.docx
 
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai searchChatGPT-and-Generative-AI-Landscape Working of generative ai search
ChatGPT-and-Generative-AI-Landscape Working of generative ai search
 

Expected questions tc

  • 1. EXPECTED QUESTIONS BRANCH: CSE SEMESTER: 5TH SUB: THEORY OF COMPUTATION PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH Short questions: 1. What is the difference between DFA and NFA? 2. Design a NFA which accepts set of all binary strings 1100 or 1010 as substring. 3. Write the regular expression over alphabet Ʃ ={a,b,c}, containing atleast one a and atleast one b. 4. State the difference between Moore machine and Mealy machine? What is the length of the output string for Moore machine for input string of length k? 5. Design a DFA for the language containing all strings on which leftmost symbol differs from rightmost symbol over Ʃ ={a,b}? 6. Define the meaning of terminals and non-terminals. 7. What do you understand by decidable? 8. Design PDA for the grammar given below: S->aS|a|c 9. State Chomsky normal form with an example. 10. Describe Chomsky’s classification of language of automata theory. 11. What is the difference between language and grammar? 12. Write at least two difference between natural language and formal language. 13. Distinguish between context free context sensitive language. 14. State the difference between NP-complete and NP- hard problems. 15. Explain what it means for a language to be class P ? Give two examples of class P problem. 16. What do you mean by recursive and recursively enumerable language? 17. What is the difference between finite automata and turing machine. 18. What is theory of computation? 19. Define linear bounded automata with an example. 20. Explain decidability concept of CFG. 21. What do you understand by a language accepted by PDA by empty stack. 22. Design a DFA for even number of 1’s over Ʃ ={0,1}. 23. What is a useless symbol and how can they be removed from a grammar?
  • 2. EXPECTED QUESTIONS BRANCH: CSE SEMESTER: 5TH SUB: THEORY OF COMPUTATION PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH 24. What is maximum number of states in a DFA that is converted from an NFA of n number of states. 25. What is ambiguity in CFG? Explain with an example. 26. What is Church Turing hypothesis? 27. What Clique problem? Explain with an example. 28. Define PCP(post correspondence problem). 29. What is muti-tape and multi-head turing machine. 30. Define the ID(instantaneous description) of PDA. 31. Differentiate between positive closure and kleen closure . 32. What is transition system? Explain with example. 33. Design an NFA which accept set of all binary strings containing the 3rd symbol from the left end is 1 and 2nd symbol from left end is 0 . 34. What is –closure of a set? Explain with an example. 35. What is godel number? 36. Consider the following grammar S->a|abSb|aAb A->bS|aAAb| ϵ And derive the string abababb by using rm (rightmost) derivation. Long questions: 1. Construct a DFA equivalent to M=({q0,q1}, {0,1}, δ, q0, { q0 }) Where δ is defined by its state table as follows. __________________________________________________ State/Alphabet 0 1 __________________________________________________  q0 q0 q1 q1 q1 q0, q1 ___________________________________________________ 2. Define pumping lemma. Show that L={an | n is prime } is not regular. 3. State and prove Arden’s theorem ?
  • 3. EXPECTED QUESTIONS BRANCH: CSE SEMESTER: 5TH SUB: THEORY OF COMPUTATION PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH Find out the regular expression for the following transition diagram. 0 1 1 0,1 1 1 0 4. Define Griebach normal form. Convert the following grammar to Griebach normal form S ->AA|a, A->SS|b 5. Let P be the set of all palindromes over {a,b}. Construct the grammar that generates P. 6. Design a turing machine to find 1’s complement of a binary number. 7. Costruct NFA for the following regular expression i) a(ab)*aa ii) (ab+bb)* 8. Show that P is closed under a) union, b) concatenation and c)complementation 9. What is the difference between moore machine and mealy machine ? 10. Design a DFA for the language which will accept all binary strings divisible by 3 . 11. Show that the language L={an cbn |n≥ 1} is accepted by a PDA. 12. Prove that for every NFA ,if L is the step accepted by NFA, then there exists a DFA which also accepts L. 13. State and prove undecidability of post correspondence problem. 14. State and prove Arden’s theorem. 15. Write short notes on: a) Universal turing machine b) Church turing hypothesis c) Normal form d) Counter machine 16. Prove or disprove the following regular expression r,s a) (R+S)*=R*+S* b) (rs+r)*=r*+(sr+r)* 17. Give a context free grammar that generates the language L={w|{a,b}*:w contains atleast three a’s} 18. Find the language generated by the following q3 q2q1
  • 4. EXPECTED QUESTIONS BRANCH: CSE SEMESTER: 5TH SUB: THEORY OF COMPUTATION PREPARED BY:ASST.PROF.SANTOSH KUMAR RATH a) S->0S1|0A, A->1A|1 b) S->0S1|0A|0|1B|1A 19. What is Ackermann’s function. Compute the value of A(1,1), A(2,1) using Ackermann’s function.