# Recent posts tagged mtech

1
First instance of T2 is arriving at T1, so second instance at 1+7 = T8. Now, if finishes at T9 and next arrival is only at T15.
3
There is no limit on a large value being considered. f(n)= n^0.0000001 = n^(10^-7) g(n)=lg n(base 2) n= 10^8 f(n)= 1.000001842 , g(n)=26.565 Now, I take n = 10^(10^8) f(n) = n^(10^-7) = (10^(10^8))^(10^-7) = 10^(10^(8-7)) = 10^10 g(n) = 10^8 log10 2 So, f(n) becomes larger. Thus for any x, we can have an n, where nx becomes larger than log n and stays larger from there on wards for any higher n.
4
The function terminates for all powers of $2$ (which is infinite), hence (i) is false and (ii) is TRUE. Let $n = 5.$ Now, recursive calls will go like $5 - 14 - 7 - 20 - 10 - 5 -$ And this goes into infinite recursion. And if we multiply $5$ with ... possible, there are infinite recursions possible (even considering this case only). So, (iv) is TRUE and (iii) is false. So, correct answer is (D).
5
no. It asks for "NOT" supported in HTML
6
Its not a difficult topic- but not highlighted in books. Most books tell what common students want. The fact that you asked this question shows that you are interested in learning and you should definitely go for MTech or MS.
7
We wish to schedule three processes $P1$, $P2$ and $P3$ ... -preemptive scheduling respectively? $30$ sec, $30$ sec $30$ sec, $10$ sec $42$ sec, $42$ sec $30$ sec, $42$ sec
8
In how many ways can we distribute $5$ distinct balls, $B_1, B_2, \ldots, B_5$ in $5$ distinct cells, $C_1, C_2, \ldots, C_5$ such that Ball $B_i$ is not in cell $C_i$, $\forall i= 1,2,\ldots 5$ and each cell contains exactly one ball? $44$ $96$ $120$ $3125$
To see more, click for the full list of questions or popular tags.