Exam Details
| Subject | Theory Of Computation | |
| Paper | ||
| Exam / Course | B.Tech In Computer Science And Engineering (BTCSVI) | |
| Department | School of Engineering & Technology (SOET) | |
| Organization | indira gandhi national open university | |
| Position | ||
| Exam Date | June, 2016 | |
| City, State | new delhi, |
Question Paper
No. of Printed Pages: 3 IBICS-OlSI
B.Tech. -VIEP -COMPUTER SCIENCE AND ENGINEERING (BTCSVI) Term-End Examination June, •...J-...J
BICS-018 THEORY OF COMPUTATION
Time: 3 hours Maximum Marks: 70
Note: Attempt any seven questions. All questions carry equal marks.
1. Enumerate the difference between DFA and NFA with the help of an example. 5
Construct a Mealy machine which can output EVEN, ODD according to the total number of even and odd encountered. The input symbols are 0 and 1. 5
2. Design a DFA for all the strings over where number of are 3k 1 and 0,1,2,.... 5
Discuss the closure properties of regular languages. 5
3. Construct a finite automaton equivalent to the regular expression (10 11) 0). 5
Find the regular expression corresponding to the automaton given below: 5 <img src='./qimages/10924-3b.jpg'>
4. Define Deterministic Push Down Automata (DPDA). Design a DPDA for the language 1}. 10
5. Define Turing Machine. Design a Turing Machine that concatenates two strings of separated by a blank. 10
6. Explain the following: 5 5=10 Two-way Infinite Tape Turing Machine Multiple Tracks Turing Machine
7. Prove that the universal language is recursively enumerable. 10
8. Prove that the halting problem is undecidable. 10
9. How is a Turing Machine different from RAM Explain and discuss NP-complete and NP-hard problems.
10. Write short notes on any two of the following: 2x5=10 Myhill-Nerode Theorem Church's Hypothesis Travelling Salesman Problem
B.Tech. -VIEP -COMPUTER SCIENCE AND ENGINEERING (BTCSVI) Term-End Examination June, •...J-...J
BICS-018 THEORY OF COMPUTATION
Time: 3 hours Maximum Marks: 70
Note: Attempt any seven questions. All questions carry equal marks.
1. Enumerate the difference between DFA and NFA with the help of an example. 5
Construct a Mealy machine which can output EVEN, ODD according to the total number of even and odd encountered. The input symbols are 0 and 1. 5
2. Design a DFA for all the strings over where number of are 3k 1 and 0,1,2,.... 5
Discuss the closure properties of regular languages. 5
3. Construct a finite automaton equivalent to the regular expression (10 11) 0). 5
Find the regular expression corresponding to the automaton given below: 5 <img src='./qimages/10924-3b.jpg'>
4. Define Deterministic Push Down Automata (DPDA). Design a DPDA for the language 1}. 10
5. Define Turing Machine. Design a Turing Machine that concatenates two strings of separated by a blank. 10
6. Explain the following: 5 5=10 Two-way Infinite Tape Turing Machine Multiple Tracks Turing Machine
7. Prove that the universal language is recursively enumerable. 10
8. Prove that the halting problem is undecidable. 10
9. How is a Turing Machine different from RAM Explain and discuss NP-complete and NP-hard problems.
10. Write short notes on any two of the following: 2x5=10 Myhill-Nerode Theorem Church's Hypothesis Travelling Salesman Problem
Other Question Papers
Departments
- Centre for Corporate Education, Training & Consultancy (CCETC)
- Centre for Corporate Education, Training & Consultancy (CCETC)
- National Centre for Disability Studies (NCDS)
- School of Agriculture (SOA)
- School of Computer and Information Sciences (SOCIS)
- School of Continuing Education (SOCE)
- School of Education (SOE)
- School of Engineering & Technology (SOET)
- School of Extension and Development Studies (SOEDS)
- School of Foreign Languages (SOFL)
- School of Gender Development Studies(SOGDS)
- School of Health Science (SOHS)
- School of Humanities (SOH)
- School of Interdisciplinary and Trans-Disciplinary Studies (SOITDS)
- School of Journalism and New Media Studies (SOJNMS)
- School of Law (SOL)
- School of Management Studies (SOMS)
- School of Performing Arts and Visual Arts (SOPVA)
- School of Performing Arts and Visual Arts(SOPVA)
- School of Sciences (SOS)
- School of Social Sciences (SOSS)
- School of Social Work (SOSW)
- School of Tourism & Hospitality Service Sectoral SOMS (SOTHSM)
- School of Tourism &Hospitality Service Sectoral SOMS (SOTHSSM)
- School of Translation Studies and Training (SOTST)
- School of Vocational Education and Training (SOVET)
- Staff Training & Research in Distance Education (STRIDE)
Subjects
- Advanced Computer Architecture
- Artificial Intelligence
- Computer Architecture
- Computer Networks
- Computer Organisations
- Cryptography And Network Security
- Data Structure
- Data Warehousing And Mining
- Database Management System
- Design and Analysis of Algorithm
- Digital Image Processing
- Discrete Maths Structure
- E-Business
- Formal Language And Automata
- Logic Design
- Microprocessor
- Mobile Computing
- Object Oriented Programming
- Operating Systems
- Parallel Algorithms
- Pattern Recognition
- Principles of Programming Lang.
- Real Time Systems
- Software Engineering
- Software Quality Engineering
- Software Reusability
- System Programming And Compiler Design
- Theory Of Computation
- Unix Internals And Shell Programming
- Web Technology