Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by shreshtha5
6
votes
1
Let s be a sorted array of n integers. Let t(n) denote the time taken for the most efficient algorithm to determined if there are two elements with sum less than 1000 in s.What will be the time complexity???????
3.3k
views
answered
Jul 18, 2015
Algorithms
algorithms
sorting
time-complexity
+
–
1
votes
2
which of the following is correct.....
Let $f(n)=\Omega(n), g(n)=O(n)$ and $h(n)=\Theta(n)$. Then $g(n)+f(n).h(n)=$................... $\Omega(n)$ $\Omega(n^2)$ $\Theta(n)$ $\Theta(n^2)$
Let $f(n)=\Omega(n), g(n)=O(n)$ and $h(n)=\Theta(n)$. Then $g(n)+f(n).h(n)=$...................$\Omega(n)$$\Omega(n^2)$$\Theta(n)$$\Theta(n^2)$
458
views
answered
Jul 17, 2015
Algorithms
algorithms
asymptotic-notation
multiple-selects
+
–
1
votes
3
math
575
views
answered
Jul 17, 2015
1
votes
4
calculate limit
$\lim_{x\rightarrow 0}\left ( \frac{a^{x}+b^{x}}{2} \right )^{^{\frac{1}{x}}}$
$\lim_{x\rightarrow 0}\left ( \frac{a^{x}+b^{x}}{2} \right )^{^{\frac{1}{x}}}$
501
views
answered
Jul 11, 2015
Calculus
calculus
limits
+
–
1
votes
5
calculate limit
$\lim_{x\rightarrow \frac{\pi}{4}} (\tan x)^{\tan 2x}$
$\lim_{x\rightarrow \frac{\pi}{4}} (\tan x)^{\tan 2x}$
411
views
answered
Jul 11, 2015
Calculus
calculus
limits
+
–
3
votes
6
calculate limit
$\lim_{\theta \rightarrow 0} \frac{ 1-\cos \theta }{ \theta \sin\theta }$
$\lim_{\theta \rightarrow 0} \frac{ 1-\cos \theta }{ \theta \sin\theta }$
790
views
answered
Jul 11, 2015
Calculus
calculus
limits
+
–
3
votes
7
solve
Minimum number of 2 × 1 multiplexers required to realize the following function f=A'B'C+A'B'C' Assume that inputs are available only in true and boolean constants 1 and 0 are available.
Minimum number of 2 × 1 multiplexers required to realize the followingfunctionf=A'B'C+A'B'C'Assume that inputs are available only in true and boolean constants 1and...
1.9k
views
answered
Jul 2, 2015
3
votes
8
plz answer
the minimum number of states in the PDA accepting the language $L=\left\{a^n b^m \mid n>m;m,n>0 \right\}$ a) 2 b) 3 c) 4 d) 5
the minimum number of states in the PDA accepting the language$L=\left\{a^n b^m \mid n>m;m,n>0 \right\}$a) 2b) 3c) 4d) 5
2.9k
views
answered
Apr 27, 2015
Theory of Computation
theory-of-computation
pushdown-automata
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register