(A) (a+b)+
(B) a-b
(C) (a-b)+
(D) None of them
In CFG, the symbols that cannot be replaced by anything are called __.
(A) None terminals
(B) Infinite
(C) Finite
(D) Terminals
The language generated by the CFG is called the language __ by the CFG.
(A) Produced
(B) Null string
(C) Pumping lemma
(D) Non of then
L is a regular language so by kleene,s theorem ,there exists an __.
(A) FA
(B) GTG
(C) TG
(D) CNF
This approach of solving geometric problems by sweeping a line across the plane is called __.
(A) plane sweep
(B) brute force
(C) NA
(D) NA
This follows from the fact that dominance relation is __.
(A) symmetric
(B) transitive
(C) non-transitive
(D) none
If you find yourself in maze the better traversal approach will be?
(A) BFS
(B) DFS
(C) Level order
(D) BFS and DFS both are valid
You have an adjacency list for G, what is the time complexity to compute Graph transpose G^T.?
(A) (V+E)
(B) ? (V E)
(C) ? (V)
(D) ? (V^2)