March 15, 2025
Question 12 A is recursive if both A and its complement are accepted by Turing machines. A True B False Theory-of-ComputationTuring-machinesVideo-Explanation Question 12 Explanation: If A […]
March 17, 2025
Question 16 Which of the following problems is not NP-hard? A Hamiltonian circuit problem B The 0/1 Knapsack problem C Finding bi-connected components of a graph […]
March 17, 2025
Question 28 If G is a context-free grammar and w is a string of length l in L(G), how long is a derivation of w in G, […]
March 18, 2025
Question 4 Let S and T be language over Σ = {a,b} represented by the regular expressions (a+b*)* and (a+b)*, respectively. Which of the following is […]