UGC NET CS Paper 2 June 2012
1. The postfix expression AB + CD – * can be evaluated using a
(A) Stack
(B) Tree
(C) Queue
(D) Linked list
Answer: (A)
RGPV 2020Construct a NDFA accepting all string in {a,b} with either two consecutive a’s or two consecutive b’s. Ans.
To convert a regular expression to a context-free grammar (CFG), you can follow a set of standard conversion rules. Here are the rules for converting … Read more
RGPV 2020 How can we construct regular grammar from regular expression? Ans. Lets take an regular expresion example: 0*(1(0+1))* Now convert above example in to … Read more
RGPV 2020 Show that the following grammar is ambiguous. S → aSbS|bSaS|∈ Ans. For grammar to be ambiguous, there should be more than one parse … Read more
RGPV 2020 What are leftmost and rightmost derivations? Explain with suitable example ? Grammar: S → aS / ∈ For generating strings ‘aaa’. Left … Read more
RGPV 2020Construct Moore machine for the following Mealy machine. Sol. Transition table for above Mealy machine. Present State Next State Input = 0 Input = … Read more
RGPV 2020 Preve that CFL are not closed under intersection ? If L1 and If L2 are two context free languages, their intersection L1 … Read more
1. The postfix expression AB + CD – * can be evaluated using a
(A) Stack
(B) Tree
(C) Queue
(D) Linked list
Answer: (A)
RGPV 2007 Q. Define deterministic finite automta. Draw DFA that accepts any string which ends with 1 or it ends with an even number of … Read more
RGPV 2009 Q. Construct minimized DFA for the given NFA. Or Convert the following NFA into DFA. Ans. Transition table for given NFA State Input … Read more