Register
Filter

Questions by suneetha

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...
1 votes
1 answer
41
linear algebra
the product of the non-zero eigen values of the matrax 1 0 0 0 1 0 1 1 1 0 0 1 1 1 0 0 1 1 1 0 1 0 0 0 1 how can we solve this question?
the product of the non-zero eigen values of the matrax1 0 0 0 10 1 1 1 00 1 1 1 00 1 1 1 01 0 0 0 1how can we solve this question?
0 votes
3 answers
42
linear algebra
Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of the matrix A19 are (a) 1024 and−1024 (b) 1024√2 and −1024√2 (c) 4√2 and−4√2 (d) 512√2 and−512√2
Let A be the 2 × 2 matrix with elements a11 = a12 = a21 = +1 and a22 = −1. Then the eigenvalues of the matrix A19 are(a) 1024 and−1024 (b) 1024√2 and −1024√2(c...
0 votes
1 answer
43
time complexity
int Dosomething(int n) { if(n>=2) return 1; else return (floor(sqrt(n)))+n; } time complexity of the program?
int Dosomething(int n){if(n>=2)return 1;elsereturn (floor(sqrt(n)))+n;}time complexity of the program?
0 votes
1 answer
44
time complexity
let n>=m int gcd(n,m) { if(n%m==0) return ml; n=n%m; return gcd(m,n); } how many recursive calls are made by this function?
let n>=mint gcd(n,m){if(n%m==0)return ml;n=n%m;return gcd(m,n);}how many recursive calls are made by this function?
2 votes
3 answers
45
minimization
Let $‘1’$ and $‘0’$ denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$: $F(P, Q) = ( ( 1 \oplus P) \oplus (P \oplus Q) ) \oplus ( (P \oplus Q) \oplus (Q \oplus 0) ) $ The equivalent expression for $F$ is
Let $‘1’$ and $‘0’$ denote the binary constants. Consider the following Boolean expression for $F$ over two variables $P$ and $Q$:$F(P, Q) = ( ( 1 \oplus P) \oplu...
2 votes
1 answer
46
functions in c
#include <stdio.h> #include <stdarg.h> int fun(int n, ...) { int i, j = 1, val = 0; va_list p; va_start(p, n); for (; j < n; ++j) { i = va_arg(p, int); val += i; } va_end(p); return val; } int main() { printf("%d\n", fun(4, 1, 2, 3)); return 0; } will you explain the output for the program?
#include <stdio.h #include <stdarg.h int fun(int n, ...) { int i, j = 1, val = 0; va_list p; va_start(p, n); for (; j < n; ++j) { i = va_arg(p, int); val += i; } va_end(p...
1 votes
3 answers
47
increment and decrement operators
#include <stdio.h> void main() { int a = 3; int b = ++a + a++ + --a; printf("Value of b is %d", b); } after compiling on gcc compiler it gives 11.will you explain how is it possible?
#include <stdio.h void main() { int a = 3; int b = ++a + a++ + a; printf("Value of b is %d", b); }after compiling o...
0 votes
1 answer
48
GeeksforGeeks
#include <stdio.h> #define PRINT(i, limit) do \ { \ if (i++ < limit) \ { \ printf("GeeksQuiz\n"); \ continue; \ } \ }while(0) int main() { int i = 0; PRINT(i, 3); return 0; } How many times GeeksQuiz is printed in the above program ?
#include <stdio.h #define PRINT(i, limit) do \ { \ if (i++ < limit) \ { \ printf("GeeksQuiz\n"); \ continue; \ } \ }while(0) int main() { int i = 0; PRINT(i, 3); return 0...
Page: