search
Log In

Questions by pankaj_vir

0 votes
3 answers
1
What is the total number of comparisons needed in the best case to find minimum and maximum of $300 $ elements?
asked Oct 10, 2018 in Algorithms 262 views
1 vote
1 answer
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$
asked Aug 8, 2018 in Numerical Ability 229 views
0 votes
0 answers
3
Let $A$ be a nilpotent matrix. Show that $I + A$ is invertible.
asked Aug 8, 2018 in Linear Algebra 115 views
0 votes
2 answers
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}$.
asked Aug 8, 2018 in Linear Algebra 238 views
0 votes
1 answer
6
1 vote
1 answer
7
1 vote
2 answers
8
2 votes
1 answer
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 ________.
asked Mar 11, 2018 in DS 159 views
0 votes
2 answers
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
asked Mar 11, 2018 in Operating System 129 views
0 votes
1 answer
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 ________.
asked Mar 10, 2018 in DS 82 views
2 votes
2 answers
12
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
asked Mar 10, 2018 in DS 362 views
2 votes
2 answers
15
long fun( char * s){ long r = 0; for( ; *s ; r = (r << 1) | (*s++ - '0')); return r; } What does the fun("000001010") returns?
asked Jun 13, 2017 in Programming 312 views
...