0 votes
1
What is Dijkstra's algorithm running time using sorted array?
0 votes
3
√logx = O(loglogx) is it true or false?and explain why?
0 votes
4
Given below are 4 functions$999999n$$0.99999 n logn$$1.000001^{n}$$n^{2}$The increasing order of the above functions in terms of their asymptotic complexity is?
0 votes
5
Let f(n) =O(n), g(n)=Ώ(n) and h(n)=Θ(n). Then g(n)+f(n).h(n) is _____?a- Ω($n^{2}$)b- Θ($n^{2}$)c-Ω(n)d-Θ(n)
0 votes
6
Any condition for f(n) and g(n) or any value we can take??? I m confused becoz in big oh right side part must b greater than equal ??
2 votes
10
Perform the arithmetic operations (+42) + (-13) and (-42) – (-13) using binary signed 2’s complement representation for the negative numbers.
0 votes
13
$\underset{x \to \infty}{\lim} \left( 1 + \dfrac{1}{x^2} \right) ^x$ equals$-1$$0$$1$Does not exist