Gblog Master the Coding Interview – Contest Series Based On Real Interviews
“If you want to clear your next Coding Interview, practice as many programming questions as you can!” – An obvious advice that a guy who’s… Read More
Consider the grammar E → E + n | E × n | n For a sentence n + n × n, the handles in… Read More
Consider the following two problems on undirected graphs α : Given G(V, E), does G have an independent set of size | V | -… Read More
Consider the languages: L1 = {wwR |w ∈ {0, 1}*} L2 = {w#wR | w ∈ {0, 1}*}, where # is a special symbol L3… Read More
Let L1 be a recursive language, and let L2 be a recursively enumerable but not a recursive language. Which one of the following is TRUE?… Read More
Consider the languages: L1 = {anbncm | n, m > 0} L2 = {anbmcm | n, m > 0} Which one of the following statements… Read More
Let Nf and Np denote the classes of languages accepted by non-deterministic finite automata and non-deterministic push-down automata, respectively. Let Df and Dp denote the… Read More
Consider the machine M: The language recognized by M is : (A) {w ∈ {a, b}* / every a in w is followed by ex­actly… Read More