Home / Engineering / Theory of Computation MCQs / Page 1

# Theory of Computation MCQs | Page - 1

Dear candidates you will find MCQ questions of Theory of Computation here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.

##
Q. 2) A spanning tree for a simple graph of order 24 has

##
Q. 3) If G is a simple connected 3-regular planar graph where every region is bounded by exactly 3 edges, then the edges of G is

##
Q. 4) If G is a connected planar graph of v vertices e edges and r regions then

##
Q. 5) A Hamiltonian cycle in a Hamiltonian graph of order 24 has

##
Q. 6) The following grammar
G = (N, T, P, S)
N = {S, A, B}
T = {a, b, c}
P : S → aSa
S → aAa
A → bB
B → bB
B → c is

##
Q. 7) The following grammar
G = (N, T, P, S)
N = {S, A, B, C, D, E}
T = {a, b, c}
P : S → aAB
AB → CD
CD → CE
C → aC
C → b
bE → bc is

##
Q. 8) The following grammar
G = (N, T, P, S)
N = {S, A, B, C}
T = {a, b, c}
P : S → aS
A → bB
B → cC
C → a is

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

##
Q. 10) Which of the following is true with respect to Kleene’s theorem?
1 A regular language is accepted by a finite automaton.
2 Every language is accepted by a finite automaton or a turingmachine.

### Explore Sets

Theory of Computation MCQs Set 1

Theory of Computation MCQs Set 2

Theory of Computation MCQs Set 3

Theory of Computation MCQs Set 4

Theory of Computation MCQs Set 5

Theory of Computation MCQs Set 6

Theory of Computation MCQs Set 7

Theory of Computation MCQs Set 8

Theory of Computation MCQs Set 9

Theory of Computation MCQs Set 10

Theory of Computation MCQs Set 11

Theory of Computation MCQs Set 12

Theory of Computation MCQs Set 13

### Explore More Categories

Click on category to learn MCQs of that category.Electronics and Communication Engineering