Register

Recent questions tagged test-series

1 votes
1 answer
301
zeal test digital logic
i marked the option b) but i didn't understand the solution
i marked the option b) but i didn't understand the solution
User Avatar
2 votes
0 answers
302
zeal test digital logic
what is difference between synchronous counter and ripple counter ?
what is difference between synchronous counter and ripple counter ?
User Avatar
1 votes
0 answers
303
zeal test digital logic
User Avatar
0 votes
1 answer
304
zeal test digital logic
how to approach this question? i didn't understand the question
how to approach this question? i didn't understand the question
User Avatar
0 votes
2 answers
307
time complexity
User Avatar
0 votes
0 answers
308
TEST SERIES
User Avatar
1 votes
1 answer
309
Test algo
User Avatar
0 votes
1 answer
310
Wooe Test Series
Is wooe online test series good for Gate ?
Is wooe online test series good for Gate ?
User Avatar
0 votes
0 answers
313
Test series
is This correct answer given ?? How option 3 can be correct ??
is This correct answer given ?? How option 3 can be correct ??
User Avatar
5 votes
1 answer
314
Graph
Also let me know the approach to find back edges, cross edges, forward edges, How to solve these questions
Also let me know the approach to find back edges, cross edges, forward edges,How to solve these questions
User Avatar
0 votes
0 answers
315
test-series
#include<stdio.h> int main() { char A[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(A+1)-(unsigned)A); printf("%d", (unsigned)(p+1)-(unsigned)p); } 42 42 1 1 42 336 336 42
#include<stdio.h>int main(){char A[5][7][6];char *p[5][7][6];printf("%d\t", (unsigned)(A+1)-(unsigned)A);printf("%d", (unsigned)(p+1)-(unsigned)p);}42 421 142 336336 ...
User Avatar
0 votes
2 answers
317
Algorithm 19
Why 2nd statement false
Why 2nd statement false
User Avatar
0 votes
0 answers
320
Test Series
User Avatar
0 votes
1 answer
321
Test series
T(n) = T(root(n)) + n where n>=2 Time complexity ?
T(n) = T(root(n)) + n where n>=2Time complexity ?
User Avatar
0 votes
1 answer
322
Algorithms Questions
f(n)>=c1.n h(n)=c2.n then why answer cant be O(n),It is given as C
f(n)>=c1.nh(n)=c2.nthen why answer cant be O(n),It is given as C
User Avatar
0 votes
1 answer
323
algorithms
User Avatar
4 votes
1 answer
324
RBRTestSeries
The value of z after the execution of the following program is void f(int x) { static int z; z=z+x; } int main() { int y=10; fork(); fork(); f(y); return 0; } Options are: a. 40 b. 30 c. 20 d. 10
The value of z after the execution of the following program isvoid f(int x){ static int z; z=z+x;}int main(){ int y=10; fork(); fork(); f(y); ...
User Avatar
1 votes
1 answer
325
test series
If L1 and L2 are non-regular, then L1 ⋃ L2 is also non-regular. state the above statement is true or false?
If L1 and L2 are non-regular, then L1 ⋃ L2 is also non-regular.state the above statement is true or false?
User Avatar
1 votes
1 answer
326
test series
If L1 and L2 are non-regular, then L1⋃ L2 is also not-regular. true or false?
If L1 and L2 are non-regular, then L1⋃ L2 is also not-regular.true or false?
User Avatar
0 votes
1 answer
327
test series
Let A and B be disjoint, R.E. languages. Let (A∪B)' also be recursive enumerable. What can you say about A and B? (a) Neither A nor B is decidable is possible (b) At least one among A and B is decidable (c) Both A and B are decidable (d) None of above Solution: Option (c) how?
Let A and B be disjoint, R.E. languages. Let (A∪B)' also be recursive enumerable. What can you say about A and B?(a) Neither A nor B is decidable is possible(b) At le...
User Avatar
0 votes
0 answers
328
test series
Consider this regular expression: r = (a*b)* + (b*a)* This is equivalent to (a) (a + b)* (b) (a + b)* · (ab)+ + (a + b)* (ba)+ (c) (a + b)*a + (a + b)* b (d) None of above
Consider this regular expression: r = (a*b)* + (b*a)*This is equivalent to(a) (a + b)*(b) (a + b)* · (ab)+ + (a + b)* (ba)+(c) (a + b)*a + (a + b)* b(d) None of above
User Avatar
0 votes
0 answers
329
test series
L1 = {a^mb^nc^p | m ≥ n or n = p} L2 = {a^mb^nc^p | m ≥ n and n = p} (a) Both are NCFL’s (b) L1 is DCFL and L2 is NCFL (c) L1 is NCFL and L2 is not context-free (d) Both are not context-free Solution: Option (c) how it is possible plz explain indetail
L1 = {a^mb^nc^p | m ≥ n or n = p}L2 = {a^mb^nc^p | m ≥ n and n = p}(a) Both are NCFL’s(b) L1 is DCFL and L2 is NCFL(c) L1 is NCFL and L2 is not context-free(d) Both...
User Avatar
Page: