–1 votes
0 answers
1
How to find identity element of a function ? Ex : f(x)= x+y-3How to find identity element of fog(x) ? please take an example and explain for fog(x)
2 votes
1 answer
2
$\int_{0}^{\frac{\pi}{4}}( \sec 2x -\tan 2x )\ dx$
0 votes
1 answer
3
$\int_{- \pi }^{\pi} t^{2} \sin t \ dt$
0 votes
0 answers
4
f(x) = x^ (-1/3)Show that f(x) isnot countinuous in [-1,1] andnot bounded [-1,1]
0 votes
0 answers
5
Give normalized eigon vector for 3*3 matrix A[ij] , in general
3 votes
1 answer
6
f(n) = $\Theta (n^{2})$ g(n) = $\Omega (n)$ h(n)=O(log n) then [ f(n) . g(n) ] + [h(n) . f(n) ] is $\Omega (n)$$\Theta (n^{2})$O(log n)None
0 votes
0 answers
7
How this is true ?$_{r}^{\frac{n(n-1)}{2}}\textrm{C} = 2^{\frac{n(n-1))}{2}}$
1 votes
1 answer
8
What is the difference betwen 2s complent of a number and 2s complement representation of a number .
0 votes
1 answer
13
Given a classful network if we are given an IP address . How do we deffertiate it as DBA or Subnetmask ? Are the same ? Please explain with an example
1 votes
1 answer
14
Negative Number AND Operation Result in True . Why it is SO ?printf("%d", -1&&1);printf("%d", -1&&-1);
0 votes
0 answers
15
Is Turing Machine that accpet Regular Languages Decidable ?
0 votes
1 answer
16
Solve the following Recurrence Equation using back substitution methodT(n)= T(n-1)+log n​
1 votes
0 answers
17
Solve the following Recurrence Equation using back substitution method T(n)= 2T(n/2)+log n​
0 votes
2 answers
18
1 votes
1 answer
19
Complexity of the below code snippet is ..for (i=1;i<=n;++i) { j=2; while(j<=n) { j=j*j; c=c+1; } }$O(nlog n)$$O(n^{2})$$O(nloglog n)$$O(n)$
0 votes
1 answer
20
$f(x) = n^{log (n)}$ $g(x) = nlog (n)$ $h(x) = 2^{n}$Arrange Them in Increasing Order of rate of growth