Theory of Computation Mock Test

1. A spanning tree for a simple graph of order 24 has

2. Type-1 Grammar is known as_____________

3. A Hamiltonian cycle in a Hamiltonian graph of order 24 has

4. Which of the following is TRUE?

5. Any given transition graph has an equivalent:

6. A language L is accepted by a FSA iff it is

7. The minimum state automaton equivalent to the above FSA has the following number of states

8. The regular sets are closed under:

9. Which of the following statement is wrong

10. Which of the following are regular sets?

11. A language is regular if and only if

12. P, Q, R are three languages. If P & R are regular and if PQ=R, then

13. Which one of the following statement is FALSE?

14. Grammars that can be translated to DFAs:

15. Regular expressions are

16. Which of the following problems is undecidable

17. Recursively enumerable languages are not closed under.

18. The concept of FSA is much used in this part of the compiler

19. PCP is:

20. Which of the following statement is wrong?

21. Recursive languages are

22. The Family of recursive language is not closed under which of the following operations:

23. Grammar that produce more than one Parse tree for same sentence is:

24. Any Language generated by an unrestricted grammar is:

25. Which of the following statements is wrong?

26. If PCP is decidable then MPCP is

27. The language accepted by a Push down Automata:

28. Which of the following problem is undecidable?

29. Which of the following pairs have DIFFERENT expressive power?

30. Context free grammar is not closed under

31. Recursively enumerable languages are not closed under

32. Which statement is true

33. The logic of pumping lemma is a good example of

34. If L and L- are recursively enumerable, then L is

35. Recursively enumerable languages are not closed under:

36. Basic limitation of FSM is that it

37. Pumping lemma is generally used for proving that

38. A PC not connected to a network is equivalent to

39. Which of the following problems is undecidable?

40. The production Grammar is {S->aSbb,S->abb} is

41. TM is more powerful than FSM because

42. ___________ states are called the halt states.

43. Left hand side of a production in CFG consists of:

44. Which statement is true?

45. The part of an FA, where the input string is placed before it is run, is called _______

46. Universal Turing machine (UTM) influenced the concepts of

47. We think of a Turing machines transition function as a

48. Which is correct regard an off-line Truing machine?

49. Which of the following conversion is not possible (algorithmically)?

Computer Science Engineering Mock Tests with Answers
Distributed Computing System Mock Test
Software Project Management Mock Test
Artificial Intelligence and Robotics Mock Test
Basics of Database Management Mock Test
C# Programming Mock Test
C#.NET Programming Mock Test
Cloud Computing Mock Test
Communication Network Mock Test
Computer Architecture Mock Test
Computer Architecture and Organization Mock Test
Computer Fundamentals Mock Test
Computer Networking Mock Test
Computer Networks Mock Test
CPP Programming Mock Test
Data Analysis Mock Test
Data Communication and Computer Network Mock Test
Data Compression and Data Retrieval Mock Test
Data Mining and Business Intelligence Mock Test
Data Mining and Data Warehouse Mock Test
Data Structure and Algorithms Mock Test
Data Structures Mock Test
DataBase Management System Mock Test
Design and Analysis of Algorithms Mock Test
Digital Electronics and Logic Design Mock Test
Digital Logic Circuits Mock Test
Digital Principles and System Design Mock Test
Discrete Mathematics Mock Test
Discrete Structure Mock Test
DotNet Technology Mock Test
Embedded Real Time Operating System Mock Test
Green Computing Mock Test
High Performance Computing Mock Test
Information Cyber Security Mock Test
Information and Network Security Mock Test
Information Retrival Techniques Mock Test
Information Systems and Engineering Economics Mock Test
Machine Learning Mock Test
Microprocessor and Interfacing Technique Mock Test
Microprocessors Mock Test
Muli core Architectures and Pro Mock Test
Multi core processors Mock Test
Network Security Mock Test
Neural Networks and Fuzzy Control
Object Oriented Programming Mock Test
Operating System Architecture Mock Test
Operating System Mock Test
Problem Solving and Python Programming Mock Test
Programming for Problem Solving Mock Test
Python Programming Mock Test
Soft Computing Mock Test
Software Design Modeling Mock Test
Software Engineering Mock Test
Software Testing Mock Test
Software Testing and Quality Assurance Mock Test
Theory of Computation and Compiler Design Mock Test
Theory of Computation Mock Test
Ubiquitous Computing System Mock Test