Register

Webpage

Programming in C. Recursion.
Filter

Hot questions in Programming and DS

1 votes
0 answers
4461
made easy
User Avatar
0 votes
1 answer
4462
Made easy
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the following will represents the worst case time complexity ? Ο(n) Ο(n log n) Ο(n2) Ο(1)
Consider we have an algorithm which generate preorder of any tree in Ο(log n) time, we have to create a Binary Search Tree with n distinct element. Which of the followin...
User Avatar
1 votes
1 answer
4465
Testbook
I am not getting how statement 3 is false and statement 4 is true. Statement 3: If the weights are unique, ho can there be multiple second best spanning trees? Statement 4: If the graph is triangle, wont there be any spanning tree?
I am not getting how statement 3 is false and statement 4 is true.Statement 3: If the weights are unique, ho can there be multiple second best spanning trees?Statement 4:...
User Avatar
4 votes
1 answer
4466
MadeEasy Subject Test: Programming & DS - Programming in C
What is the functionality of above function Do ( ) ? a. Check whether string is odd palindrome b. Check whether the string is even palindrome c. Check whether the string is palindrome d. None of the above
What is the functionality of above function Do ( ) ?a. Check whether string is odd palindromeb. Check whether the string is even palindromec. Check whether the string is...
User Avatar
1 votes
1 answer
4469
C programming
int main() { int a, b; /* Some code which initializes "a" here ... */ if (a < 0) { a = -a; } b = sqrt (a); } Above code will always work for calculating the square root of any valid integer value on a system . [T/F]
int main() { int a, b; /* Some code which initializes "a" here ... */ if (a < 0) { a = -a; } b = sqrt (a); }Above code will always work for calculating the square root of...
User Avatar
0 votes
1 answer
4471
test series
User Avatar
0 votes
2 answers
4473
pointer defination
User Avatar
0 votes
2 answers
4474
ACE test series
User Avatar
1 votes
1 answer
4475
Test by Bikram | Data Structures | Test 2 | Question: 13
The initial configuration of a queue is a, b, c, d (a is in the front). To get the configuration d ,c, b, a, we need minimum number of: $2$ deletions & $3$ additions $3$ deletions & $2$ additions $3$ deletions & $3$ additions $3$ deletions & $4$ additions
The initial configuration of a queue is a, b, c, d (a is in the front). To get the configuration d ,c, b, a, we need minimum number of:$2$ deletions & $3$ additions$3$ de...
User Avatar
2 votes
2 answers
4476
Binary search
If the binary search algorithm determines that the scanned argument is in upper half of the array,which of the following statement will set the appropriate variable to the appropriate value. A) startsub= middlesub-1; B) startsub=middlesub+1; C)stopsub=middlesub-1; D)stopsub=middlesub+1;
If the binary search algorithm determines that the scanned argument is in upper half of the array,which of the following statement will set the appropriate variable to th...
User Avatar
0 votes
0 answers
4478
GRAPH TRAVERSALS
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
WHY CROSS EDGES TURN TO BE BACK EDGES IN UNDIRECTED GRAPH IN DFS TRAVERSAL?? CAN ANYONE EXPLAIN THIS. WHY ARE THERE NO CROSS EDGES IN DFS OF UNDIRECTED GRAPH??
User Avatar
2 votes
1 answer
4480
doubt
User Avatar
Page: