Register
Filter

Answers by suman08513

10 votes
1
GATE CSE 2007 | Question: 74
Consider the following Finite State Automaton: The language accepted by this automaton is given by the regular expression $b^*ab^*ab^*ab^*$ $(a + b)^*$ $b^*a(a+b)^*$ $b^*ab^*ab^*$
Consider the following Finite State Automaton:The language accepted by this automaton is given by the regular expression$b^*ab^*ab^*ab^*$$(a + b)^*$$b^*a(a+b)^*$$b^*ab^*a...
0 votes
2
Complexity
int loop(int n) { for(int i=1;i<=n;i++) { for(int j=1;j<n;j+=i) { -------------O(1)------------- } } } What is the time complexity of above code segment?
int loop(int n) { for(int i=1;i<=n;i++) { for(int j=1;j<n;j+=i) { -O(1) - } } }What is the time complexity of above code segment?