1. 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? A. Both FHAM ...
Home/Unit
Quearn Latest Articles
Unit 2 Solved MCQs
Quearn1. Type-1 Grammar is known as_____________ A. CFG B. CSG C. REGULAR D. All Answer» B. CSG 2. If G is “S → a S/a”, then L(G) = ? A. a* B. ^ C. {a}+ D. Both (a) & (c) ...
Unit 1 Solved MCQs
Quearn1. = ∈{ } w has at least as many occurrences of (110)’s as (011)’s}. Let L {w 0,1 * 2 = ∈{ } w has at least as many occurrence of (000)’s as (111)’s}. Which one of the following ...