Register
Filter

Questions by suneetha

0 votes
0 answers
23
functions
f(x)=ln x +x g(x)=x^2 sin(x) h(x)=x^3-x which of them are represents the many-to-one function?
f(x)=ln x +xg(x)=x^2 sin(x)h(x)=x^3-xwhich of them are represents the many-to-one function?
0 votes
0 answers
24
graphs
consider a complete garph on 2^(log(2^10)) vertices then the minimum number of edge removal operations needed to make graph disconnected
consider a complete garph on 2^(log(2^10)) vertices then the minimum number of edge removal operations needed to make graph disconnected
0 votes
0 answers
25
prev year question
the eigen values of the following matrix -1 3 5 -3 -1 6 0 0 3
the eigen values of the following matrix -135-3-16003
0 votes
1 answer
26
merge sort
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ? explain with example
given n elements merge them into one sorted list using merge procedure then what is the time complexity for this ?explain with example
0 votes
0 answers
27
merge sort
what is the time complexity of merge sort for already sorted array explain with example?
what is the time complexity of merge sort for already sorted array explain with example?
0 votes
1 answer
28
trees
formula for which maximum number of nodes will be present in complete n-array tree?
formula for which maximum number of nodes will be present in complete n-array tree?
0 votes
2 answers
29
time complexity
What is the time complexity of fun()? int fun(int n) { int count = 0; for (int i = 0; i < n; i++) for (int j = i; j > 0; j--) count = count + 1; return count; }
What is the time complexity of fun()?int fun(int n) { int count = 0; for (int i = 0; i < n; i++) for (int j = i; j 0; j ) count = count + 1; return count; }
0 votes
1 answer
30
time complexity
for(i=1;i<=n;++i) { j=1; while(j<=n) j=2*j; for(k=1;k<=n;++k) c=c+1; } then what is the time complexity will be?
for(i=1;i<=n;++i){j=1;while(j<=n)j=2*j;for(k=1;k<=n;++k)c=c+1;}then what is the time complexity will be?
0 votes
0 answers
31
time complexity
i=n; while(i>0) { j=1; while(j<=n) { j=2*j; } i=i/2; } then what is the time complexity?
i=n;while(i>0){j=1;while(j<=n){j=2*j;}i=i/2;}then what is the time complexity?
0 votes
1 answer
32
asymptotic notations
√logx = O(loglogx) is it true or false? and explain why?
√logx = O(loglogx) is it true or false?and explain why?
1 votes
1 answer
33
regular exprression
what is the equivalent nfa for the given regular expression? a*b*(ba)*a*
what is the equivalent nfa for the given regular expression?a*b*(ba)*a*
0 votes
2 answers
34
regular ex
difference between a*(ba)* and (a+ba)* and how to represent both in finite automata?
difference between a*(ba)* and (a+ba)* and how to represent both in finite automata?
0 votes
2 answers
35
regular expressions
how can we represent (ab)*ba*(b+a)*aab* in finite automata?
how can we represent (ab)*ba*(b+a)*aab* in finite automata?
0 votes
0 answers
36
regular expression
((a*b)*b+ab*)*((ba)*+a*ba)* represent a finite automata for the given regular expression?
((a*b)*b+ab*)*((ba)*+a*ba)* represent a finite automata for the given regular expression?
0 votes
0 answers
37
self question
what are the books which are useful for learning regular expressions ?
what are the books which are useful for learning regular expressions ?
0 votes
0 answers
38
self doubt
Plz explain how can we represent or function in dfa Ex if the input alphabet is{a,b} thhen represent a dfa which is containing no of a's are 0 mod2 or no of b's are 0 mod3?
Plz explain how can we represent or function in dfaEx if the input alphabet is{a,b} thhen represent a dfa which is containing no of a's are 0 mod2 or no of b's are 0 ...
0 votes
1 answer
39
gate 2018
https://gateoverflow.in/?qa=blob&qa_blobid=3125601105330416900
https://gateoverflow.in/?qa=blob&qa_blobid=3125601105330416900
1 votes
1 answer
40
indexing
Block size 1000B records are of size 100B of which 12B are the key field and pointer of size 8B. a file consist of 10000 records 1.the number of blocks required for a sparse index on this file? 2.the number of blocks required for for a dense index on this file
Block size 1000B records are of size 100B of which 12B are the key field and pointer of size 8B. a file consist of 10000 records1.the number of blocks required for a spar...
Page: