Related InterviewSolutions

• In a binary tree, the number of internal nodes of degree 1 is 5, and the number of internal nodes of degree 2 is 10. The number of leaf nodes in the binary tree is(A) 10(B) 11(C) 12(D) 15
• Which regular expression best describes the language accepted by the non-deterministic automaton below?(A) (a + b)* a(a + b)b(B) (abb)*(C) (a + b)* a(a + b)* b(a + b)*(D) (a + b)*
• In the context-free grammar below, S is the start symbol, a and b are terminals, and ϵ denotes the empty stringS → aSa | bSb | a | b | ϵWhich of the following strings is NOT generated by the grammar?(A) aaaa(B) baba(C) abba(D) babaaabab
• In the automaton below, s is the start state and t is the only final state.Consider the strings u = abbaba, v = bab, and w = aabb. Which of the following statements is true?(A) The automaton accepts u and v but not w(B) The automaton accepts each of u, v, and w(C) The automaton rejects each of u, v, and w(D) The automaton accepts u but rejects v and w
• Given a boolean function f (x1, x2, …, xn), which of the following equations is NOT true(A) f (x1, x2, …, xn) = x1’f(x1, x2, …, xn) + x1f(x1, x2, …, xn)(B) f (x1, x2, …, xn) = x2f(x1, x2, …, xn) + x2’f(x1, x2, …,xn)(C) f (x1, x2, …, xn) = xn’f(x1, x2, …, 0) + xnf(x1, x2, …,1)(D) f (x1, x2, …, xn) = f(0, x2, …, xn) + f(1, x2, .., xn)
• (A) I and II only(B) II and III only(C) I and III only(D) None of these