Register
Filter

Questions by pankaj_vir

0 votes
3 answers
1
Find total number of comparisons needed
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
2 votes
1 answer
2
Infinite series
Find the infinite sum of the series $1 + \frac{4}{7} + \frac{9}{7^2} + \frac{16}{7^3} + \frac{25}{7^4} + .............\Join$
Find the infinite sum of the series$1 + \frac{4}{7} + \frac{9}{7^2} + \frac{16}{7^3} + \frac{25}{7^4} + .............\Join$
0 votes
0 answers
3
Invertible Matrix
Let $A$ be a nilpotent matrix. Show that $I + A$ is invertible.
Let $A$ be a nilpotent matrix. Show that $I + A$ is invertible.
1 votes
2 answers
4
Invertible Matrix
Let A be a $5 × 5$ invertible matrix with row sums $1$. That is $\sum_{j=1}^{5} a_{ij} = 1$ for $1 \leq i\leq 5$. Then, what is the sum of all entries of $A^{-1}$.
Let A be a $5 × 5$ invertible matrix with row sums $1$. That is $\sum_{j=1}^{5} a_{ij} = 1$ for $1 \leq i\leq 5$. Then, what is the sum of all entries of $A^{-1}$.
0 votes
2 answers
5
TOC Problem
0 votes
1 answer
6
Testbook_TOC
2 votes
1 answer
7
Sorting
1 votes
2 answers
8
Minimum Spanning Tree Problem
0 votes
1 answer
11
test series
When searching for the key value 50 in a binary search tree, the node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number of different orders passing in which these keys values can occur on the search path from the root to the node containing the value 50 is ________.
When searching for the key value 50 in a binary search tree, the node containing the key values 10, 30, 40, 70, 90, 120, 150, 175 are traversed, in any order. The number ...
5 votes
2 answers
12
wooe test
In what order we should insert the following elements into an empty AVL tree so that we don’t have to perform any rotation on it. 1, 2, 3, 4, 5, 6, 7 A. 4, 2, 1, 6, 3, 5, 7 B. 4, 2, 6, 1, 3, 5, 7 C. 6, 4, 5, 7, 1, 2, 3 D. 4, 5, 3, 2, 1, 6, 7
In what order we should insert the following elements into an empty AVL tree so that we don’t have to perform any rotation on it. ...
2 votes
2 answers
15
C Programming
long fun( char * s){ long r = 0; for( ; *s ; r = (r << 1) | (*s++ - '0')); return r; } What does the fun("000001010") returns?
long fun( char * s){ long r = 0; for( ; *s ; r = (r << 1) | (*s++ - '0')); return r;}What does the fun("000001010") returns?