233 views

Please log in or register to answer this question.

Related questions

1 votes
1 votes
1 answer
1
Prakhar Garg asked Mar 18, 2019
1,208 views
Find the complexity of below pseudocode.temp = 1repeat for i=1 to n temp=temp +1; n=n/2;until n<= 1
0 votes
0 votes
0 answers
2
manvi_agarwal asked Sep 10, 2018
549 views
https://gateoverflow.in/?qa=blob&qa_blobid=17275535249024428371
0 votes
0 votes
1 answer
3
deepak_8404 asked Oct 1, 2023
280 views
Consider a lower triangular matrix stored in row major order as p[-25 - - + 749][-25 - - - + 749] with base address = 6800, size of each element = 6 byte. Find the value ...
0 votes
0 votes
1 answer
4
jugnu1337 asked May 16, 2023
802 views
The total number of binary trees possible with height n - 2 having n nodes are?(2n - 5)^ 2n - 3 (2n - 7)^2n - 3(n - 3) ^2n - 2(2n - 7)^ 2n - 2