- Computer Science Engineering (CSE)
- Theory of Computation
- Unit 1
- If G is a simple connected 3-regular pla...

Q. |
## 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 |

A. | 3 |

B. | 4 |

C. | 6 |

D. | 5 |

Answer» C. 6 |

View all MCQs in:
Theory of Computation

- 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
- If G is a connected planar graph of v vertices e edges and r regions then
- Consider a graph G = (V, E) where I V I is divisible by 3. The problem of finding a Hamiltonian cycle in a graph is denoted by SHAM3 and the problem of determining if a Hamiltonian cycle exits in such graph is denoted by DHAM3. The option, which holds true, is
- Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. Which one of the following is TRUE?
- Which of the following statements are TRUE? (1) The problem of determining whether there exists a cycle in an undirected graph is in P. (2) The problem of determining whether there exists a cycle in an undirected graph is in NP. (3) If a problem A is NP-Complete, there exists a non-deterministic polynomial time algorithm to solve A.
- A spanning tree for a simple graph of order 24 has
- Consider a language L for which there exists a Turing machine ™, T, that accepts every word in L and either rejects or loops for every word that is not in L. The language L is
- If a Turing machine halts for each and every world of a language L and rejects other, then L is said to be
- The PDA is called non-deterministic PDA when there are more than one out going edges from……… state:
- The PDA is called non-deterministic PDA when there are more than one out going edges from……… state

Login to Continue

It will take less than 2 minutes

Report MCQ