Register
Filter

Recent activity by aayushranjan01

14 answers
3
GATE CSE 2012 | Question: 39
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is $O (n \log n) $ $ O(n^{2} \log n) $ $ O(n^{2} + \log n) $ $ O(n^{2}) $
A list of $n$ strings, each of length $n$, is sorted into lexicographic order using the merge-sort algorithm. The worst case running time of this computation is$O (n \log...
4 answers
4
GATE CSE 2008 | Question: 49
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ ...
Given below are two finite state automata ( $\rightarrow$ indicates the start state and $F$ indicates a final state)$$\overset{Y}{\begin{array}{|l|l|l|}\hline \text{} & ...
2 answers
5
How to find Transitive Closure of any Relation ?
I want to know the best way through which we can find transitive closures of any relation ? Please let me know.
I want to know the best way through which we can find transitive closures of any relation ? Please let me know.
1 answer
6
DFA for 00+11+(01+10)(00+11)*(01+10)
Below DFA is accepting above regular language but it is accepting null also....can anyone please give correct DFA
Below DFA is accepting above regular language but it is accepting null also....can anyone please give correct DFA
2 answers
7
What is the time complexity ?
time complexity question Sum=0 for(i=1; i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=1;k<=n;k++) { sum=sum+k; } } } }
time complexity questionSum=0 for(i=1; i<=n;i++) { for(j=1;j<=i;j++) { if(j%i==0) { for(k=1;k<=n;k++) { sum=sum+k; } } } }
2 answers
9
c programming
What will be output of following program? #include<stdio.h> int main(){ int a = 320; char *ptr; ptr =( char *)&a; printf("%d ",*ptr); return 0; } (A) 2 (B) 320 (C) 64 (D) Compilation error (E) None of above
What will be output of following program?#include<stdio.h>int main(){ int a = 320; char *ptr; ptr =( char *)&a; printf("%d ",*ptr); return 0;}(A) 2(B) 320(C) 64...
4 answers
11
Minimum No of states in Finite Automata
Minimum state Finite Automata recognizing the language corresponding to following Regular Expression (0*10+1*0)(01)* a)3 b)4 c)2 d)5 Also please show Finite Automata for it.
Minimum state Finite Automata recognizing the language corresponding to following Regular Expression(0*10+1*0)(01)* a)3 b)4 c)2 d)5Also please show Finite Automata for it...