# Questions by pankaj_vir

1
What is the total number of comparisons needed in the best case to find minimum and maximum of $300$ elements?
1 vote
2
Find the infinite sum of the series $1 + \frac{4}{7} + \frac{9}{7^2} + \frac{16}{7^3} + \frac{25}{7^4} + .............\Join$
3
Let $A$ be a nilpotent matrix. Show that $I + A$ is invertible.
4
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}$.
5
6
1 vote
7
1 vote
8
9
Consider the following elements inserted into an empty AVL tree in the following order 25, 10, 15, 17, 30, 35, 40, 21, 28 If [L(d)] be the sum of elements on left side of root and (Rd) be the sum of elements on right side of root, then the value of [(Rd) – (Ld) + Root] is ________.
10
Consider 3 processes A, B, and C to be scheduled as per SRTF scheduling. The process A is known to be scheduled first and when A has been running for 7 units of time the process C has arrived. The process C has run for 1 unit of time, then the process B has arrived and completed running for 2 units of time. Then what could be the minimum burst time of processes A and C? 11, 3 12,3 11,4 12,4
11
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 ________.