Register

Recent questions tagged test-series

1 votes
0 answers
331
Test Series
User Avatar
2 votes
1 answer
334
Test Series
User Avatar
1 votes
0 answers
335
Test Series
User Avatar
0 votes
0 answers
338
TESTBOOK TESTSERIES
User Avatar
1 votes
2 answers
339
Time Complexity
What will be TC here? Ans given $O(n^{2})$ , while I am getting $O(n)$
What will be TC here?Ans given $O(n^{2})$ , while I am getting $O(n)$
User Avatar
5 votes
2 answers
340
Test Algorithms
What is the space complexity of the following code? $O(logn)$ $O(n)$ $O(nlogn)$ $O(1)$
What is the space complexity of the following code?$O(logn)$ $O(n)$$O(nlogn)$ $O(1)$
User Avatar
0 votes
2 answers
341
doubt in logarithm
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
can you please explain how 1-(1/2)^ln(n) becomes (n-1)/n ?
User Avatar
0 votes
1 answer
342
#testseries
User Avatar
1 votes
2 answers
343
Time Complexity
User Avatar
1 votes
2 answers
345
Sorting
Could a binary search tree be built using o(n lg n) comparisons in the comparison model? Explain why or why not.
Could a binary search tree be built using o(n lg n) comparisons in the comparisonmodel? Explain why or why not.
User Avatar
3 votes
2 answers
346
Test-series algorithms
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2. void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j++) printf("GeeksforGeeks"); }
What is the time complexity of following function fun()? Assume that log(x) returns log value in base 2.void fun() { int i, j; for (i=1; i<=n; i++) for (j=1; j<=log(i); j...
User Avatar
1 votes
2 answers
348
Radix sort
User Avatar
0 votes
2 answers
350
Big O
Explain b and c part???
Explain b and c part???
User Avatar
0 votes
2 answers
352
Number of tokens
In this question we will take n-=n1 as n=n-n1 as 5 tokens or n-=n1 as 4 tokens ????
In this question we will take n-=n1 as n=n-n1 as 5 tokens or n-=n1 as 4 tokens ????
User Avatar
0 votes
0 answers
353
testbook testseries
Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF $2^{k+1}-1$ $3.2^{k}-1$ $2^{k+1}+1$ $3.2^{k}+1$
Maximum number of nodes in the derivation tree when a word of length 2k is derived from a grammar in CNF$2^{k+1}-1$$3.2^{k}-1$$2^{k+1}+1$$3.2^{k}+1$
User Avatar
0 votes
1 answer
354
Self-Doubt
User Avatar
0 votes
1 answer
355
Gate_2019_Mock_Paper
Please explained in detail
Please explained in detail
User Avatar
Page: