0 votes
2 answers
81
Can somebody write the code or algorithm, how merge sort works efficiently in linked list? Is Heap sort most inefficient in Linked List Sorting? Elaborate plz
0 votes
2 answers
84
“Every asymmetric relation is antisymmetric”Is this statement is True or False?I think it is false, because asymmetric relation never allows loops and antisymmetric r...
0 votes
0 answers
86
How bottom-up parser like Operator-Precedence parser parse some ambiguous grammar?According to stanford diagram , ambiguous grammar cannot be parsed and it is separate fo...
2 votes
4 answers
93
1 votes
1 answer
95
How many number of $DFA$ states(minimal DFA) required which accepts the language $L=\left \{ a^{n}:n=\text{3 or n>= 2m for all m>= 1} \right \}$ ___________Answer will be...
0 votes
1 answer
99
for(k=1;k<(n+1);k++) { for(m=1;m<(n+1);m+=k){ x=x+1; } }What is the T.C. of the following code?Is it $n^{2}$ or $n\log n$??
0 votes
1 answer
100
How by Pumping Lemma we can prove that“context free grammar generate an infinite number of strings”and here what could be pumping length ?